Job Shop Scheduling with Deadlines

Journal of Combinatorial Optimization

Volumn 1, Issue 4, 1998, Pages 329-353

  Balas, Egon ^a   Lancia, Giuseppe ^a   Serafini, Paolo ^b   Vazacopoulos, Alkiviadis ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF UDINE   (Italy)

^c FAIRLEIGH DICKINSON UNIVERSITY   (United States)

Author keywords

Deadlines; Scheduling; Shifting bottleneck

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

JOB SHOP SCHEDULING PROBLEMS; SHIFTING BOTTLENECK STRATEGY;

SCHEDULING;

EID: 0031704308     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009750409895     Document Type: Article

References (8)

1. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Management Science, vol. 34, pp. 391-401, 1988.
2. E. Balas and A. Vazacopoulos, "Guided local search and shifting bottleneck procedure for job shop scheduling," Management Science Research Report #MSSR-609, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1994. To appear in Management Science.
3. E. Balas, J.K. Lenstra, and A. Vazacopoulos, "The one machine problem with delayed precedence constraints and its use in job shop scheduling," Management Science, vol. 41, pp. 94-109, 1995.
4. J. Carlier, "The one-machine sequencing problem," European Journal of Operational Research, vol. 11, pp. 42-47, 1982.
5. E. Demirkol, S. Mehta, and R. Uzsoy, "Benchmarking for shop scheduling problems," Research Memorandum No. 96-4, Purdue University, 1996.
6. H. Fisher and G.L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," in Industrial Scheduling, J.F. Muth and G.L. Thompson (Eds.), Prentice-Hall: Englewood Cliffs, NJ, 1963.
7. V.J. Leon, Personal communication, 1992.
8. V.J. Leon and S.D. Wu, "On scheduling with ready-times, due-dates and vacations," Naval Research Logistics, vol. 39, pp. 53-65, 1992.