Scheduling on proportionate flow shop with job rejection and common due date assignment

被引:10
|
作者
Geng, Xin-Na [1 ]
Sun, Xinyu [1 ,3 ]
Wang, Jiayin [2 ]
Pan, Lei [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Peoples R China
[2] Xi An Jiao Tong Univ, Sch Comp Sci & Technol, Xian 710049, Peoples R China
[3] Xi An Jiao Tong Univ, Sch Management, 28 Xianning West Rd, Xian 710049, Shannxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Dynamic programming; Job rejection; Common due date; Proportionate flow shop; DEPENDENT PROCESSING TIMES; SINGLE-MACHINE; MODEL; COST;
D O I
10.1016/j.cie.2023.109317
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We study proportionate flow shop scheduling problem allowing job rejection. The objective function is to minimize the earliness, tardiness, due date cost, and rejection cost. We consider the collaboration between the manufacturer and supplier. The common due date is measured in two-ways, which is only related to accepted jobs (total rejection case) or all jobs share a common due date (semi-rejection case). We show the relation between proportionate flow shop and single-machine problems, use the properties of single-machine to solve proportionate flow shop problems with job rejection, and propose the corresponding dynamic programming algorithm and algorithm complexity for the problems.
引用
收藏
页数:9
相关论文
共 50 条