Approximation algorithms for dynamic resource allocation

0.00 Avg rating—0 Votes

Article ID:	iaor20062221
Country:	Netherlands
Volume:	34
Issue:	2
Start Page Number:	180
End Page Number:	190
Publication Date:	Mar 2006
Journal:	Operations Research Letters
Authors:	Roy Benjamin Van, Farias Vivek F.
Keywords:	scheduling

Abstract:

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.

Reviews

Required fields are marked *. Your email address will not be published.