A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time

被引：43

作者：

Baraz, Daniel ^{[1
]}

Mosheiov, Gur ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, Dept Stat, Sch Business Adm, IL-91905 Jerusalem, Israel

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2008年 / 184卷 / 02期

关键词：

scheduling; flowshop; makespan; heuristics;

D O I：

10.1016/j.ejor.2006.11.025

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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(n(2))) greedy algorithm, which is shown numerically to perform better than a recently published heuristic. (C) 2006 Elsevier B.V. All rights reserved.

引用

页码：810 / 813

页数：4