Scheduling with generalized and periodic due dates under single- and two-machine environments

被引：4

作者：

Choi, Byung-Cheon ^{[1
]}

Kim, Kyung Min ^{[2
]}

Min, Yunhong ^{[3
]}

Park, Myoung-Ju ^{[4
]}

机构：

[1] Chungnam Natl Univ, Dept Business Adm, 99 Daehak Ro, Daejeon 34134, South Korea

[2] Myongji Univ, Dept Ind Management & Engn, 116 MyongJi Ro, Yongin 17058, Gyeonggi Do, South Korea

[3] Incheon Natl Univ, Grad Sch Logist, 119 Acad Ro, Incheon 22012, Gyeonggi Do, South Korea

[4] Kyung Hee Univ, Dept Ind & Management Syst Engn, 1732 Deogyeong Daero, Yongin 17104, Kyunggi Do, South Korea

来源：

OPTIMIZATION LETTERS | 2022年 / 16卷 / 02期

基金：

新加坡国家研究基金会;

关键词：

Scheduling; Generalized due dates; Periodic due dates; Common due date; Computational complexity; UNARY NP-HARDNESS; COMPLETION TIMES; TOTAL DEVIATION; TARDINESS; EARLINESS; MINIMIZE;

D O I：

10.1007/s11590-021-01739-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider scheduling problems such that the due date is assigned to a job, depending on its position, and the intervals between consecutive due dates are identical. The objective is to minimize the weighted number of tardy jobs or the total weighted tardiness. Both two-machine flow shop and single-machine cases are considered. We establish the computational complexity of each case, based on the relationship with the scheduling problem with a common due date.

引用

页码：623 / 633

页数：11

共 50 条

[1] Scheduling with generalized and periodic due dates under single- and two-machine environments
Byung-Cheon Choi
Kyung Min Kim
Yunhong Min
Myoung-Ju Park
Optimization Letters, 2022, 16 : 623 - 633
[2] Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
Park, Myoung-Ju
Choi, Byung-Cheon
Min, Yunhong
Kim, Kyung Min
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2020, 37 (01)
[3] 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
DISCRETE APPLIED MATHEMATICS, 2022, 314 : 31 - 52
[4] Single machine scheduling with assignable due dates
Qi, XT
Yu, G
Bard, JF
DISCRETE APPLIED MATHEMATICS, 2002, 122 (1-3) : 211 - 233
[5] Minimizing the range of lateness on a single machine under generalized due dates
Tanaka, K
Vlach, M
INFOR, 1997, 35 (04) : 286 - 296
[6] Scheduling in the two-machine flowshop with due date constraints
Lin, BMT
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 70 (02) : 117 - 123
[7] Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates
Tanaka, K
Vlach, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 557 - 563
[8] Two-agent scheduling with generalized due dates
Park, Myoung-Ju
Min, Yun-Hong
Choi, Byung-Cheon
ASIAN JOURNAL OF SHIPPING AND LOGISTICS, 2018, 34 (04): : 345 - 350
[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
APPLIED MATHEMATICS AND COMPUTATION, 2012, 219 (04) : 1674 - 1685
[10] Single machine scheduling with deadlines, release and due dates
Gordon, V
Potapneva, E
Werner, F
ETFA '96 - 1996 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, PROCEEDINGS, VOLS 1 AND 2, 1996, : 22 - 26

← 1 2 3 4 5 →