Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs

被引：8
|
作者：
Chen, Rubing [1 ,2 ]
He, Ruyan [3 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Zhengzhou Univ, Sch Informat Engn, Zhengzhou 450001, Henan, Peoples R China
[3] Zhengzhou Univ Aeronaut, Sch Management Engn, Zhengzhou 450046, Henan, Peoples R China
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2022年 / 167卷
基金：
中国国家自然科学基金;
关键词：
Preemptive scheduling; Single machine; Two weights; Total weighted late work; Weighted number of tardy jobs; SINGLE-MACHINE; ALGORITHMS; TRADEOFF;
D O I：
10.1016/j.cie.2022.107969
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the single-machine bi-criteria preemptive scheduling for minimizing the total weighted late work and the weighted number of tardy jobs, where weights of the jobs for the two criteria are independent, and so, each job has two unrelated weights. The Pareto-scheduling problem is studied in this paper, which includes the hierarchical-scheduling problem as a subversion. For the Pareto-scheduling problem, we present a pseudo-polynomial-time algorithm. Moreover, we present the complexity classification for various subproblems under some restrictions on the weights, due dates, and processing times.
引用
收藏
页数：17
相关论文
共 50 条
  • [41] Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
    Mor, Baruch
    Mosheiov, Gur
    Shapira, Dana
    [J]. INFORMATION PROCESSING LETTERS, 2020, 164 (164)
  • [42] Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs
    Eghbalpor, Parvaneh
    Reisi-Nafchi, Mohammad
    Moslehi, Ghasem
    [J]. INTERNATIONAL JOURNAL OF MANUFACTURING RESEARCH, 2021, 16 (02) : 154 - 186
  • [43] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
    Abbasali Jafari
    Ghasem Moslehi
    [J]. Journal of Global Optimization, 2012, 54 : 389 - 404
  • [44] Preemptive multiprocessor order scheduling to minimize total weighted flowtime
    Leung, Joseph Y. -T.
    Lee, C. Y.
    Ng, C. W.
    Young, G. H.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) : 40 - 51
  • [45] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
    Jafari, Abbasali
    Moslehi, Ghasem
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (02) : 389 - 404
  • [46] PREEMPTIVE SCHEDULING OF 2 UNIFORM MACHINES TO MINIMIZE THE NUMBER OF LATE JOBS
    LAWLER, EL
    MARTEL, CU
    [J]. OPERATIONS RESEARCH, 1989, 37 (02) : 314 - 318
  • [47] HETEROGENEOUS-CRITERIA SCHEDULING - MINIMIZING WEIGHTED NUMBER OF TARDY JOBS AND WEIGHTED COMPLETION-TIME
    PEHA, JM
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (10) : 1089 - 1100
  • [48] Preemptive scheduling of jobs with tied parameters on a single processor to minimize the number of late jobs
    Vakhania, Nodari
    [J]. PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS: RECENT ADVANCES IN APPLIED MATHEMATICS, 2009, : 101 - +
  • [49] Single-machine scheduling with deadlines to minimize the total weighted late work
    Chen, Rubing
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. NAVAL RESEARCH LOGISTICS, 2019, 66 (07) : 582 - 595
  • [50] Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs
    Arbib, Claudio
    Felici, Giovanni
    Servilio, Mara
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 84 : 18 - 30
12345