The Multicommodity Multiperiod Assignment Problem 11: Theoretical Results

Show simple item record

contributor.author El Nidani, M. Asaad en_US
contributor.author Aronson, Jay E. en_US
date.accessioned 2009-11-25T12:43:38Z en_US
date.available 2009-11-25T12:43:38Z en_US
date.issued 1996 en_US
identifier.citation Journal of Administrative Sciences and Economics, 1996, Vol. 7, Pages 31-51. en_US
identifier.uri http://hdl.handle.net/10576/6924 en_US
description.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 of 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 focus on the special characteristics and properties of noninteger solutions to the linear programming relaxation of the multicommodity, multiperiod assignment problem. The propositions highlight special conditions that must be present for any solution to the problem to be fractional, basic and fesible. en_US
language.iso en en_US
publisher Qatar University en_US
subject Economics en_US
title The Multicommodity Multiperiod Assignment Problem 11: Theoretical Results en_US
type Article en_US
identifier.pagination 31-51 en_US
identifier.volume 7 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record