Job shop scheduling with setup times, deadlines and precedence constraints

Journal of Scheduling

Volumn 11, Issue 4, 2008, Pages 253-262

  Balas, Egon ^a   Simonetti, Neil ^b   Vazacopoulos, Alkis ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Bryn Athyn College of the New Church   (United States)

^c Dash Optimization   (United States)

Author keywords

Dynamic programming; Sequence dependent setup times; Traveling salesman problem with time windows shifting bottleneck

Indexed keywords

COMPUTING TIME; DYNAMIC PROGRAMMING; DYNAMIC PROGRAMMING ALGORITHMS; JOB SHOP-SCHEDULING; JOB-SHOP SCHEDULING PROBLEMS; PRECEDENCE CONSTRAINTS; RELEASE TIMES; SEMICONDUCTOR INDUSTRIES; SEQUENCE-DEPENDENT SETUP TIMES; SET-UP TIMES; SHIFTING BOTTLENECK PROCEDURE; SINGLE MACHINE SCHEDULING PROBLEMS; STATE OF THE ARTS; TIME WINDOWS; TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS SHIFTING BOTTLENECK; TRAVELING SALESMAN PROBLEMS;

HEURISTIC PROGRAMMING; MATHEMATICAL PROGRAMMING; SEMICONDUCTOR DEVICE MANUFACTURE; SYSTEMS ENGINEERING; TRAVELING SALESMAN PROBLEM;

SCHEDULING;

EID: 49549100881     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0067-7     Document Type: Article

References (14)

1. Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391-401.
2. Artigues, C., & Feillet, D. (2006, forthcoming). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research.
3. Balas, E. (1999). New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research, 84, 529-558.
4. Balas, E., & Simonetti, N. (2001). Linear time dynamic programming algorithms for new classes of restricted TSPs. INFORMS Journal on Computing, 13, 56-75.
5. Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262-275.
6. Balas, E., Lenstra, J. K., & Vazacopoulos, A. (1995). The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41, 94-109.
7. Balas, E., Lancia, G., Serafini, P., & Vazacopoulos, A. (1998). Job shop scheduling with deadlines. Journal of Combinatorial Optimization, 1, 329-353.
8. Brucker, P., & Thiele, O. (1996). A branch and bound method for the general-shop scheduling problem with sequence dependent setup times. Operations Research Spektrum, 18, 145-161.
9. Buscaylet, F., & Artigues, C. (2003). A fast tabu search method for the job-shop problem with sequence-dependent setup times. In MIC 2003, the fifth metaheuristics international conference, Kyoto, Japan.
10. Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42-47.
11. Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Fifth international conference on artificial intelligence planning and scheduling (pp. 92-101), Breckenbridge, CO.
12. Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. SIAM Journal of Applied Mathematics, 10, 196-210.
13. Ovacik, I., & Uzsoy, R. (1994). Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems, 13(2), 73-84.
14. Ovacik, I., & Uzsoy, R. (1997). Decomposition methods for complex factory scheduling problems. Dordrecht: Kluwer Academic.