Optimal scheduling of the 3-machine assembly-type flow shop

RAIRO Recherche Operationnelle

Volumn 33, Issue 4, 1999, Pages 439-445

  Haouari, Mohamed ^a   Daouas, Thouraya ^b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Assembly type production; Branch and bound; Flow shop; Scheduling

Indexed keywords

EID: 0346932895     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro:1999120     Document Type: Article

References (8)

1. J. CARLIEK and I. REBAÏ, Two Branch and Bound algorithms for the Permutation Flow Shop Problem, European J. Oper. Res., 1996, 90, no 2, p. 238-251.
2. M. HAOUARI and R. M'HALLAH, A Heuristic for the Two-Stage Hybrid How Shop Problem, Oper. Res. Lett., 1997, 21, no 1, p. 43-53.
3. S. M. JOHNSON, Optimal Two and Three-Stage Production Schedule with Setup Times Included, Naval Res. Logist. Quart., 1954, 1, p. 61-68.
4. GOTHA, Les problèmes d'ordonnancement. RAIRO-Oper. Res., 1993, 27, p. 77-150.
5. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN and D. B. SHMOYS, Sequencing and Scheduling: Algorithms and Complexity, in: Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, p. 445-522.
6. C. Y. LEE, T. C. E. CHENG and B. M. T. LIN, Minimizing the makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Sci., 1993, 39, p. 616-625.
7. C. OGUZ, and T. C. E. CHENG, Two-stage Flowshop Scheduling with a Common Second-Stage Machine, INFORMS Meeting, Los Angeles, May 1995.
8. C. N. POTTS, S. V. SEVASTJANOV, V. A. STRUSEVICH, L. N. VAN WASSENHOVE and C. M. ZWANEVALD, The Two-Stage Assembly Scheduling Problem: Complexity and Approximation. Oper. Res., 1995, 43, p. 346-355.