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ženo v:

Podrobná bibliografie
Vydáno v:	Journal of the Operations Research Society of China (Internet) Ročník 9; číslo 1; s. 63 - 77
Hlavní autoři:	Zhang, Yu-Zhong, Li, Shu-Guang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Beijing Operations Research Society of China 01.03.2021 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!