Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time

被引：0
|
作者：
Li, Wenjie [1 ]
Liu, Hailing [2 ]
Li, Shisheng [3 ]
机构：
[1] Luoyang Normal Univ, Sch Math Sci, Luoyang 471934, Henan, Peoples R China
[2] Henan Inst Engn, Coll Sci, Zhengzhou 451191, Henan, Peoples R China
[3] Zhongyuan Univ Technol, Dept Informat & Computat Sci, Zhengzhou 450007, Henan, Peoples R China
来源：
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2018年 / 35卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Scheduling; online algorithm; kind release time; total weighted completion time; SINGLE-MACHINE; REJECTION COST; RELEASE DATES; ALGORITHMS; PLUS;
D O I：
10.1142/S0217595918500240
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper studies online scheduling on m identical parallel machines under the KRT environment, where jobs arrive over time and "KRT" means that in the online setting no jobs can be released when all of the machines are busy. The goal is to determine a feasible schedule to minimize the total of weighted completion times. When m = 1, we prove that WSPT is an optimal online algorithm. When m >= 2, we first present a lower bound m(2)-2+root m(4)-4m+4/2m(m-1), and then show that WSPT is a 2-competitive online algorithm for the case m = 2. For the case in which m = 2 and all jobs have equal processing times, we provide a best possible online algorithm with a competitive ratio of 1+root 3/2.
引用
收藏
页数：12
相关论文
共 50 条
  • [21] Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
    Ma, Ran
    Wan, Long
    Wei, Lijun
    Yuan, Jinjiang
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 156 : 31 - 38
  • [22] Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines
    Ma R.
    Yuan J.-J.
    Journal of the Operations Research Society of China, 2016, 4 (1) : 111 - 119
  • [23] SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    BELOUADAH, H
    POTTS, CN
    DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) : 201 - 218
  • [24] 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
  • [25] 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
  • [26] 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
  • [27] Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
    Ma, Ran
    Tao, Jiping
    Yuan, Jinjiang
    APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 : 570 - 583
  • [28] 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
  • [29] 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
  • [30] 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 - +
12345