Improving branch and bound for Jobshop scheduling with constraint propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 129-149

  Caseau, Yves ^a   Laburthe, François ^b  

^a Bouygues Telecom   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Branch and bound; Constraints; Heuristics; Jobshop scheduling; Propagation

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORESTRY; INTEGER PROGRAMMING; SCHEDULING; WAVE PROPAGATION;

BOUND ALGORITHMS; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; CONSTRAINTS; CUTTING PLANES; HARD PROBLEMS; HEURISTICS; SCHEDULING PROBLEM;

JOB SHOP SCHEDULING;

EID: 84947976062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_79     Document Type: Conference Paper

References (23)

1. J.Adams, E. Balas & D. Zawak. The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34, p391-401. 1988
2. D. Applegate & B. Cook. A Computational Study of the Job Shop Scheduling Problem. Operations Research Society of America 3, 1991
3. E. Balas. Machine Sequencing via Disjunctive Programming: an Implicit Enumeration Algorithm. Operations Research 17, p 941-957. 1969
4. E. Balas On the facial structure of Scheduling Polyhedra, Mathematical Programming studies 24, p. 179-218.
5. P. Baptiste, C. Le Pape A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. Proc. of the 14 th International Joint Conference on Artificila Intellignece, 1995.
6. J. Carlier. The one machine sequencing problem European Journal of Operations Research 11, p. 42-47, 1982.
7. J. Carlier & E. Pinson. An Algorithm for Solving the Job Shop Problem. Management science, vol 35, no 2, february 1989
8. J. Carlier & E. Pinson. Adjustments of heads and tails for the job-shop problem , European Journal of Operations Research, vol 78, 1994, p. 146-161.
9. Y. Caseau. A Deductive Object-Oriented Language. Annals of Maths and Artificial Intelligence, Special Issue on Deductive Databases, March 1991.
10. Y. Caseau, P.-Y. Guillo & E. Levenez. A Deductive and Object-Oriented Approach to a Complex Scheduling Problem. Proc. of DOOD’93, 1993
11. Y. Caseau & P. Koppstein. A Cooperative-Architecture Expert System for Solving Large Time/Travel Assignment Problems. International Conference on Databases and Expert Systems Applications, Spain, 1992.
12. Y. Caseau & F. Laburthe. Improved CLP Scheduling with Task Intervals. Proc. of the Eleventh International Conference on Logic Programming, ed: P. van Hentenryck, The M1T Press, 1994.
13. Y, Caseau & F. Laburthe. Disjunctive Scheduling with Task Intervals. LIENS report 95-25, École Normale Supérieure, 1995.
14. L. Ojerid & M.-C. Portmann. Comment entrecroiser des procédures par séparation et évaluation et des algorithmes génétiques: application à des problèmes d’ordonnancement à contraintes disjonctives. FRANCORO, Mons, 1995, p. 84-85
15. M. Dell’Amico & M. Trubian. Applying Tabu-Search to tire Job-Shop Scheduling Problem. Annals of Operations Research, vol 41, 1993, p. 231-252
16. M. Dyer & L.A. Wolsey. Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program. Discrete Applied Mathematics 26, p.255-270. 1990.
17. S. Lawrence. Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques. GSIA, C.M.U. 1984
18. J.F. Muth & G.L. Thompson Industrial scheduling. Prentice Hall, 1963
19. Nakano & Yamada A Genetic Algorithm applicable to Large Scale Job- Shop Problems. Parallel Problem solving from Nature 2, Elsevier, 1992.
20. E. Taillard. Parallel Taboo Search Technique for the Jobshop Scheduling Problem. Internal Report ORPWP 89/11, École Polytechnique Fédérale de Lausanne, 1989
21. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, Cambridge, 1989.
22. S.L. Van De Velde. Machine scheduling and Lagrangian relaxation. Doctoral Thesis, CWI, Amsterdam, 1991
23. P van Laarhoven, E.Aarts & J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research vol 40, no 1, 1992