Bicriteria scheduling to minimize total late work and maximum tardiness with preemption

被引：9

作者：

Chen, Rubing ^{[2
]}

Yuan, Jinjiang ^{[1
]}

Ng, C. T. ^{[3
]}

Cheng, T. C. E. ^{[3
]}

机构：

[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] Hong Kong Polytech Univ, Logist Res Ctr, Dept Logist & Maritime Studies, Hong Kong, Peoples R China

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2021年 / 159卷

基金：

中国国家自然科学基金;

关键词：

Bicriteria scheduling; Preemption; Total late work; Maximum tardiness; SINGLE-MACHINE;

D O I：

10.1016/j.cie.2021.107525

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider single-machine bicriteria scheduling of n jobs with preemption to minimize the total late work and maximum tardiness. Given the earliest due date order of the jobs in advance, we present an O(n)-time algorithm for the hierarchical scheduling problem and an O(nlogn)-time algorithm for the constrained scheduling problem. For the Pareto-scheduling problem, when all the processing times and due dates are integral, we construct the trade-off curve in O(nlognP) time, where P is the total processing time of the jobs.

引用

页数：13

共 50 条

[41] Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Lushchakova, Irina N.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (01) : 27 - 33
[42] Single machine scheduling with family setups to minimize total earliness and tardiness
Schaller, Jeffrey E.
Gupta, Jatinder N. D.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 1050 - 1068
[43] Simple heuristic to minimize total tardiness in a single machine scheduling problem
Panneerselvam, R.
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (7-8): : 722 - 726
[44] Simple heuristic to minimize total tardiness in a single machine scheduling problem
R. Panneerselvam
[J]. The International Journal of Advanced Manufacturing Technology, 2006, 30 : 722 - 726
[45] The two stage assembly flowshop scheduling problem to minimize total tardiness
Allahverdi, Ali
Aydilek, Harun
[J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (02) : 225 - 237
[46] The two stage assembly flowshop scheduling problem to minimize total tardiness
Ali Allahverdi
Harun Aydilek
[J]. Journal of Intelligent Manufacturing, 2015, 26 : 225 - 237
[47] Online scheduling to minimize total weighted (modified) earliness and tardiness cost
Arman Jabbari
Philip M. Kaminsky
[J]. Journal of Scheduling, 2021, 24 : 431 - 446
[48] Scatter Search for Distributed Assembly Flowshop Scheduling to Minimize Total Tardiness
Yang, Yixin
Li, Peng
Wang, Shouyang
Liu, Bo
Luo, Yongliang
[J]. 2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 861 - 868
[49] Single machine group scheduling with family setups to minimize total tardiness
Gupta, Jatinder N. D.
Chantaravarapan, Samarn
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (06) : 1707 - 1722
[50] APPROXIMATION ALGORITHMS FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE TOTAL LATE WORK
POTTS, CN
VANWASSENHOVE, LN
[J]. OPERATIONS RESEARCH LETTERS, 1992, 11 (05) : 261 - 266

← 1 2 3 4 5 →