Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- 1 February 1996
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 89 (1), 172-175
- https://doi.org/10.1016/s0377-2217(96)90070-3
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Scheduling algorithms for flexible flowshops: Worst and average case performanceEuropean Journal of Operational Research, 1989
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954