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.
Bibliographical noteFunding Information:
This paper was supported in part by the Rekanati Fund of The School of Business Administration, The Hebrew University, Jerusalem.