A Note on the Bounded Interval Generalized Assignment Problem.
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
The bounded interval generalized assignment problem is exemplified by the problem of assigning tasks to agents so that each task is assigned to exactly one agent and the time required to complete the set of tasks assigned to any one agent falls between prespecified lower and upper bounds. This note describes an efficient algorithm for solving this problem. Author
- Administration and Management
- Personnel Management and Labor Relations
- Operations Research