Approximation algorithms for dynamic resource allocation |
| |
| Authors: | Vivek F. Farias |
| |
| Affiliation: | a Electrical Engineering, Stanford University, Stanford, CA, USA
b Department of Management Science and Engineering, Terman Engineering Center 427, Stanford, CA 94305-4023, USA |
| |
| 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. |
| |
| Keywords: | Resource allocation Scheduling Approximation algorithms Project management Randomized rounding |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
