Single machine scheduling with semi-resumable machine availability constraints

被引：1
|
作者：
Chen Yong [1 ]
Zhang An [1 ]
Tan Zhi-yi [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R China
来源：
APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B | 2011年 / 26卷 / 02期
基金：
中国国家自然科学基金; 中国博士后科学基金;
关键词：
Scheduling; Machine maintenance; Approximation algorithm; Worst-case analysis; APPROXIMATION ALGORITHMS; TIME; SUM;
D O I：
10.1007/s11766-011-2488-x
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper considers the semi-resumable model of single machine scheduling with a non-availability period. The machine is not available for processing during a given time interval. A job cannot be completed before the non-availability period will have to partially restart after the machine has become available again. For the problem with objective of minimizing makespan, the tight worst-case ratio of algorithm LPT is given, and an FPTAS is also proposed. For the problem with objective of minimizing total weighted completion time, an approximation algorithm with worst-case ratio smaller than 2 is presented. Two special cases of the latter problem are also considered, and improved algorithms are given.
引用
收藏
页码：177 / 186
页数：10
相关论文
共 50 条
12345