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 条
[11]   Machine scheduling with an availability constraint [J].
Lee, CY .
JOURNAL OF GLOBAL OPTIMIZATION, 1996, 9 (3-4) :395-416
[12]  
LEE CY, 2004, HDB SCHEDULING
[13]   An FPTAS for scheduling a two-machine flowshop with one unavailability interval [J].
Ng, CT ;
Kovalyov, MY .
NAVAL RESEARCH LOGISTICS, 2004, 51 (03) :307-315
[14]   ANALYSIS OF A LINEAR-PROGRAMMING HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINES [J].
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) :155-164
[15]   Makespan minimization in open shops: A polynomial time approximation scheme [J].
Sevastianov, SV ;
Woeginger, GJ .
MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) :191-198
[16]  
VAIDYA PM, 1989, P 30 ANN S FDN COMP, P332