Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria

被引：10
|
作者：
He, Ruyan [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China
来源：
MATHEMATICS | 2020年 / 8卷 / 09期
基金：
中国国家自然科学基金;
关键词：
two-agent; Pareto-scheduling; late work; trade-off curve; polynomial time; SINGLE-MACHINE; COMPLEXITIES;
D O I：
10.3390/math8091517
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent A is the total completion time, the maximum lateness, or the total late work while the objective function of agent B is the total late work. For each problem, we provide a polynomial-time algorithm to characterize the trade-off curve of all Pareto-optimal points.
引用
收藏
页数：17
相关论文
共 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 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
  • [3] 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)
  • [4] A two-agent single-machine scheduling problem with late work criteria
    Du-Juan Wang
    Chao-Chung Kang
    Yau-Ren Shiau
    Chin-Chia Wu
    Peng-Hsiang Hsu
    [J]. Soft Computing, 2017, 21 : 2015 - 2033
  • [5] A two-agent single-machine scheduling problem with late work criteria
    Wang, Du-Juan
    Kang, Chao-Chung
    Shiau, Yau-Ren
    Wu, Chin-Chia
    Hsu, Peng-Hsiang
    [J]. SOFT COMPUTING, 2017, 21 (08) : 2015 - 2033
  • [6] Two-agent scheduling problems on a single-machine to minimize the total weighted late work
    Zhang Xingong
    Wang Yong
    [J]. Journal of Combinatorial Optimization, 2017, 33 : 945 - 955
  • [7] Two-agent scheduling problems on a single-machine to minimize the total weighted late work
    Zhang Xingong
    Wang Yong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 945 - 955
  • [8] Two-agent scheduling to minimize the total cost
    Nong, Q. Q.
    Cheng, T. C. E.
    Ng, C. T.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 215 (01) : 39 - 44
  • [9] A note on competing-agent Pareto-scheduling
    Gao, Yuan
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. OPTIMIZATION LETTERS, 2021, 15 (01) : 249 - 262
  • [10] A note on competing-agent Pareto-scheduling
    Yuan Gao
    Jinjiang Yuan
    C. T. Ng
    T. C. E. Cheng
    [J]. Optimization Letters, 2021, 15 : 249 - 262
12345