Solving the open shop scheduling problem

Journal of Scheduling

Volumn 4, Issue 3, 2001, Pages 157-174

  Dorndorf, Ulrich ^a   Pesch, Erwin ^a   Phan Huy, Toàn ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Branch and bound; Constraint propagation; Open shop

Indexed keywords

EID: 0141556621     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.73     Document Type: Article

References (29)

1. Błażewicz J, Ecker K, Pesch E, Schmidt G, Wȩglarz J. Scheduling Computer and Manufacturing Processes. Springer: Heidelberg, 1996.
2. Brucker P, Hurink J, Jurisch B, Wöstmann B. A branch and bound algorithm for the open shop problem. Discrete Applied Mathematics 1997; 76:43-59.
3. Guéret C, Jussien N, Prins C. Using intelligent backtracking to improve branch and bound methods: an application to open shop problems. Technical Report, École des Mines de Nantes, Nantes, 1998.
4. Applegatc D, Cook W. A computational study of the job shop scheduling problem. ORS A Journal on Computing 1991; 3:149-156.
5. Carlier J, Pinson E. Adjustments of head and tails for the job shop problem. European Journal of Operational Research 1994; 78:146-161.
6. Caseau Y, Laburthe F. Disjunctive scheduling with task intervals. Technical Report 95-25, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris, 1995.
7. Martin P, Shmoys DB. A new approach to computing optimal schedules for the job shop scheduling problem. Proceedings of the 5th International IPCO Conference, 1996.
8. Roy D, Sussmann B. Les problèmes d'ordonnancement avec contraintes disjonctives. Note D. S. 9, SEMA, Paris, 1964.
9. Guéret C, Prins C. Classical and new heuristics for the open shop problem: a computational evaluation. European Journal of Operational Research 1998; 107:306-314.
10. Brāsel H, Tautenhahn T, Werner F. Constructive heuristic algorithms for the open shop problem. Computing 1993; 51:95-110.
11. Guéret C, Prins C. Forbidden intervals for open-shop problems. Research Report 98/10/AUTO, Ecole de Mines de Nantes, Nantes, 1998.
12. Ramudhin A, Marier P. The generalized shifting bottleneck procedure. European Journal of Operational Research 1996; 93:34-48.
13. Werner F, Winkler A. Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics 1995; 58:191-211.
14. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64:278-285.
15. Liaw CF. An iterative improvement approach for nonpreemptivc open shop scheduling problem. European Journal of Operational Research 1998; 111:509-517.
16. Prins C. Competitive genetic algorithms for the open-shop scheduling problem. Mathematical Methods of Operations Research 2000; 52:389-411.
17. Tsang E. Foundations of Constraint Satisfaction. Academic Press: Essex, 1993.
18. Dorndorf U, Pesch E, Phan-Huy R. Constraint propagation techniques for the disjunctive scheduling problem. Artificial Intelligence 2000; 122:189-240.
19. Dorndorf U, Phan-Huy T, Pesch E. A survey of interval capacity consistency tests for time and resource constrained scheduling. In Project Scheduling - Recent Models, Algorithms and Applications, Wȩglarz J (ed.). Kluwer Academic Publishers: Boston, 1999; 213-238.
20. Carlier J, Pinson E. An algorithm for solving the job shop problem. Management Science 1989; 35:164-176.
21. Brucker P, Jurisch B, Krämer A. The job shop problem and immediate selection. Annals of Operations Research 1994; 50:73-114.
22. Carlier J, Pinson E. A practical use of Jackson's preemptive schedule for solving the job shop problem. Annals of Operations Research 1990; 26:269-287.
23. Jackson J. An extension on Johnson's results on job lot scheduling. Naval Research Logistics Quarterly 1956; 3:201-203.
24. Nuijten WPM. Time and resource constrained scheduling: a constraint satisfaction approach. Ph. D Thesis, Eindhoven University of Technology, 1994.
25. Phan-Huy T. Constraint Propagation in Flexible Manufacturing. Springer: Heidelberg, 2000.
26. Baptiste P, Le Pape C. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995; 136-140.
27. Baptiste P, Le Pape C. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. Proceedings of the 15th Workshop of the U.K. Planning Special Interest Gropu, Liverpool, 1996.
28. Brucker P, Jurisch B, Sievers B. A fast branch and bound algorithm for the job shop scheduling problem. Discrete Applied Mathematics 1994; 49:107-127.
29. Gueret C, Prins C. A new lower bound for the open-shop problem. Annals of Operations Research 1999; 92:165-183.