The multicommodity multiperiod assignment problem I:A specialized branch and bound algorithm

Show simple item record

Author El Nidani, M. Asaad en_US
Author Aronson, Jay E. en_US
Available date 2009-11-25T12:43:30Z en_US
Publication Date 1993 en_US
Citation Journal of Administrative Sciences and Economics, 1993, Vol. 4, Pages 93-134. en_US
URI http://hdl.handle.net/10576/6918 en_US
Abstract The multiperiod assignment problem is an important specialization of the three dimensional assignment problem, which is a generalization of the classical (two dimensional) assignment problem. This model describes the optimization problem of assigning people to activities (jobs) over several time periods. In the most general case, there is a cost assigning a person to an activity in each time period, and a cost of transferring a person from one activity in each period to another activity in the following period. The number of time periods is not restricted to equal the number of persons and activities. We present an integer, multiperiod, multicommodity network flow model formulation of the multiperiod assignment problem, we develop a specialized branch and bound algorithm that exploits the multicommodity structure of the model. We report favorable computational results of an implementation of the algorithm, and compare them to those of a commercial mixed-integer, linear programming code. en_US
Language en en_US
Publisher Qatar University en_US
Subject Economics en_US
Title The multicommodity multiperiod assignment problem I:A specialized branch and bound algorithm en_US
Type Article en_US
Pagination 93-134 en_US
Volume Number 4 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record