A new exact solution algorithm for the job shop problem with sequence-dependent setup times

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

Volumn 3011, Issue , 2004, Pages 37-49

  Artigues, Christian ^a   Belmokhtar, Sana ^b   Feillet, Dominique ^a  

^a UNIVERSITY OF AVIGNON   (France)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

COMPLETION TIME; CONSTRAINT PROPAGATION; ELEMENTARY OPERATIONS; JOB SHOP PROBLEM; NEW EXACT SOLUTIONS; SEQUENCE-DEPENDENT SETUP TIME; SOLUTION APPROACH; TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS;

JOB SHOP SCHEDULING;

EID: 35048827872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_3     Document Type: Article

References (16)

1. Adams J., Balas E. and Zawack D. (1988) The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manag Sci 34:391-401.
2. Artigues C., Lopez P. and Ayache P.D. (2003), Schedule generation schemes and priority rules for the job-shop problem with sequence dependent setup times: Dominance properties and computational analysis, to appear in Annals of Operations Research.
3. Artigues C. and Buscaylet F. (2003), A fast tabu search method for the job-shop problem with sequence-dependent setup times. Proceedings of the Metaheuristic International Conference MIC'2003, Kyoto 2003.
4. Baptiste P., Le Pape C. and Nuijten W. (2001), Constrained-Based scheduling, Applying constraint programming to Scheduling Problems, Kluwer's International Series, 19-37.
5. Blazewicz J. ,Domschke W. and Pesch E. (1996), The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93(1):1-33.
6. Brucker P. and Thiele O. (1996), A branch and bound method for the general-shop problem with sequence-dependent setup times, Operations Research Spektrum, 18, 145-161.
7. Carlier J. and Pinson E. (1989), An algorithm for solving the Job-Shop Problem. Management Science 35, 164-176.
8. Choi I.-N. and Choi D.-S. (2002), A local search algorithm for jobshop scheduling problems with alternative operations ans sequence-dependent setups, Computers and Industrial Engineering 42, 43-58.
9. Focacci F., Laborie P. and Nuijten W. (2000), Solving scheduling problems with setup times and alternative resources. In Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenbridge, Colorado, 92-101.
10. Focacci F. and Lodi, A. (1999), Solving TSP with Time Windows with Constraints, International Conference on Logic Programming 515-529.
11. ILOG SOLVER 5.2 User's Manuel (2000), ILOG.
12. ILOG SCHEDULER 5.2 User's Manuel (2000), ILOG.
13. Nowicki E. and Smutnicki C. (1996), A fast taboo search algorithm for the job shop problem, Management Science 42, 797-813.
14. Pesant G., Gendreau M., Potvin J-Y. and Rousseau J-M. (1999), An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows, European Journal of Operational Research 117, 253-263.
15. Vaessens R. J. M., Aarts E. H. L. and Lenstra J. K. (1996), Job Shop Scheduling by Local Search, INFORMS Journal on Computing 8, 302-317.
16. Vilím P. and Barták, R. (2002), Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times, In Ghallab, Hertzberg, and Traverse (eds.) Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002). AAAI Press, Toulouse, p. 312-320.