Home > Research > Publications & Outputs > Solving the Slot Allocation Problem with Flexib...
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

Standard

Solving the Slot Allocation Problem with Flexible Scheduling of Series of Slots. / Fairbrother, Jamie; Zografos, Konstantinos; Maher, Stephen et al.
2018. Abstract from INFORMS Annual Meeting 2018, Phoenix, Arizona, United States.

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

Harvard

APA

Vancouver

Author

Bibtex

@conference{931776f5ab05433ea2f5155c15f1c4e7,
title = "Solving the Slot Allocation Problem with Flexible Scheduling of Series of Slots",
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.",
author = "Jamie Fairbrother and Konstantinos Zografos and Stephen Maher and Glazebrook, {Kevin David}",
note = "Presentation at INFORMS Annual Meeting, 2018; INFORMS Annual Meeting 2018 ; Conference date: 04-11-2018 Through 07-11-2018",
year = "2018",
month = nov,
language = "English",
url = "http://meetings2.informs.org/wordpress/phoenix2018/",

}

RIS

TY - CONF

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

AU - Fairbrother, Jamie

AU - Zografos, Konstantinos

AU - Maher, Stephen

AU - Glazebrook, Kevin David

N1 - Presentation at INFORMS Annual Meeting, 2018

PY - 2018/11

Y1 - 2018/11

N2 - 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.

AB - 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.

M3 - Abstract

T2 - INFORMS Annual Meeting 2018

Y2 - 4 November 2018 through 7 November 2018

ER -