To main content

Valid inequalities for time-indexed formulations of the runway scheduling problem

Abstract

The problem of sequencing and scheduling airplanes landing and
taking off on a runway is under consideration. We propose a new family of valid
inequalities which are obtained from the study of the single machine scheduling
problem polytope.
Read publication

Category

Academic article

Language

English

Author(s)

Affiliation

  • Italy
  • SINTEF Digital / Mathematics and Cybernetics
  • Russia

Year

2016

Published in

CEUR Workshop Proceedings

ISSN

1613-0073

Volume

1623

Page(s)

787 - 790

View this publication at Cristin