Harmonogramowanie przedsięwzięć wieloobiektowych z ciągłą realizacją procesów na działkach roboczych

[1]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[2]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[3]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

[4]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[5]  Barrett W. Thomas,et al.  Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines , 2009, Comput. Oper. Res..

[6]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[7]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[8]  Ying-Wu Chen,et al.  A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem , 2008, Eng. Appl. Artif. Intell..

[9]  Wei Tsang Ooi,et al.  A stochastic dynamic traveling salesman problem with hard time windows , 2009, Eur. J. Oper. Res..

[10]  Amin Saberi,et al.  An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.

[11]  Michał Podolski.  Analiza nowych zastosowań teorii szeregowania zadań w organizacji robót budowlanych , 2008 .

[12]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[13]  Jianping Li,et al.  An improved approximation algorithm for the ATSP with parameterized triangle inequality , 2009, J. Algorithms.