A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- 1 September 1998
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 109 (2), 321-329
- https://doi.org/10.1016/s0377-2217(98)00060-5
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Scheduling methodology: optimization and compu-search approaches IPublished by Springer Science and Business Media LLC ,1997
- A New Heuristic for Three-Machine Flow Shop SchedulingOperations Research, 1996
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion timeInternational Journal of Production Research, 1996
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954