Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion
Authors:
- 1 February 2007
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 105 (2) , 407-424
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Heuristics for hybrid flow shops with controllable processing times and assignable due datesComputers & Operations Research, 2002
- Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum latenessInternational Journal of Production Economics, 2000
- Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanismEuropean Journal of Operational Research, 1999
- Heuristics for scheduling in a flow shop with multiple processorsEuropean Journal of Operational Research, 1999
- Heuristic algorithms for the two-stage hybrid flowshop problemOperations Research Letters, 1997
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hardEuropean Journal of Operational Research, 1996
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One StageJournal of the Operational Research Society, 1995
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Optimization by Simulated AnnealingScience, 1983
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954