Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

被引:0
|
作者
Malgorzata Sterna
Kateryna Czerniachowska
机构
[1] Poznan University of Technology,Institute of Computing Science
关键词
Scheduling; Parallel machines; Early work; Late work; Polynomial time approximation scheme; 90B35; 68Q25;
D O I
暂无
中图分类号
学科分类号
摘要
We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NP-hard. We prove a few dominance properties of optimal solutions of this problem. Their proposal was inspired by the results of some auxiliary computational experiments. Test were performed with the dynamic programming algorithm and list algorithms. Then, we propose the polynomial time approximation scheme, based on structuring problem input. Moreover, we discuss the relationship between the early work criterion and the related late work criterion. We compare the computational complexity and approximability of scheduling problems with both mentioned objective functions.
引用
收藏
页码:927 / 944
页数:17
相关论文
共 50 条
  • [1] Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work
    Sterna, Malgorzata
    Czerniachowska, Kateryna
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 927 - 944
  • [2] Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
    Chen, Xin
    Liang, Yage
    Sterna, Malgorzata
    Wang, Wen
    Blazewicz, Jacek
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (01) : 67 - 74
  • [3] Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
    Wei-Dong Li
    [J]. Journal of the Operations Research Society of China, 2024, 12 : 341 - 350
  • [4] Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
    Li, Wei-Dong
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024, 12 (02) : 341 - 350
  • [5] Semi-online scheduling on two identical machines with a common due date to maximize total early work
    Chen, Xin
    Kovalev, Sergey
    Liu, Yuqing
    Sterna, Malgorzata
    Chalamon, Isabelle
    Blazewicz, Jacek
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 290 (290) : 71 - 78
  • [6] Alternative algorithms for identical machines scheduling to maximize total early work with a common due date
    Chen, Xin
    Shen, Xuefeng
    Kovalyov, Mikhail Y.
    Sterna, Malgorzata
    Blazewicz, Jacek
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 171
  • [7] Online and Semi-Online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work
    Xiao, Man
    Liu, Xiaoqiao
    Li, Weidong
    Chen, Xin
    Sterna, Malgorzata
    Blazewicz, Jacek
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2024, 34 (02) : 253 - 261
  • [8] Approximation algorithms for common due date assignment and job scheduling on parallel machines
    Xiao, WG
    Li, CL
    [J]. IIE TRANSACTIONS, 2002, 34 (05) : 467 - 477
  • [9] Two-machine flow shop scheduling with a common due date to maximize total early work
    Chen, Xin
    Miao, Qian
    Lin, Bertrand M. T.
    Sterna, Malgorzata
    Blazewicz, Jacek
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (02) : 504 - 511
  • [10] Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
    Kovalyov, MY
    Werner, F
    [J]. JOURNAL OF HEURISTICS, 2002, 8 (04) : 415 - 428