By Topic

A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Avella, P. ; Dipt. di Ing., Univ. del Sannio, Benevento, Italy ; Boccia, M. ; Vasilyev, I.

The multilevel generalized assignment problem (MGAP) consists of minimizing the assignment cost of a set of jobs to machines, each having associated therewith a capacity constraint. Each machine can perform a job with different efficiency levels that entail different costs and amount of resources required. The MGAP was introduced in the context of large manufacturing systems as a more general variant of the well-known generalized assignment problem, where a single efficiency level is associated with each machine. In this paper, we propose a branch-and-cut algorithm whose core is an exact separation procedure for the multiple-choice knapsack polytope induced by the capacity constraints and single-level execution constraints. A computational experience on a set of benchmark instances is reported, showing the effectiveness of the proposed approach.

Published in:

Access, IEEE  (Volume:1 )
Comment Policy
comments powered by Disqus