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

Title
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Authors
Keywords
-
Journal
INFORMATION PROCESSING LETTERS
Volume 109, Issue 16, Pages 913-917
Publisher
Elsevier BV
Online
2009-05-05
DOI
10.1016/j.ipl.2009.04.018

Ask authors/readers for more resources

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now