Counterexamples to optimal permutation schedules for certain flow shop problems
- 1 June 1981
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (2) , 339-340
- https://doi.org/10.1002/nav.3800280215
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Operations Research HandbookPublished by Springer Nature ,1977
- Optimal flowshop schedules with no intermediate storage spaceNaval Research Logistics Quarterly, 1976
- A special case of the 3 × n flow shop problemNaval Research Logistics Quarterly, 1975
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Solution of the Flowshop-Scheduling Problem with No Intermediate QueuesOperations Research, 1972
- Sequencing TheoryPublished by Springer Nature ,1972
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954