Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times

被引：7
|
作者：
Guoqing Wang
Hongyi Sun
Chengbin Chu
机构：
[1] Jinan University,Department of Business Administration
[2] University of Hong Kong,Department of Manufacturing Engineering and Engineering Management
[3] Université de Technologie de Troyes,LOSI
来源：
Annals of Operations Research | 2005年 / 133卷
关键词：
Completion Time; Total Weight; Strong Sense; Error Bound; Single Machine;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we study the problem of scheduling n jobs on a single machine with availability constraints. The objective is to minimize total weighted job completion times. We show that the problem is NP-hard in the strong sense. Then we consider two intractable special cases, namely, proportional weight case, and single availability constraint case. We propose two heuristics for these cases and analyze their worst-case error bounds.
引用
收藏
页码：183 / 192
页数：9
相关论文
共 50 条
12345