Approximation schemes for two-agent scheduling on parallel machines

Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-har...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 468; s. 114 - 121
Hlavní autoři: Zhao, Kejun, Lu, Xiwen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 14.01.2013
Témata:
Agent scheduling
Algorithm
Dynamic programming
Fully polynomial time approximation scheme
Parallel machines
Parallel machines
Fully polynomial time approximation scheme
Dynamic programming
Algorithm
Agent scheduling
ISSN:0304-3975, 1879-2294
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í:Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-hard and can be solved in pseudo-polynomial time. Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.11.002