Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date

We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Operations Research Society of China (Internet) Ročník 12; číslo 2; s. 341 - 350
Hlavní autor: Li, Wei-Dong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024
Springer Nature B.V
Témata:
Accuracy
Algorithms
Approximation
Employment
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Preempting
Schedules
Scheduling
Workloads
China
90B35
Fully polynomial time approximation scheme
Polynomial time approximation scheme
Scheduling
68M20
Early work
Efficient polynomial time approximation scheme
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!
Popis
Shrnutí:We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy ε , we propose an efficient polynomial time approximation scheme with running time O f ( 1 / ε n ) , where n is the number of jobs and f ( 1 / ε ) is exponential in 1 / ε , and a fully polynomial time approximation scheme with running time O 1 ε 2 m + 1 + n when the number of machines is fixed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2194-668X
2194-6698
DOI:10.1007/s40305-022-00402-y