No-wait flexible flowshop scheduling with no-idle machines

被引：22

作者：

Wang, ZB ^{[1
]}

Xing, WX ^{[1
]}

Bai, FS ^{[1
]}

机构：

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

来源：

OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 06期

基金：

中国国家自然科学基金;

关键词：

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

D O I：

10.1016/j.orl.2004.10.004

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. (c) 2004 Elsevier B.V. All rights reserved.

引用

页码：609 / 614

页数：6

共 6 条

[1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2] NP-hardness of compact scheduling in simplified open and flow shops
Giaro, K
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (01) : 90 - 98
[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] Karp R. M., 1972, COMPLEXITY COMPUTER, P85, DOI DOI 10.1007/978-1-4684-2001-2_9
[6] Mokotoff E, 2001, ASIA PAC J OPER RES, V18, P193

← 1 →