On the complexity of preemptive open-shop scheduling problems
- 30 June 1985
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 4 (2), 71-74
- https://doi.org/10.1016/0167-6377(85)90035-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An Algorithm for the Open-Shop ProblemMathematics of Operations Research, 1983
- Unit Execution Time Shop ProblemsMathematics of Operations Research, 1982
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job ShopsOperations Research, 1981
- Minimizing Maximum Lateness in a Two-Machine Open ShopMathematics of Operations Research, 1981
- A Note on Open Shop Preemptive SchedulesIEEE Transactions on Computers, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976