The complexity of cyclic shop scheduling problems
- 17 July 2002
- journal article
- research article
- Published by Wiley in Journal of Scheduling
- Vol. 5 (4) , 307-327
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Minimizing Makespan in a Class of Reentrant ShopsOperations Research, 1997
- Performance Measures and Schedules in Periodic Job ShopsOperations Research, 1997
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOperations Research, 1996
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shopEuropean Journal of Operational Research, 1994
- Cyclic Schedules for Job Shops with Identical JobsMathematics of Operations Research, 1992
- Cyclic sequencing problems in the two-machine permutation flow shop: Complexity, worst-case, and average-case analysisNaval Research Logistics (NRL), 1990
- Sequencing in an Assembly Line with Blocking to Minimize Cycle TimeOperations Research, 1989
- Short-term production scheduling of an automated manufacturing facilityIBM Journal of Research and Development, 1985
- V-shop schedulingEuropean Journal of Operational Research, 1984
- Scheduling of re‐entrant flow shopsJournal of Operations Management, 1983