A new heuristics for the generalized assignment problem

  • Joo, Jaehun (Department of Information Industry, Dongguk University)
  • 발행 : 1995.04.01

초록

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.

키워드