Mathematical Biosciences and Engineering | 卷:19 |
Due-window assignment scheduling with past-sequence-dependent setup times | |
Xuyin Wang1  Weiguo Liu1  Xiaoxiao Wang1  Peizhen Zhao1  | |
[1] Business School, Northwest Normal University, Lanzhou 730070, China; | |
关键词: scheduling; single-machine; due-window assignment; setup times; | |
DOI : 10.3934/mbe.2022144 | |
来源: DOAJ |
【 摘 要 】
This article investigates the due-window assignment scheduling problem with setup times on a single machine, where setup times of jobs are past-sequence-dependent. Under common, slack and unrestricted due-window assignment methods, the goal is to determine the optimal job sequence and due-window such that the cost function (i.e., the weighted sum of earliness and tardiness, number of early and tardy jobs, due-window starting time and size) is minimized. We solve the problem optimally by introducing a polynomial time algorithm. An extension to the problem with learning and deterioration effects is also studied.
【 授权许可】
Unknown