Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
Authors:
- Xi SunXSXi Sun
- Kazuko MorizawaKMKazuko Morizawa
- Hiroyuki NagasawaHNHiroyuki Nagasawa
- 1 May 2003
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 146 (3) , 498-516
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A branch and bound algorithm for the two-stage assembly scheduling problemEuropean Journal of Operational Research, 1997
- An evaluation of sequencing heuristics in flow shops with multiple processorsComputers & Industrial Engineering, 1996
- FLOWMULT: Permutation Sequences for Flow Shops with Multiple ProcessorsJournal of Information and Optimization Sciences, 1995
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One StageJournal of the Operational Research Society, 1995
- Global lower bounds for flow shops with multiple processorsEuropean Journal of Operational Research, 1995
- 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
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954