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 条
  • [1] Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
    Shabtay, Dvir
    Steiner, George
    Yedidsion, Liron
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (10) : 1090 - 1103
  • [2] Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time
    Cai, XQ
    Lee, CY
    Wong, TL
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2000, 16 (06): : 824 - 830
  • [3] A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization
    Chakravarthy, K
    Rajendran, C
    [J]. PRODUCTION PLANNING & CONTROL, 1999, 10 (07) : 707 - 714
  • [4] Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
    Kondakci, SK
    Azizoglu, M
    Koksalan, M
    [J]. NAVAL RESEARCH LOGISTICS, 1996, 43 (06) : 929 - 936
  • [5] BICRITERIA SCHEDULING PROBLEM INVOLVING TOTAL TARDINESS AND TOTAL EARLINESS PENALTIES
    AZIZOGLU, M
    KONDAKCI, S
    KIRCA, O
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1991, 23 (1-3) : 17 - 24
  • [6] Single machine scheduling with assignable due dates to minimize maximum and total late work
    Justkowiak, Jan-Erik
    Kovalev, Sergey
    Kovalyov, Mikhail Y.
    Pesch, Erwin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (01) : 76 - 83
  • [7] BICRITERIA SCHEDULING FOR DUE DATE ASSIGNMENT WITH TOTAL WEIGHTED TARDINESS
    Lin, Hao
    He, Cheng
    Lin, Yixun
    [J]. RAIRO-OPERATIONS RESEARCH, 2018, 52 (02) : 359 - 370
  • [8] Parallel machine scheduling to minimize total tardiness
    Yalaoui, F
    Chu, CB
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 76 (03) : 265 - 279
  • [9] Scheduling in flowshops to minimize total tardiness of jobs
    Hasija, S
    Rajendran, C
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (11) : 2289 - 2301
  • [10] Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 234 - 240
12345