An efficient polynomial time approximation scheme for load balancing on uniformly related machines

We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, C i denotes the completion time of machine i . Our goal is to find a schedule that minimizes or maximizes ∑...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 147; číslo 1-2; s. 1 - 23
Hlavní autoři:	Epstein, Leah, Levin, Asaf
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2014 Springer Nature B.V
Témata:	Algorithms Analysis Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Completion time Computer science Dynamic programming Employment Full Length Paper Intervals Job shops Load Load balancing Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Partitions Polynomials Schedules Scheduling Studies Theoretical 90C59 Approximation methods and heuristics 68W25 Approximation algorithms 90C27 Combinatorial optimization Approximation algorithms 68W40 Analysis of algorithms EPTAS Scheduling 68Q25 Analysis of algorithms and problem complexity Load balancing
ISSN:	0025-5610, 1436-4646
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!