An algorithm for the bottleneck generalized assignment problem

An algorithm for the bottleneck generalized assignment problem

0.00 Avg rating0 Votes
Article ID: iaor1994707
Country: United Kingdom
Volume: 20
Issue: 4
Start Page Number: 355
End Page Number: 362
Publication Date: May 1993
Journal: Computers and Operations Research
Authors: ,
Abstract:

The authors discuss a bottleneck (or minimax) version of the generalized assignment problem, known as the task bottleneck generalized assignment problem (TBGAP). TBGAP involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not exceeded. The objective is to minimize the maximum of the costs of the assignments that are made. The authors present an algorithm for solving TBGAP. The TBGAP algorithm is illustrated by an example and computational experience is reported. The algorithm is seen to be effective in solving TBGAP problems to optimality.

Reviews

Required fields are marked *. Your email address will not be published.