Home > Research > Publications & Outputs > Solving the Slot Allocation Problem with Flexib...

Research

Associated organisational units

View graph of relations

Solving the Slot Allocation Problem with Flexible Scheduling of Series of Slots

Research output: Contribution to conference - Without ISBN/ISSN › Abstract

Published
Publication date11/2018
<mark>Original language</mark>English
EventINFORMS Annual Meeting 2018 - Phoenix Convention Center, Phoenix, United States
Duration: 4/11/2018 → 7/11/2018
http://meetings2.informs.org/wordpress/phoenix2018/

Conference

ConferenceINFORMS Annual Meeting 2018
Country/TerritoryUnited States
CityPhoenix
Period4/11/18 → 7/11/18
Internet address

Abstract

We formulate the airport slot scheduling problem as a bi-objective integer linear problem which considers efficiency and fairness objectives and satisfies turn-around and airport capacity constraints. This model allows flexibility for the scheduling of series of slots during the scheduling season. We develop and test algorithms for solving the proposed formulation and report results regarding the computational performance of these.

Bibliographic note

Presentation at INFORMS Annual Meeting, 2018