Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation

DOI10.1177/003754979807100501zbMath1065.68654OpenAlexW1980632243MaRDI QIDQ4420128

Gloria E. Wheeler, Shaukat A. Brah

Publication date: 16 October 2003

Published in: SIMULATION (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1177/003754979807100501

zbMATH Keywords

heuristic programmingflexible flow line

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ The hybrid flow shop scheduling problem ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Mathematical Modeling of Scheduling Problems
• Two-Stage, Hybrid Flowshop Scheduling Problem