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 条
  • [41] SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    BELOUADAH, H
    POSNER, ME
    POTTS, CN
    DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) : 213 - 231
  • [42] New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Liqi
    Yu, Xue
    Lu, Lingfa
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 75 - 94
  • [43] Parallel-machine scheduling to minimize overtime and waste costs
    Freeman, Nickolas K.
    Mittenthal, John
    Melouk, Sharif H.
    IIE TRANSACTIONS, 2014, 46 (06) : 601 - 618
  • [44] Scheduling to minimize the maximum total completion time per machine
    Wan, Long
    Ding, Zhihao
    Li, Yunpeng
    Chen, Qianqian
    Tan, Zhiyi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (01) : 45 - 50
  • [45] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
    Ling-Huey Su
    The International Journal of Advanced Manufacturing Technology, 2009, 40 : 572 - 581
  • [46] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
    Su, Ling-Huey
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (5-6): : 572 - 581
  • [47] A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time"
    Yu, Sheng
    Wong, Prudence W. H.
    INFORMATION PROCESSING LETTERS, 2012, 112 (1-2) : 55 - 58
  • [48] Open shop scheduling problem to minimize total weighted completion time
    Bai, Danyu
    Zhang, Zhihai
    Zhang, Qiang
    Tang, Mengqian
    ENGINEERING OPTIMIZATION, 2017, 49 (01) : 98 - 112
  • [49] Scheduling a maintenance activity to minimize total weighted completion-time
    Mosheiov, Gur
    Sarig, Assaf
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (04) : 619 - 623
  • [50] Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective
    Weng, MX
    Lu, J
    Ren, HY
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 70 (03) : 215 - 226
12345