A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

DOI10.1016/S0377-2217(98)00060-5zbMath0937.90035MaRDI QIDQ1296660

Salah E. Elmaghraby, Abdelhakim Artiba, Fouad Riane

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics; scheduling; hybrid flowshop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., Hybrid flow-shop scheduling problems with multiprocessor task systems., A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, Scheduling flexible flow lines with sequence-dependent setup times, Flow-shop scheduling for three serial stations with the last two duplicate, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, A Two-Stage Flexible Flowshop Problem with Deterioration, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem