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 条
12345