Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck * * This project was supported by the National Natural Science Foundation of China (60274013; 60474002) and Shanghai Development Found for Science and Technology (04DZ11008).

Journal of Systems Engineering and Electronics

Volumn 18, Issue 3, 2007, Pages 556-565

  Yan, Zuo ^a   Hanyu, Gu ^a   Yugeng, Xi ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

bottleneck; job shop scheduling problem; shifting bottleneck procedure

Indexed keywords

COMPUTATIONAL TIME; SHIFTING BOTTLENECK (SB);

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING;

SCHEDULING;

EID: 34848819135     PISSN: 10044132     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1004-4132(07)60129-7     Document Type: Article

References (13)

1. Pinedo M. Scheduling: theory, algorithms, and systems (1995), Prentice Hall, Englewood Cliffs. NJ
2. Brucker P., Jurisch B., and Sievers B. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49 1 (1994) 109-127
3. Vepsalainen A., and Morton T. Priority rules for job shops with weighted tardiness costs. Management Science 33 8 (1987) 1035-1047
4. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
5. Balas E., Lenstra J., and Vazacopoulos A. The one machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science 41 1 (1995) 94-109
6. Pinedo M., and Singer M. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46 1 (1999) 1-17
7. Demirkol E., Mehta S., and Uzsoy R. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics 3 2 (1997) 111-137
8. Uzsoy R., and Wang C. Performance of decomposition procedures for job shop scheduling problems with bottleneck machines. International Journal of Production Research 38 6 (2000) 1271-1286
9. Mason S., Fowler J., and Carlyle W. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling 5 3 (2002) 247-262
10. nd edition (2000), McGraw-Hill/Irwin
11. Goldratt E., and Fox R. The race (1986), North River Press, Croton-on-Hudson, NY
12. Ovacik I., and Uzsoy R. Decomposition methods for complex factory scheduling problems (1997), Kluwer Academic Publishing
13. Carlier J. The one-machine sequencing problem. European Journal of Operational Research 11 1 (1982) 42-47