Fast parallel heuristics for the job shop scheduling problem
暂无分享,去创建一个
[1] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Takeshi Yamada,et al. A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.
[4] Vijay V. Vazirani,et al. The Two-Processor Scheduling Problem is in Random NC , 1989, SIAM J. Comput..
[5] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[6] Ernst W. Mayr,et al. Two Processor Scheduling is in NC , 1986, Aegean Workshop on Computing.
[7] B. Roy,et al. Les Problemes d'Ordonnancement , 1967 .
[8] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[9] Jens Clausen,et al. Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..
[10] Éric D. Taillard,et al. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..
[11] Han Hoogeveen,et al. Short Shop Schedules , 1997, Oper. Res..
[12] R. Storer,et al. New search spaces for sequencing problems with application to job shop scheduling , 1992 .
[13] Lefteris M. Kirousis. Fast Parallel Constraint Satisfaction , 1993, ICALP.
[14] Sartaj Sahni,et al. A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..
[15] Ludek Kucera,et al. Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.
[16] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[17] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[18] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[19] Emile H. L. Aarts,et al. Sequential and parallel local search algorithms for job shop scheduling , 1997 .
[20] O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules , 1992 .
[21] Simon Kasif,et al. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..
[22] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[23] Paul G. Spirakis,et al. A Parallel Algorithm for Two Processors Precedence Constraint Scheduling , 1991, ICALP.
[24] C.K. Wong,et al. Two simulated annealing-based heuristics for the job shop scheduling problem , 1999, Eur. J. Oper. Res..
[25] Chak-Kuen Wong,et al. On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem , 1998, RANDOM.
[26] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[27] Wojciech Rytter,et al. Efficient parallel algorithms , 1988 .
[28] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .