Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 1995.04a
- /
- Pages.47-53
- /
- 1995
A new heuristics for the generalized assignment problem
Abstract
The Generalized Assignment (GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.
Keywords