A Note on Heuristics of Flow-Shop Scheduling
Operations Research · 1996 · Volume 44 · Issue 4
Abstract
We present an O ( mn ) two-group (TG) heuristic for the m -machine, n -job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of ( m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
Keywords
heuristic, worst-case analysis, scheduling, flow-shop sequencing
Enable JavaScript for citation tools and additional paper interactions.