Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion time of his own set of jobs. It is known that the unweighted problem with two agents is NP-hard in the ordinary sense. For...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 109; číslo 16; s. 913 - 917
Hlavní autoři:	Lee, Kangbok, Choi, Byung-Cheon, Leung, Joseph Y.-T., Pinedo, Michael L.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 31.07.2009 Elsevier Elsevier Sequoia S.A
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation Approximation algorithm Approximations and expansions Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology FPTAS Mathematical analysis Mathematics Miscellaneous Multi-agent scheduling Multi-Objective Shortest-Path problem Optimization Production scheduling Scheduling algorithms Sciences and techniques of general use Shortest path algorithms Software Studies Theoretical computing Total weighted completion time Total weighted completion time Multi-agent scheduling Approximation algorithm FPTAS Multi-Objective Shortest-Path problem Polynomial Computer theory Polynomial approximation Shortest path Scheduling Polynomial time Completion Information processing Algorithm analysis Single machine
ISSN:	0020-0190, 1872-6119
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!