Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints

The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delive...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of the Operations Research Society of China (Internet) Ročník 9; číslo 1; s. 63 - 77
Hlavní autori: Zhang, Yu-Zhong, Li, Shu-Guang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Beijing Operations Research Society of China 01.03.2021
Springer Nature B.V
Predmet:
Advisors
Algorithms
Approximation
Completion time
Management Science
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Scheduling
Delivery time
90B35
Release time
Nested eligibility constraints
Polynomial time approximation scheme
Scheduling
68M20
ISSN:2194-668X, 2194-6698
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delivered. For the special case of equal release time, a 2-approximation algorithm is presented whose running time depends linearly on the number of jobs. For the general case of unequal release time, a polynomial time approximation scheme is derived.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2194-668X
2194-6698
DOI:10.1007/s40305-019-00268-7