Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis

Annals of Operations Research

Volumn 138, Issue 1, 2005, Pages 21-52

  Artigues, Christian ^a   Lopez, Pierre ^b   Ayache, Pierre Dimitri ^a  

^a UNIVERSITY OF AVIGNON   (France)

^b LAAS CNRS   (France)

Author keywords

Dominance properties; Job shop; Priority rules; Schedule generation scheme; Scheduling theory; Sequence dependent setup times

Indexed keywords

EID: 24144468136     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-2443-4     Document Type: Article

References (21)

1. Adams, J., E. Balas, and D. Zawack. (1988). "The Shifting Bottleneck Procedure for Jobshop Scheduling." Management Science 34, 391-401.
2. Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). "A Review of Scheduling Research Involving Setup Considerations." Omega 27, 219-239.
3. Artigues, C. and F. Roubellat. (2002). "An Efficient Algorithm for Operation Insertion in Practical Jobshop Schedules." Production Planning and Control 13(2), 175-186.
4. Baker, K.R. (1974). Introduction to Sequencing and Scheduling. Wiley.
5. Brucker, P. and O. Thiele. (1996). "A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup Times." Operations Research Spektrum 18, 145-161.
6. Carlier, J. and E. Néron. (2000). "An Exact Method for Solving the Multi-Processor Flow-Shop." RAIRO Operations Research 34(1), 1-25.
7. Focacci, F., P. Laborie, and W. Nuijten. (2000). "Solving Scheduling Problems With Setup Times and Alternative Resources." In Fifth International Conference on Artificial Intelligence Planning and Scheduling Breckenbridge, Colorado, pp. 92-101.
8. Giffler, B. and G.L. Thompson. (1960). "Algorithms for Solving Production Scheduling Problems." Operations Research 8(4), 487-503.
9. Gupta, S.K. (1986). "N Jobs and m Machines Job-Shop Problems with Sequence-Dependent Set-up Times." International Journal of Production Research 20(5), 643-656.
10. Hurink, J. and S. Knust. (2001). "List Scheduling in a Parallel Machine Environment with Precedence Constraints and Setup Times." Operations Research Letters 29, 231-239.
11. Kim, S.C. and P.M. Bobrowski. (1994). "Impact of Sequence-Dependent Setup Time on Job Shop Scheduling Performance." International Journal of Production Research 32(7), 1503-1520.
12. Kolisch, R. (1995). Project Scheduling Under Resource constraints. Physica-Verlag.
13. Kolisch, R. (1996). "Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation." European Journal of Operational Research 90, 320-333.
14. Noivo, J.A. and H. Ramalhinho-Lourenço. (1998). "Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times." Economic Working Paper Series n. 338, Department of Economics and Business, Universitat Pompeu Fabra.
15. Ovacik, I.M. and R. Uzsoy. (1993). "Worst-Case Error Bounds for Parallel Machine Scheduling Problems with Bounded Sequence-Dependent Setup Times." Operations Research Letters 14, 251-256.
16. Ovacik, I.M. and R. Uzsoy. (1994). "Exploiting Shop Floor Status Information to Schedule Complex Job Shops." Journal of Manufacturing Systems 13, 73-84.
17. Schutten, J.M.J. (1996). "List Scheduling Revisited." Operations Research Letters 18, 167-170.
18. Schutten, J.M.J. (1998). "Practical Job Shop Scheduling." Annals of Operations Research 83, 161-178.
19. Sotskov, Y.N., T. Tautenhahn, and F. Werner. (1999). "On the Application of Insertion Techniques for Job Shop Problems with Setup Times." RAIRO Operations Research 33(2), 209-245.
20. Sprecher, A., R. Kolisch, and A. Drexl. (1995). "Semi-Active, Active, and Non-Delay Schedules for the Resource-Constrained Project Scheduling Problem." European Journal of Operational Research 80, 94-102.
21. Yang, W.-H. and C.-J. Liao. (1999). "Survey of Scheduling Research Involving Setup Times." International Journal of Systems Science 30(2), 143-155.