Article ID Journal Published Year Pages File Type
478956 European Journal of Operational Research 2008 4 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
Authors
, ,