Two algorithms for no-wait flexible flowshop scheduling problem with no-idle machines

被引：0

作者：

Jin, Qingwei ^{[1
]}

Xing, Wenxun ^{[1
]}

机构：

[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China

来源：

Proceedings of the Sixth International Conference on Information and Management Sciences | 2007年 / 6卷

关键词：

makespan; flexible flowshop; no-wait; no-idle; heuristics;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We consider a two-stage flexible flowshop scheduling problem with no-wait jobs and no-idle time between two consecutive processes on each machine in the second stage. The numbers of machines in both stages are m(1) and m(2) with m(2) >= m(1). The processing times of jobs are all 1 in the first stage and not less than 1 in the second stage. A known algorithm is extended for this problem and a new algorithm with better performance is given. The bounds of the two algorithms are also presented.

引用

页码：636 / 640

页数：5

共 6 条

[1] NP-hardness of compact scheduling in simplified open and flow shops
Giaro, K
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (01) : 90 - 98
[2] Graham R. L., 1979, Discrete Optimisation, P287
[3] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES
GRAHAM, RL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &
[4] 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
[5] Mokotoff E, 2001, ASIA PAC J OPER RES, V18, P193
[6] No-wait flexible flowshop scheduling with no-idle machines
Wang, ZB
Xing, WX
Bai, FS
[J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 609 - 614

← 1 →