A branch & bound method for the general-shop problem with sequence dependent setup-times

OR Spectrum

Volumn 18, Issue 3, 1996, Pages 145-161

  Brucker, Peter ^a   Thiele, Olaf ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Block approach; Branch bound method; Disjunctive graph model; General shop problem; Immediate selection; Job shop; Open shop; Sequence dependent setup times

Indexed keywords

EID: 0001343733     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01539706     Document Type: Article

References (15)

1. Adams J, Balas E, Zawack D (1988) The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manag Sci 34:391-401
2. Applegate D, Cook W (1991) A Computational Study of Job-Shop Scheduling. ORSA J Comput 3:149-156
3. Bräsel H, Tautenhahn T, Werner F (1991) Constructive Heuristic Algorithms for the Open-Shop Problem, TU Magdeburg. Preprint, Math 21/91
4. Brucker P, Jurisch B, Krämer A (1994) The Job-Shop Problem and Immediate Selection. Ann Oper Res 50:73-114
5. Brucker P, Jurisch B, Sievers B (1994a) A Fast Branch & Bound Algorithm for the Job-Shop Scheduling Problem. Discr Appl Math 49:107-127
6. Carlier J, Pinson E (1989) An Algorithm for Solving the Job-Shop Problem. Manag Sci 35:164-176
7. Carlier J, Pinson E (1990) A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem. Ann Oper Res 26: 269-287
8. Kleinau U (1992) Zur Struktur und Lösung verallgemeinerter Shop Probleme, Dissertation A. TU Magdeburg
9. Monma CL, Potts CN (1989) On the Complexity of Scheduling with Batch Setup Times. Oper Res 37:(5) 798-804
10. Muth JF, Thompson GL (1963) Industrial Scheduling. Prentice Hall, Englewood Cliffs, N.J. 1963
11. Sedgewick R (1988) Algorithms, 2nd edn. Addison-Wesley, Reading Mass.
12. Sotskov YN, Tautenhahn T, Werner F (1994) Heuristics for Permutation Flow-Shop Scheduling with Batch Setup Times. TU Magdeburg
13. Taillard E (1989) Benchmarks for Basic Scheduling Problems. ORWP 89/21, Lausanne
14. Thiele O (1994) Ein Branch & Bound-Verfahren für das General-Shop Problem mit gruppenabhängigen Rüstzeiten. Diplomarbeit, Universität Osnabrück
15. Wöstmann B (1993) Ein Branch & Bound-Verfahren für das Open-Shop Problem. Diplomarbeit, Universität Osnabrück