Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147680
Authors: 
Drexl, Andreas
Jørnsten, Kurt
Year of Publication: 
2007
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 627
Abstract: 
The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not readily available. In this paper we propose a family of linear programming models the optimal solution of which is integral "almost always". We provide a computational proof of this conjecture by an in-depth experimental study of 1500 instances generated according to the standard procedure adopted in literature. Summarizing this analysis we have linear prices for all but 17 of the whole bunch of instances and, hence, there exists a linear price function that supports the optimal assignment of jobs to processors.
Subjects: 
Generalized assignment problem
integer programming
duality
linear programming
pricing
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.