Properties of two-machine no-wait flow-shop scheduling with a non-resumable unavailable interval

被引：3

作者：

Li D. ^{[1
]}

Chen K. ^{[1
]}

Wang X. ^{[1
]}

机构：

[1] Department of Management Science and Engineering, Fuzhou University, Fuzhou

来源：

Chen, Kejia (kjchen@fzu.edu.cn) | 1600年 / Taylor and Francis Ltd.卷 / 34期

基金：

中国国家自然科学基金;

关键词：

complexity; no-wait; Two-machine flow-shop scheduling; unavailable interval; worst-case performance ratio;

D O I：

10.1080/21681015.2016.1271835

中图分类号：

学科分类号：

摘要：

The properties of two-machine no-wait flow-shop scheduling problem, with a non-resumable unavailable interval are studied. This research discusses two cases: a non-resumable unavailable interval in the first and second machines respectively. The problems’ complexities are proved to be NP-hard. The Gilmore and Gomory Algorithm (GGA) is applied to minimize the makespan, and the conditions that GGA yields the optimal solutions are presented. Sixty numerical examples with ten-job and two-machine are generated to test the proposed theorems. Compared to the results obtained by the Johnson algorithm, the GGA algorithm yields an 8.15% improvement on average. Moreover, the worst-case performance ratios of GGA are proved to be 2. © 2017 Chinese Institute of Industrial Engineers.

引用

页码：232 / 238

页数：6

共 50 条

[1] Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints
Chen, Kejia
Li, Debiao
Wang, Xiao
JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2020, 29 (04) : 400 - 411
[2] Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints
Kejia Chen
Debiao Li
Xiao Wang
Journal of Systems Science and Systems Engineering, 2020, 29 : 400 - 411
[3] Two-machine flow shop no-wait scheduling with a nonavailability interval
Kubzin, MA
Strusevich, VA
NAVAL RESEARCH LOGISTICS, 2004, 51 (04) : 613 - 631
[4] Two-machine flow shop no-wait scheduling with machine maintenance
Kubzin M.A.
Strusevich V.A.
4OR, 2005, 3 (4) : 303 - 313
[5] Two-machine no-wait flow shop scheduling with missing operations
Glass, CA
Gupta, JND
Potts, CN
MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (04) : 911 - 924
[6] Two-machine flow shop scheduling problems with no-wait jobs
Bouquard, JL
Billaut, JC
Kubzin, MA
Strusevich, VA
OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 255 - 262
[7] Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
Espinouse, ML
Formanowicz, P
Penz, B
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) : 497 - 500
[8] No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
Ben Chihaoui, Faten
Kacem, Imed
Hadj-Alouane, Atidel B.
Dridi, Najoua
Rezg, Nidhal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (21) : 6273 - 6286
[9] Two-machine flow-shop scheduling with rejection
Shabtay, Dvir
Gasper, Nufar
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (05) : 1087 - 1096
[10] The proportionate two-machine no-wait job shop scheduling problem
Koulamas, Christos
Panwalkar, S. S.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) : 131 - 135

← 1 2 3 4 5 →