The Due Window Assignment Problems with Deteriorating Job and Delivery Time

Mathematics

Yu Zhan¹  Jin Qian¹ 

[1] College of Science, Northeastern University, Shenyang 110819, China;

关键词: scheduling;    due window;    deteriorating job;    delivery time;    earliness;    tardiness;   

DOI  :  10.3390/math10101672

来源: DOAJ

【 摘 要 】

This paper considers the single machine scheduling problem with due window, delivery time and deteriorating job, whose goal is to minimize the window location, window size, earliness and tardiness. Common due window and slack due window are considered. The delivery time depends on the actual processing time of past sequences. The actual processing time of the job is an increasing function of the start time. Based on the small perturbations technique and adjacent exchange technique, we obtain the propositions of the problems. For common and slack due window assignment, we prove that the two objective functions are polynomial time solvable in $O\left(nlogn\right)$ time. We propose the corresponding algorithms to obtain the optimal sequence, window location and window size.

【 授权许可】

Unknown