Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
暂无分享,去创建一个
Frank Werner | Heidemarie Bräsel | Per Willenius | Michael Andresen | Jan Tusch | Marc Mörig | Frank Werner | Jan Tusch | Michael Andresen | H. Bräsel | Marc Mörig | Per Willenius
[1] Peter Brucker,et al. A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..
[2] Christos Koulamas,et al. Open shop scheduling with makespan and total completion time criteria , 2000, Comput. Oper. Res..
[3] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[4] Chun-Yuan Cheng,et al. The total completion time open shop scheduling problem with a given sequence of jobs on one machine , 2002, Comput. Oper. Res..
[5] Joseph Y.-T. Leung,et al. Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops , 1993, J. Algorithms.
[6] Christian Prins,et al. Classical and new heuristics for the open-shop problem: A computational evaluation , 1998, Eur. J. Oper. Res..
[7] Heidemarie Bräsel,et al. On the open-shop problem with preemption and minimizing the average completion time , 2004, Eur. J. Oper. Res..
[8] Maxim Sviridenko,et al. Approximation algorithms for shop scheduling problems with minsum objective , 2002 .
[9] Erwin Pesch,et al. Solving the open shop scheduling problem , 2001 .
[10] C. Y. Liu,et al. On the complexity of preemptive open-shop scheduling problems , 1985 .
[11] W. Kubiak,et al. A Note On The Complexity Of Openshop Scheduling Problems , 1991 .
[12] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[13] Ching-Fang Liaw,et al. A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..
[14] Frank Werner,et al. Constructive heuristic algorithms for the open shop problem , 1993, Computing.
[15] Frank Werner,et al. Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..
[16] Mutsunori Banbara,et al. Compiling Finite Linear CSP into SAT , 2006, CP.
[17] Jatinder N. D. Gupta,et al. Two‐machine open shop scheduling with secondary criteria , 2003 .
[18] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[19] Christian Blum,et al. Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..
[20] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[21] Christian Prins,et al. An Overview of Scheduling Problems Arising in Satellite Communications , 1994 .
[22] Philippe Laborie,et al. Complete MCS-Based Search: Application to Resource Constrained Project Scheduling , 2005, IJCAI.
[23] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[24] Frank Werner,et al. Heuristic constructive algorithms for open shop scheduling to minimize mean flow time , 2008, Eur. J. Oper. Res..
[25] Robert L. Bulfin,et al. Scheduling ordered open shops , 1987, Comput. Oper. Res..
[26] Francis Y. L. Chin,et al. Scheduling the Open Shop to Minimize Mean Flow Time , 1982, SIAM J. Comput..
[27] Graham K. Rand,et al. Implementing Flexible Manufacturing Systems , 1989 .
[28] Christian Prins,et al. Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..
[29] Daniele Vigo,et al. A tabu search algorithm for the Open Shop problem , 1997 .
[30] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[31] Christelle Guéret,et al. A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..