Approximation results for flow shop scheduling problems with machine availability constraints

被引:34
作者
Kubzin, Mikhail A. [2 ]
Potts, Chris N. [3 ]
Strusevich, Vitaly A. [1 ]
机构
[1] Univ Greenwich, Sch Comp & Math Sci, London SE10 9LS, England
[2] Bear Stearns, London E14 5AD, England
[3] Univ Southampton, Fac Math Studies, Southampton SO17 1BJ, Hants, England
关键词
Flow shop scheduling; Machine non-availability; Approximation algorithm; 2-MACHINE FLOWSHOP; MAKESPAN; SCHEME;
D O I
10.1016/j.cor.2007.10.013
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenario in which some portion of the processing is repeated but the job is otherwise resumable. For the problem with several non-availability intervals on the first machine under the resumable scenario, we present a fast (3/2)-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:379 / 390
页数:12
相关论文
共 16 条
[1]   A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint [J].
Breit, J .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) :2143-2153
[2]   An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint [J].
Breit, J .
INFORMATION PROCESSING LETTERS, 2004, 90 (06) :273-278
[3]   Non-preemptive two-machine open shop scheduling with non-availability constraints [J].
Breit, J ;
Schmidt, G ;
Strusevich, VA .
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2003, 57 (02) :217-234
[4]   Two-machine flowshop scheduling with consecutive availability constraints [J].
Cheng, TCE ;
Wang, GQ .
INFORMATION PROCESSING LETTERS, 1999, 71 (02) :49-54
[5]   An improved heuristic for two-machine flowshop scheduling with an availability constraint [J].
Cheng, TEC ;
Wang, GQ .
OPERATIONS RESEARCH LETTERS, 2000, 26 (05) :223-229
[6]  
Johnson S. M., 1954, Naval Research Logistics Quarterly, V1, P61, DOI [DOI 10.1002/NAV.3800010110, 10.1002/nav.3800010110]
[7]   Two-machine flow shops with limited machine availability [J].
Kubiak, W ;
Blazewicz, J ;
Formanowicz, P ;
Breit, J ;
Schmidt, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (03) :528-540
[8]  
Lawler E., 1993, HDB OPERATIONS RES M, V4, P455
[9]   Two-machine flowshop scheduling with availability constraints [J].
Lee, CY .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (02) :420-429