Competitive genetic algorithms for the open-shop scheduling problem

Mathematical Methods of Operations Research

Volumn 52, Issue 3, 2000, Pages 389-411

  Prins, Christian ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Benchmarks; Genetic algorithm; Heuristic; Open shop; Scheduling

Indexed keywords

EID: 0009204680     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000090     Document Type: Article

References (27)

1. Alcaide D, Sicilia J, Vigo D (1997) Heuristic approaches for the minimum makespan open shop problem. Trabajos de Investigación Operativa 5(2):283-296
2. Bräsel H, Tautenhahn T, Werner F (1993) Constructive heuristic algorithms for the open-shop problem. Computing 51:95-110
3. Brucker P, Hurink J, Jurisch B, Wöstmann B (1997) A branch-and-bound algorithm for the open-shop problem. Discrete Applied Mathematics 76:43-49. With hard benchmarks available at //www.mathematik.uni-osnabrueck.de/research/OR/software.html
4. Brucker P, Thiele O (1996) A branch-and-bound method for the general shop problem with sequence-dependent setup-times. OR Spektrum 18:145-161
5. Della Croce F, Tadei R, Volta G (1995) A genetic algorithm for the job-shop problem. Computers and operations research 22:15-24
6. Djerid L, Portmann M-C, Villon P (1996) Performance analysis of permutation cross-over genetic operators. Journal of Decision Systems 5(1/2):157-177
7. Dorndorf U, Pesch E, Phan Huy T (1999) Solving the open-shop scheduling problem. Working paper, University of Bonn, November
8. Falkenauer E, Bouffouix S. A genetic algorithm for job-shop, in Proceedings of the 1991 IEEE International Conference on Robotics and Automation
9. Fang H-L, Ross P, Corne D (1994) A promising hybrid GA/Heuristic approach for open-shop scheduling problems. Proceedings of ECAI 94 (11th European Conference on Artificial Intelligence), 590-594. Edited by A. Cohn and published by John Wiley & Sons Ltd
10. French S (1982) Sequencing and scheduling. Ellis-Horwood
11. Giffler B, Thompson GL (1960) Algorithms for solving production scheduling problems. Operations Research 8:487-503
12. Guéret C, Prins C (1999) A new lower bound for the open-shop problem. Annals of Operations Research 92:165-183. Benchmarks at http://www.emn.fr/gueret/OpenShop/OpenShop/html
13. Guéret C, Prins C (1998) Classical and new heuristics for the open-shop problem: a computational evaluation. European Journal of Operational Research 107(2):306-314
14. Guéret C, Jussien N, Prins C (2000) Using intelligent backtracking to improve branch-and-bound methods: an application to open-shop problems. European Journal of Operational Research 127 (2):344-354
15. Guéret C, Prins C (1998) Forbidden intervals for open-shop problems. Research Report 98/ 10/AUTO, Ecole des Mines de Nantes
16. Guéret C, Prins C (1998) Efficient heuristic black boxes for the open-shop: comparison with other methods on three benchmarks. Research Report 98/11/AUTO, Ecole des Mines de Nantes
17. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, USA
18. Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. Journal of the ACM 23(4):665-679
19. Hartmann S (1998) A Competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45(7):733-750
20. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press: Michigan
21. Kleinau U (1991) On some new methods for solving machine scheduling problems. Preprint 16/91, TU Magdeburg
22. Liaw CF (1999) A tabu search algorithm for the open-shop scheduling problems. Computers and Operations Research 26(2):109-126
23. Nakano R, Yamada T (1991) Conventional genetic algorithms for job-shop problems. Proceedings of the 4th International Conference on Genetic Algorithms, San Mateo, California, Morgan Kaufmann Publishers 1991:474-479
24. Portmann MC, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research 107:389-400
25. Reeves CR (1996) Modern heuristic techniques for combinatorial problems. Blackwell Scientific, Oxford, United Kingdom
26. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Computers and Operations Research 22(1):5-13
27. Taillard E (1993) Benchmarks for basic scheduling problems. European Journal of Operational Research 64:278-285. Benchmarks at http://mscmga.ms.ic.ac.uk/jeb/orlib/openshopinfo.html