A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
We study makespan minimization on an m machine flowshop. No idle time is allowed between consecutive operations on each machine. We introduce an efficient (O(n2)) greedy algorithm, which is shown numerically to perform better than a recently published heuristic.
heuristics makespan flowshop scheduling