Valid Inequalities for Time-indexed Formulations of the Runway Scheduling Problem
Journal article, Peer reviewed
MetadataShow full item record
Original versionCEUR Workshop Proceedings. 2016, 1623 787-790.
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.