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 条
  • [31] Online scheduling on m uniform machines to minimize total (weighted) completion time
    Liu, Ming
    Chu, Chengbiu
    Xu, Yinfeng
    Zheng, Feifeng
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3875 - 3881
  • [32] Scheduling dependent coflows to minimize the total weighted job completion time in datacenters
    Tian, Bingchuan
    Tian, Chen
    Wang, Bingquan
    Li, Bo
    He, Zehao
    Dai, Haipeng
    Liu, Kexin
    Dou, Wanchun
    Chen, Guihai
    COMPUTER NETWORKS, 2019, 158 : 193 - 205
  • [33] Unrelated parallel-machine scheduling to minimize total weighted completion time
    Jeng-Fung Chen
    Journal of Intelligent Manufacturing, 2015, 26 : 1099 - 1112
  • [34] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ran Ma
    Jinjiang Yuan
    Journal of Combinatorial Optimization, 2017, 34 : 483 - 503
  • [35] Scheduling with a weight-modifying activity to minimize the total weighted completion time
    Lin, Bertrand M. T.
    Liu, Shu-Wei
    Mosheiov, Gur
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2024, 128
  • [36] On-line scheduling of a single machine to minimize total weighted completion time
    Anderson, EJ
    Potts, CN
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 548 - 557
  • [37] Single machine lot scheduling to minimize the total weighted (discounted) completion time
    Zhang, E.
    Liu, Ming
    Zheng, Feifeng
    Xu, Yinfeng
    INFORMATION PROCESSING LETTERS, 2019, 142 : 46 - 51
  • [38] SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    BELOUADAH, H
    POTTS, CN
    DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) : 201 - 218
  • [39] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ma, Ran
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 483 - 503
  • [40] Scheduling orders for multiple product types to minimize total weighted completion time
    Leung, Joseph Y. -T.
    Li, Haibing
    Pinedo, Michael
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) : 945 - 970
12345