Due date assignment scheduling with positional-dependent weights and proportional setup times

In this paper, we investigate the single-machine scheduling problem that considers due date assignment and past-sequence-dependent setup times simultaneously. Under common (slack and different) due date assignment, the objective is to find jointly the optimal sequence and optimal due dates to minimi...

Full description

Saved in:
Bibliographic Details
Published inMathematical biosciences and engineering : MBE Vol. 19; no. 5; pp. 5104 - 5119
Main Authors Wang, Xuyin, Liu, Weiguo, Li, Lu, Zhao, Peizhen, Zhang, Ruifeng
Format Journal Article
LanguageEnglish
Published United States AIMS Press 01.01.2022
Subjects
Algorithms
due date assignment
lateness
past-sequence-dependent setup times
positional-dependent weight
scheduling
scheduling
past-sequence-dependent setup times
due date assignment
positional-dependent weight
lateness
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate the single-machine scheduling problem that considers due date assignment and past-sequence-dependent setup times simultaneously. Under common (slack and different) due date assignment, the objective is to find jointly the optimal sequence and optimal due dates to minimize the weighted sum of lateness, number of early and delayed jobs, and due date cost, where the weight only depends on it's position in a sequence (i.e., a position-dependent weight). Optimal properties of the problem are given and then the polynomial time algorithm is proposed to obtain the optimal solution.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1551-0018
1551-0018
DOI:10.3934/mbe.2022238