한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)
- 제14권1호
- /
- Pages.31-31
- /
- 1989
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
A New Heuristic for the Generalized Assignment Problem
초록
The Generalized Assignment Problem(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.
키워드