An improved algorithm for the two machine flow shop problem with several availability constraints

被引：3
|
作者：
Hadda, Hatem [1 ]
机构：
[1] Ctr Urbain Nord, INSAT Tunis, Unite Rech URAII, Tunis 1080, Tunisia
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2010年 / 8卷 / 03期
关键词：
Flow shop scheduling; Availability constraint; Heuristics; Worst case analysis; Polynomially solvable case; 2-MACHINE FLOWSHOP;
D O I：
10.1007/s10288-010-0119-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.
引用
收藏
页码：271 / 280
页数：10
相关论文
共 50 条
12345