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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 468; S. 114 - 121
Hauptverfasser:	Zhao, Kejun, Lu, Xiwen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 14.01.2013
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!