Please use this identifier to cite or link to this item:
|Title:||The workload balancing problem at air cargo terminals||Authors:||Huang, H.C.
|Keywords:||Air cargo terminal
Stochastic mixed integer linear program
|Issue Date:||Oct-2006||Citation:||Huang, H.C., Lee, C., Xu, Z. (2006-10). The workload balancing problem at air cargo terminals. OR Spectrum 28 (4) : 705-727. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-006-0035-6||Abstract:||We consider a large air cargo handling facility composed of two identical cargo terminals. In order to improve the operational efficiency, the workload must be balanced between the terminals. Thus, we must assign each airline served by the facility to one of the terminals such that (ideally): (1) each terminal has the same total workload, and (2) the workload at each terminal is distributed evenly along the timeline. Complicating the problem is that cargo loads are difficult to predict (stochastic). We develop a stochastic mixed integer linear program model in which a weighted sum of the balance measures is minimized. We employ sample average approximation for the stochastic program and develop an accelerated Benders decomposition algorithm to reduce the computational time. The proposed model can also be applied to partially reassign the airlines for the operational schedule changes. The computational results show that a small number of reassignments are often sufficient to rebalance the workload. The simulation results based on data from a large international airport show that the proposed algorithms efficiently balance the workload and the cargo service time is consistently reduced.||Source Title:||OR Spectrum||URI:||http://scholarbank.nus.edu.sg/handle/10635/63379||ISSN:||01716468||DOI:||10.1007/s00291-006-0035-6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2019
WEB OF SCIENCETM
checked on Nov 8, 2019
checked on Oct 27, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.