Approximation algorithms for single machine scheduling with one unavailability period

被引:16
|
作者
Kacem, Imed [1 ]
Haouari, Mohamed [2 ]
机构
[1] Univ Technol Troyes, Charles Delaunay Inst, New York, NY 10010 USA
[2] Ozyegin Univ, Fac Econ & Adm Sci, Istanbul, Turkey
来源
关键词
Scheduling; Single machine; Approximation; Unavailability constraint; AVAILABILITY; SCHEME;
D O I
10.1007/s10288-008-0076-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage's algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.
引用
收藏
页码:79 / 92
页数:14
相关论文
共 50 条