Citation
The Airport Baggage Sorting Station Allocation Problem. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 419-444, 2011.
Paper
Abstract
The appropriate assignment of airport resources can greatly affect the quality of service which airlines and airports provide to their customers. Good assignments can help airlines and airports to keep to published schedules, by minimising changes or delays waiting for resources to be free. In this paper, we consider a resource allocation problem, namely the problem of assigning available baggage sorting stations to flights which have already been scheduled. A description and model for the problem are presented, illustrating the different objectives which have to be considered. A number of constructive algorithms for sorting station allocation are then presented and their effects are compared and contrasted for different numbers of sorting station that are available. In particular, it can be observed that the appropriate algorithm selection is highly dependent upon whether reductions in service times are permitted or not and upon the flight density in relation to the number of sorting stations.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-419-444-P, author = {Amadeo Ascó and J. A. D. Atkin and E. K. Burke},
title = {The Airport Baggage Sorting Station Allocation Problem},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {419--444},
note = {Paper},
abstract = {The appropriate assignment of airport resources can greatly affect the quality of service which airlines and airports provide to their customers. Good assignments can help airlines and airports to keep to published schedules, by minimising changes or delays waiting for resources to be free. In this paper, we consider a resource allocation problem, namely the problem of assigning available baggage sorting stations to flights which have already been scheduled. A description and model for the problem are presented, illustrating the different objectives which have to be considered. A number of constructive algorithms for sorting station allocation are then presented and their effects are compared and contrasted for different numbers of sorting station that are available. In particular, it can be observed that the appropriate algorithm selection is highly dependent upon whether reductions in service times are permitted or not and upon the flight density in relation to the number of sorting stations.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-419-444-P.pdf} }