Single machine scheduling with assignable due dates to minimize maximum and total late work

被引：4

作者：

Justkowiak, Jan-Erik ^{[1
]}

Kovalev, Sergey ^{[2
]}

Kovalyov, Mikhail Y. ^{[3
]}

Pesch, Erwin ^{[1
,4
]}

机构：

[1] Univ Siegen, Inst Informat Syst, Fac 3, D-57068 Siegen, Germany

[2] INSEEC, Omnes Educ, 25 Rue Univ, Lyon, France

[3] Natl Acad Sci Belarus, United Inst Informat Problems, Surganova 6, Minsk 220012, BELARUS

[4] Ctr Adv Studies Management, HHL Leipzig Grad Sch Management, D-04109 Leipzig, Germany

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2023年 / 308卷 / 01期

关键词：

Scheduling; Single machine; Late work; Assignable due dates; FPTAS; BATCH DELIVERY; APPROXIMATION SCHEME; EFFICIENT FPTAS; COORDINATION; ASSIGNMENT; COMPLEXITY;

D O I：

10.1016/j.ejor.2022.10.047

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A single machine scheduling problem with assignable job due dates to minimize total late work has recently been introduced by Mosheiov, Oron, and Shabtay (2021). The problem was proved NP-hard in the ordinary sense, and no solution algorithm was proposed. In this note, we present two pseudo-polynomial dynamic programming algorithms and an FPTAS for this problem. Besides, we introduce a new single machine scheduling problem to minimize maximum late work of jobs with assignable due dates. We develop an O(n log n ) time algorithm for it, where n is the number of jobs. An optimal solution value of this new problem is a lower bound for the optimal value of the total late work minimization problem, and it is used in the FPTAS. (c) 2022 Elsevier B.V. All rights reserved.

引用

页码：76 / 83

页数：8

共 50 条

[1] Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work
Chen, Rubing
Gao, Yuan
Geng, Zhichao
Yuan, Jinjiang
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (22) : 7630 - 7648
[2] Single machine scheduling to minimize a modified total late work function with multiple due dates
Kethley, R. Bryan
Alidaee, Bahram
Wang, Haibo
[J]. PRODUCTION AND MANUFACTURING RESEARCH-AN OPEN ACCESS JOURNAL, 2014, 2 (01): : 624 - 639
[3] Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
Shabtay, Dvir
Mosheiov, Gur
Oron, Daniel
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303 (01) : 66 - 77
[4] Single machine scheduling with assignable due dates
Qi, XT
Yu, G
Bard, JF
[J]. DISCRETE APPLIED MATHEMATICS, 2002, 122 (1-3) : 211 - 233
[5] SINGLE-MACHINE SCHEDULING TO MINIMIZE TOTAL LATE WORK
POTTS, CN
VANWASSENHOVE, LN
[J]. OPERATIONS RESEARCH, 1992, 40 (03) : 586 - 595
[6] A single machine scheduling with generalized and periodic due dates to minimize total deviation
Choi, Byung-Cheon
Kim, Kyung Min
Min, Yunhong
Park, Myoung-Ju
[J]. DISCRETE APPLIED MATHEMATICS, 2022, 314 : 31 - 52
[7] Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates
Tanaka, K
Vlach, M
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 557 - 563
[8] Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Tian, Zhongjun
Ng, C. T.
Cheng, T. C. E.
[J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (05) : 368 - 374
[9] Two-agent single-machine scheduling with assignable due dates
Yin, Yunqiang
Cheng, Shuenn-Ren
Cheng, T. C. E.
Wu, Chin-Chia
Wu, Wen-Hsiang
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 219 (04) : 1674 - 1685
[10] 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 →