A class of greedy algorithms for the generalized assignment problem
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a class of greedy algorithms for the GAP. A family of weight function...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
2000
|