More on three-machine no-idle flow shops

被引：27

作者：

Kamburowski, J ^{[1
]}

机构：

[1] Univ Toledo, Coll Business Adm, Dept Informat Operat & Technol Management, Toledo, OH 43606 USA

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2004年 / 46卷 / 03期

关键词：

scheduling; flow shop; no-idle machines; makespan;

D O I：

10.1016/j.cie.2004.01.008

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Recently in this journal Saadani, Guinet, and Moalla [Comput Ind Engng 44 (2003) 425] considered the NP-hard problem of minimizing the makespan in a three-machine no-idle flow shop. We identify a simple network representation of the makespan that provides a better insight into the problem, reveals a certain anomaly resulting from the no-idle condition, and leads to some dominance relations among the machines under which the problem becomes efficiently solvable. Extensions to m-machine no-idle flow shops are also included. (C) 2004 Elsevier Ltd. All rights reserved.

引用

页码：461 / 466

页数：6

共 9 条

[1] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES
ADIRI, I
POHORYLES, D
[J]. NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 495 - 504
[2] Baptiste P., 1997, P INT C IND ENG PROD, V97, P429
[3] THE ANALYSIS OF ACTIVITY NETWORKS UNDER GENERALIZED PRECEDENCE RELATIONS (GPRS)
ELMAGHRABY, SE
KAMBUROWSKI, J
[J]. MANAGEMENT SCIENCE, 1992, 38 (09) : 1245 - 1263
[4] Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[5] A survey of machine scheduling problems with blocking and no-wait in process
Hall, NG
Sriskandarajah, C
[J]. OPERATIONS RESEARCH, 1996, 44 (03) : 510 - 525
[6] Johnson Selmer Martin., 1954, NAV RES LOG, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110, 10.1002/(ISSN)1931-9193]
[7] Pinedo M., 2002, SCHEDULING THEORY AL
[8] SAADANI H, 2001, P INT C IND ENG PROD, V2, P880
[9] Three stage no-idle flow-shops
Saadani, NE
Guinet, A
Moalla, M
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 44 (03) : 425 - 434

← 1 →