The Due Window Assignment Problems with Deteriorating Job and Delivery Time

Jin Qian and Yu Zhan
Additional contact information
Jin Qian: College of Science, Northeastern University, Shenyang 110819, China
Yu Zhan: College of Science, Northeastern University, Shenyang 110819, China

Mathematics, 2022, vol. 10, issue 10, 1-16

Abstract: 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 ( n l o g n ) time. We propose the corresponding algorithms to obtain the optimal sequence, window location and window size.

Keywords: scheduling; due window; deteriorating job; delivery time; earliness; tardiness (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/10/1672/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/10/1672/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:10:p:1672-:d:815042

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().