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 条
  • [1] Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
    Guo, Shuen
    Lu, Lingfa
    Yuan, Jinjiang
    Ng, Chi To
    Cheng, Tai Chiu Edwin
    [J]. NAVAL RESEARCH LOGISTICS, 2022, 69 (05) : 816 - 837
  • [2] Batch scheduling to minimize the weighted number of tardy jobs
    Erel, Erdal
    Ghosh, Jay B.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) : 394 - 400
  • [3] Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
    Zhang, Yuan
    Yuan, Jinjiang
    Ng, Chi To
    Cheng, Tai Chiu E.
    [J]. NAVAL RESEARCH LOGISTICS, 2021, 68 (03) : 378 - 393
  • [4] Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
    Ruyan He
    Jinjiang Yuan
    C. T. Ng
    T. C. E. Cheng
    [J]. Journal of Combinatorial Optimization, 2021, 41 : 504 - 525
  • [5] Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
    He, Ruyan
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (02) : 504 - 525
  • [6] Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
    Lee, Wen-Chiung
    Lu, Zon-Syun
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (17) : 8750 - 8757
  • [7] Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
    Soroush, H. M.
    [J]. KUWAIT JOURNAL OF SCIENCE, 2013, 40 (01) : 123 - 147
  • [8] Concurrent open shop scheduling to minimize the weighted number of tardy jobs
    Ng, CT
    Cheng, TCE
    Yuan, JJ
    [J]. JOURNAL OF SCHEDULING, 2003, 6 (04) : 405 - 412
  • [9] SEQUENCING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
    LAWLER, EL
    [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (05): : 27 - 33
  • [10] A SURVEY OF SINGLE MACHINE SCHEDULING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
    Adamu, Muminu O.
    Adewumi, Aderemi O.
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (01) : 219 - 241
12345