Due-window assignment scheduling with past-sequence-dependent setup times

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 suc...

Full description

Saved in:
Bibliographic Details
Published inMathematical biosciences and engineering : MBE Vol. 19; no. 3; pp. 3110 - 3126
Main Authors Liu, Weiguo, Wang, Xuyin, Wang, Xiaoxiao, Zhao, Peizhen
Format Journal Article
LanguageEnglish
Published United States AIMS Press 01.01.2022
Subjects
Algorithms
due-window assignment
scheduling
setup times
single-machine
scheduling
setup times
due-window assignment
single-machine
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1551-0018
1551-0018
DOI:10.3934/mbe.2022144