Heuristic algorithms for continuous flow-shop problem
- 1 October 1990
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 37 (5) , 695-705
- https://doi.org/10.1002/1520-6750(199010)37:5<695::aid-nav3220370508>3.0.co;2-l
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion timesNaval Research Logistics Quarterly, 1982
- A note on the flow‐shop problem without interruptions in job processingNaval Research Logistics Quarterly, 1981
- Solutions to the Constrained Flowshop Sequencing ProblemJournal of the Operational Research Society, 1976
- 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
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964