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
基金
中国国家自然科学基金;
关键词
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 条
  • [21] Online scheduling to minimize modified total tardiness with an availability constraint
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Zheng, Feifeng
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5039 - 5046
  • [22] Scheduling unrelated parallel machines to minimize total weighted tardiness
    Na, Dong-Gil
    Kim, Dong-Won
    Jang, Wooseung
    Chen, F. Frank
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS (SOLI 2006), PROCEEDINGS, 2006, : 758 - +
  • [23] A heuristic for job shop scheduling to minimize total weighted tardiness
    Asano, M
    Ohta, H
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2002, 42 (2-4) : 137 - 147
  • [24] Scheduling unrelated parallel machines to minimize total weighted tardiness
    Liaw, CF
    Lin, YK
    Cheng, CY
    Chen, MC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (12) : 1777 - 1789
  • [25] Scheduling parallel machines to minimize total weighted and unweighted tardiness
    Alidaee, B
    Rosa, D
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (08) : 775 - 788
  • [26] Two-machine flowshop scheduling to minimize total tardiness
    Pan, JCH
    Fan, ET
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1997, 28 (04) : 405 - 414
  • [27] Scheduling on a single machine with family setups to minimize total tardiness
    Schaller, Jeffrey
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2007, 105 (02) : 329 - 344
  • [28] Single machine scheduling to minimize weighted earliness subject to maximum tardiness
    Chen, TS
    Qi, XT
    Tu, FS
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (02) : 147 - 152
  • [29] A note on lot scheduling on a single machine to minimize maximum weighted tardiness
    Gur Mosheiov
    Assaf Sarig
    [J]. Journal of Combinatorial Optimization, 2023, 45
  • [30] A note on scheduling a rate modifying activity to minimize total late work
    Mosheiov, Gur
    Oron, Daniel
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 154