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 条

[21] Online scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
[22] Scheduling a maintenance activity to minimize total weighted completion-time
Mosheiov, Gur
Sarig, Assaf
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (04) : 619 - 623
[23] ONLINE SCHEDULING OF TWO UNIFORM MACHINES TO MINIMIZE TOTAL COMPLETION TIMES
Liu, P.
Lu, X.
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (01) : 95 - 102
[24] On-line scheduling of parallel machines to minimize total completion times
Liu, Peihai
Lu, Xiwen
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2647 - 2652
[25] SCHEDULING TO MINIMIZE THE TOTAL RESOURCE CONSUMPTION WITH A CONSTRAINT ON THE SUM OF COMPLETION TIMES
LI, CL
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (02) : 381 - 388
[26] Scheduling to minimize the total resource consumption with a constraint on the sum of completion times
Washington Univ, St Louis, United States
Eur J Oper Res, 2 (381-388):
[27] Scheduling two-machine preemptive open shops to minimize total completion time
Liaw, CF
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (08) : 1349 - 1363
[28] Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Cheng, T. C. E.
Chung, Yu-Hsiang
Liao, Shan-Ci
Lee, Wen-Chiung
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 353 - 361
[29] Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Chekuri, C
Motwani, R
DISCRETE APPLIED MATHEMATICS, 1999, 98 (1-2) : 29 - 38
[30] Minimizing Total Completion Time for Preemptive Scheduling with Release Dates and Deadline Constraints
He, Cheng
Lin, Hao
Lin, Yixun
Dou, Junmei
FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2014, 39 (01) : 17 - 26

← 1 2 3 4 5 →