A new lower bound for the open-shop problem

Annals of Operations Research

Volumn 92, Issue , 1999, Pages 165-183

  Guéret, Christelle ^a   Prins, Christian ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

Lower bound; Open shop; Scheduling theory

Indexed keywords

EID: 0033483011     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018930613891     Document Type: Article

References (8)

1. P. Brucker, J. Hurink, B. Jurisch and B. Wöstmann, A branch-and-bound algorithm for the open-shop problem, Discrete Applied Mathematics 76(1997)43-59.
2. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood, 1990.
3. T. Gonzales and S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23(1976)665-679.
4. C. Guéret and C. Prins, Classical and new heuristics for the open-shop problem, European Journal of Operational Research 107(1998)306-314.
5. S. Martello and P. Toth, Knapsack Problems, Wiley, 1990.
6. I.G. Drobouchevitch and V.A. Strusevich, A polynomial algorithm for the three-machine open shop with a bottleneck machine, Annals of Operations Research 92(1999), this volume.
7. E. Taillard, Benchmarks for basic scheduling problems, Research Report ORWP 89/21, University of Lausanne, Switzerland, 1989.
8. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevastianov and D.B. Shmoys, Short shop schedules, Operations Research 45(1997)288-294.