A Slot Allocation Model with Queuing Constraints based on the Server-Always-Busy Approximation

Fairbrother, Jamie and Shone, Robert and Zografos, Konstantinos and Glazebrook, Kevin David (2018) A Slot Allocation Model with Queuing Constraints based on the Server-Always-Busy Approximation. In: 60th Annual Conference of the Operational Research Society, 2018-09-112018-09-13, Lancaster University Management School.

Full text not available from this repository.

Abstract

At congested airports outside the US, airlines must obtain slots in order to land and take-off. Slots must be allocated to airlines in a way which matches their requested times as far as possible, while satisfying operational constraints. A key issue in the allocation of slots is how to construct a schedule which avoids long queuing delays. This can be addressed implicitly through the use of capacity constraints which limit the number of runway movements which can take place during a given length of time, or explicitly through the incorporation of queuing dynamics into the slot allocation model. In this work we present an approximation to queuing dynamics based on the assumption that the queue is never empty. We demonstrate how this can be used to formulate tractable mixed integer non-linear programs which could be used to set capacity limits, or could be incorporated directly into a slot allocation model.

Item Type: Contribution to Conference (Other)
Journal or Publication Title: 60th Annual Conference of the Operational Research Society
Additional Information: Presentation at OR60 conference, 2018.
Departments: Lancaster University Management School > Management Science
ID Code: 131924
Deposited By: ep_importer_pure
Deposited On: 11 Mar 2019 16:20
Refereed?: No
Published?: Published
Last Modified: 17 Jan 2020 06:08
URI: https://eprints.lancs.ac.uk/id/eprint/131924

Actions (login required)

View Item View Item