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 条
  • [1] Preemptive scheduling with availability constraints to minimize total weighted completion times
    Wang, GQ
    Sun, HY
    Chu, CB
    ANNALS OF OPERATIONS RESEARCH, 2005, 133 (1-4) : 183 - 192
  • [2] Total weighted completion scheduling problem with availability constraints
    Sadfi, Cherif
    Kacem, Imed
    Liu, Wei
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 134 - +
  • [3] Scheduling to minimize the weighted sum of completion times
    Zhao, Chuan-Li
    Zhang, Qing-Ling
    Tang, Heng-Yong
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2003, 24 (06): : 515 - 518
  • [4] A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
    Wan, Long
    Yuan, Jinjiang
    Geng, Zhichao
    JOURNAL OF SCHEDULING, 2015, 18 (03) : 315 - 323
  • [5] A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
    Long Wan
    Jinjiang Yuan
    Zhichao Geng
    Journal of Scheduling, 2015, 18 : 315 - 323
  • [6] Lower bounds for total weighted completion scheduling problem with availability constraints
    Sadfi, Cherif
    Kacem, Imed
    Liu, Wei
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 159 - 163
  • [7] Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
    Kacem, Imed
    Chu, Chengbin
    Souissi, Ahmed
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) : 827 - 844
  • [8] Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Shu-Xia
    Cao, Zhi-Gang
    Zhang, Yu-Zhong
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 111 - +
  • [9] Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
    Mellouli, Racem
    Sadfi, Cherif
    Chu, Chengbin
    Kacem, Imed
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (03) : 1150 - 1165
  • [10] Preemptive multiprocessor order scheduling to minimize total weighted flowtime
    Leung, Joseph Y. -T.
    Lee, C. Y.
    Ng, C. W.
    Young, G. H.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) : 40 - 51
12345