Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work

被引：9

作者：

Zhang, Yuan ^{[1
]}

Geng, Zhichao ^{[1
]}

Yuan, Jinjiang ^{[1
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China

来源：

MATHEMATICS | 2020年 / 8卷 / 11期

关键词：

scheduling; two agents; pareto frontier; approximation algorithms; 2 COMPETING AGENTS; SINGLE-MACHINE; OPTIMIZATION; NUMBER;

D O I：

10.3390/math8112070

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We investigate the Pareto-scheduling problem with two competing agents on a single machine to minimize the total weighted completion time of agent A's jobs and the total weighted late work of agent B's jobs, the B-jobs having a common due date. Since this problem is known to be NP-hard, we present two pseudo-polynomial-time exact algorithms to generate the Pareto frontier and an approximation algorithm to generate a (1+epsilon)-approximate Pareto frontier. In addition, some numerical tests are undertaken to evaluate the effectiveness of our algorithms.

引用

页数：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] Single machine scheduling with two-agent for total weighted completion time objectives
Li, Hongwei
Gajpal, Yuvraj
Bector, C. R.
[J]. APPLIED SOFT COMPUTING, 2018, 70 : 147 - 156
[4] A note on a two-agent scheduling problem related to the total weighted late work
Zhang, Yuan
Yuan, Jinjiang
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 989 - 999
[5] A note on a two-agent scheduling problem related to the total weighted late work
Yuan Zhang
Jinjiang Yuan
[J]. Journal of Combinatorial Optimization, 2019, 37 : 989 - 999
[6] 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
[7] 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
[8] 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
[9] SINGLE-MACHINE PARETO-SCHEDULING WITH MULTIPLE WEIGHTING VECTORS FOR MINIMIZING THE TOTAL WEIGHTED LATE WORKS
School of Mathematics and Statistics, Zhengzhou University, Henan, Zhengzhou
450001, China
[J]. J. Ind. Manage. Optim., 1600, 1 (456-471):
[10] SINGLE-MACHINE PARETO-SCHEDULING WITH MULTIPLE WEIGHTING VECTORS FOR MINIMIZING THE TOTAL WEIGHTED LATE WORKS
Guo, Shuen
Geng, Zhichao
Yuan, Jinjiang
[J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2021, : 456 - 471

← 1 2 3 4 5 →