Constructive and Tabu Search Algorithms for Hybrid Flow Shop Problems with Unrelated Parallel Machines and Setup Times

This paper investigates scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. Sequence-and machine-dependent setup times are considered. The problem is a combinatorial optimization… (More)