A note on the flow‐shop problem without interruptions in job processing
- 1 December 1981
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (4) , 665-669
- https://doi.org/10.1002/nav.3800280413
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Counterexamples to optimal permutation schedules for certain flow shop problemsNaval Research Logistics Quarterly, 1981
- Optimal flowshop schedules with no intermediate storage spaceNaval Research Logistics Quarterly, 1976
- Minimizing Mean Flowtime in the Flow Shop with No Intermediate QueuesA I I E Transactions, 1974
- 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
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954