An improved shifting bottleneck procedure for the job shop scheduling problem

Computers and Operations Research

Volumn 31, Issue 12, 2004, Pages 2093-2110

  Wenqi, Huang ^a   Aihua, Yin ^a,b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HUBEI UNIVERSITY   (China)

Author keywords

Bottleneck machine; Disturbance; Feasible solution; Job shop scheduling; Makespan

Indexed keywords

BENCHMARKING; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING; SHIFTING BOTTLENECKS;

OPERATIONS RESEARCH;

COMPUTER SIMULATION;

EID: 2642529311     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00243-0     Document Type: Article

References (25)

1. Lawler E.L. Lenstra J.K. Rinnooy Kan A.H.G. Recent developments in deterministic sequencing and scheduling: A survey Dempster M.A.H. Lenstra J.K. Rinnooy Kan A.H.G. Deterministic and stochastic scheduling 1982 p35-p73 Reidel Dordrecht, The Netherlands
2. Applegate D. Cook W. A computational study of job-shop scheduling ORSA Journal of Computer 3 2 1991 149-156
3. Brucker P, Jurish B, Sieviers B. A fast branch - bound algorithm for the job-shop problem. Report, Universität Osnabrück, Germany, 1991.
4. Carlier J. Pinson E. An algorithm for solving the job-shop problem Management Science 35 2 1989 164-176
5. Lageweg B.J. Lenstra J.K. Rinnooy Kan A.H.G. Job-shop scheduling by implicit enumeration Management Science 24 1977 441-450
6. Spachis A.S. King J.R. Job-shop scheduling heuristics with local neighborhood search International Journal of Production Research 17 6 1979 507-526
7. French S. Sequencing and scheduling: An introduction to the mathematics of the job-shop 1982 Harwood Chichester, UK
8. Adams J. Balas E. Zawack D. The shifting bottleneck procedure for job shop scheduling Management Science 34 1988 391-401
9. Van Laarhoven P.J.M. Aarts E.H.L. Lenstra J.K. Job shop scheduling by simulated annealing Operations Research 40 1 1992 113-125
10. Matsuo HC, Suh CJ, Sullivan RS. A controlled search simulated annealing method for general job shop scheduling problem. Working Paper, 03-04-88, Department of Management, The University of Texas at Austin, Austin, TX, 1988.
11. Dell'Amico M. Turbian M. Applying tabu-search to job-shop scheduling problem Annals of Operations Research 41 1-4 1993 231-252
12. Dongarra JJ. Performance of various computers using standard linear equations software. Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, 1993.
13. Taillard E. Parallel taboo search technique for the job shop scheduling problem. Working Paper ORWP 89/11 (received version October 1992), Department de Mathematiques, Ecole Polytechnique Federale De Lausanne, Lausanne, Switzerland, 1989.
14. Taillard E. Benchmarks for basic scheduling problems European Journal of Operations Research 64 1993 278-285
15. Balas E. Vazacopoulos A. Guided local search with shifting bottleneck for job shop scheduling Management Science 44 2 1988 262-275
16. Nowicki E. Smutnicki C. A fast taboo search algorithm for the job shop scheduling problem Management Science 42 6 1996 797-813
17. Pezzella F. Merelli E. A tabu search method guided by shifting bottleneck for job shop scheduling problem European Journal of Operations Research 120 2000 297-310
18. Storer R.H. David Wu S. Vaccari R. New search space for sequencing problèms with application to job shop scheduling Management Science 39 10 1992 1495-1509
19. Roy B, Sussman B. Les problémes d'ordonnancement avec contraintes disjonctives. Note DS NO.9 bis, SEMA, Pairs; 1964.
20. Carlier J. The one-machine sequencing problem European Journal of Operational Research 11 1982 42-47
21. Dorndorf U. Pesh E. Evolution based learning in a job shop scheduling environment Computers - Operations Research 22 1995 25-40
22. Vaessens RJM, Aarts EHL, Lenstra JK. Job shop scheduling by local search. Memorandum COSOR 94-5, Eindhoven University of Techonlogy, Department of Mathematics and Computing Science, Eindhoven, The Netherlands, 1994.
23. Eck B, Pinedo M. Good solution to job scheduling problems via tabu search. Presented at Joint ORSA/TIMS Meeting, Vancouver, Canada, May, 10, 1989.
24. Fisher H, Thompson DL. Probabilistic learning combinations of local job shop scheduling rules. In: Muth JF, Thompson GL, editors. Industrial scheduling. Englewood Cliffs, NJ: Prentice-Hall; 1963.
25. Lawrence S. Supplement to i°Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques, i±GSIA, Carnegie Mellon University, Pittsburgh, PA, 1984.