Note: On the Two-Machine No-Idle Flowshop Problem

Naval Research Logistics

Volumn 47, Issue 4, 2000, Pages 353-358

  Čepek, Ondřej ^a   Okada, Masanori ^b   Vlach, Milan ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Flowshop scheduling; No idle processing

Indexed keywords

EID: 0347946418     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200006)47:4<353::AID-NAV5>3.0.CO;2-U     Document Type: Article

References (5)

1. I. Adiri and D. Pohoryles, Flowshop/No-idle or no-wait scheduling to minimize the sum of completion times, Nav Res Logistics Quart 29 (1982), 495-504.
2. O. Čepek, M. Okada, and M. Vlach, Minimizing total completion time in a two-machine no-idle flowshop, Research Report IS-RR-98-0015F, Japan Advanced Institute of Science and Technology, Ishikawa, May 1998.
3. R. W. Conway, W.L. Maxwell, and L.W. Miller, Theory of scheduling, Addison-Wesley, Reading, MA, 1967.
4. M.R. Garey, D.S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling, Math Oper Research 1 (1976), 117-129.
5. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, a survey, Ann Discrete Math 5 (1979), 287-326.