Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work

被引：11
|
作者：
He, Ruyan [1 ]
Yuan, Jinjiang [1 ]
Ng, C. T. [2 ]
Cheng, T. C. E. [2 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Hong Kong Polytech Univ, Logist Res Ctr, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2021年 / 41卷 / 02期
关键词：
Scheduling; Two agents; Pareto-scheduling; Number of tardy jobs; Total late work;
D O I：
10.1007/s10878-021-00697-2
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider the single-machine preemptive Pareto-scheduling problem with two competing agents A and B, where agent A wants to minimize the number of its jobs (the A-jobs) that is tardy, while agent B wants to minimize the total late work of its jobs (the B-jobs). We provide an O(nn(A) log n(A)+ n(B) log n(B))-time algorithm that generates all the Pareto-optimal points, where n(A) is the number of the A-jobs, n(B) is the number of the B-jobs, and n = n(A) + n(B).
引用
收藏
页码：504 / 525
页数：22
相关论文
共 50 条
  • [1] 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
  • [2] Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
    He, Ruyan
    Yuan, Jinjiang
    [J]. MATHEMATICS, 2020, 8 (09)
  • [3] 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
  • [4] Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
    Chen, Rubing
    He, Ruyan
    Yuan, Jinjiang
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 167
  • [5] Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work
    Zhang, Yuan
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. MATHEMATICS, 2020, 8 (11)
  • [6] Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
    Wan, Long
    Mei, Jiajie
    Du, Jiangze
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (01) : 26 - 35
  • [7] Algorithms for a two-agent single machine scheduling problem to minimize weighted number of tardy jobs
    Li, Jiaji
    Gajpal, Yuvraj
    Appadoo, Srimantoorao S.
    [J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2021, 42 (04): : 785 - 811
  • [8] 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
  • [9] Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
    Yunqiang Yin
    Youhua Chen
    Kaida Qin
    Dujuan Wang
    [J]. Journal of Scheduling, 2019, 22 : 315 - 333
  • [10] Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
    Yin, Yunqiang
    Chen, Youhua
    Qin, Kaida
    Wang, Dujuan
    [J]. JOURNAL OF SCHEDULING, 2019, 22 (03) : 315 - 333
12345