A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time |
| |
| Authors: | Daniel Baraz Gur Mosheiov |
| |
| Affiliation: | The School of Business Administration, Department of Statistics, The Hebrew University of Jerusalem, Mount Scopus, 91905 Jerusalem, Israel |
| |
| 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: | Scheduling Flowshop Makespan Heuristics |
| 本文献已被 ScienceDirect 等数据库收录！ |
