Permutation Schedules for Flow Shops with Precedence Constraints
Kevin Ewacha, Ivan Rival, George Steiner
Operations Research · 1990 · Volume 38 · Issue 6
Abstract
We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m -machine flow shop with precedence constraints provided that processing times are identical for noncomparable jobs.
Keywords
production/scheduling: flow shops with precedence constraints
Enable JavaScript for citation tools and additional paper interactions.