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

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 468; s. 114 - 121
Hlavní autori:	Zhao, Kejun, Lu, Xiwen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 14.01.2013
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!