Group technology approach to the open shop scheduling problem with batch setup times

Operations Research Letters

Volumn 26, Issue 4, 2000, Pages 181-192

  Strusevich, V A ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; COMPUTATIONAL COMPLEXITY; GROUP TECHNOLOGY; HEURISTIC METHODS; PROCESS CONTROL; SCHEDULING;

LINEAR-TIME HEURISTIC ALGORITHMS; OPEN SHOP SCHEDULING; WORST-CASE ANALYSIS;

PRODUCTION CONTROL;

EID: 0033743394     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00021-3     Document Type: Article

References (7)

1. Chen B., Potts C.N., Strusevich V.A. Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Programming B. 82:1998;255-271.
2. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23:1976;665-679.
3. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Res. Log. Quart. 1:1954;61-68.
4. Kleinau U. Two-machine shop scheduling problems with batch processing. Math. Comput. Modelling. 17:1993;55-66.
5. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
6. Strusevich V.A. Two machine open shop scheduling problem with setup, processing and removal times separated. Comput. Oper. Res. 20:1993;597-611.
7. Yoshida T., Hitomi K. Optimal two-stage production scheduling with setup times separated. AIIE Trans. 11:1979;261-263.