Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs

This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time. The goal is to minimize the maximum value of earliness and tardiness penalties, as well as du...

Full description

Saved in:
Bibliographic Details
Published in:Journal of the Operations Research Society of China (Internet) 2024-09, Vol.12 (3), p.681-693
Main Authors: Lv, Dan-Yang, Xue, Jing, Wang, Ji-Bo
Format: Article
Language:English
Subjects:
Algorithms
Dynamic programming
Fines & penalties
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting time. The goal is to minimize the maximum value of earliness and tardiness penalties, as well as due-window location cost, and size cost. Depending on whether the location and size of due-window are known, this paper studies three relevant cases, all of which are solvable in polynomial time.
ISSN:2194-668X
2194-6698
DOI:10.1007/s40305-023-00511-2