Valid Inequalities for Time-indexed Formulations of the Runway Scheduling Problem
Journal article, Peer reviewed
View/ Open
Date
2016Metadata
Show full item recordCollections
- Publikasjoner fra CRIStin - SINTEF AS [5970]
- SINTEF Digital [2557]
Original version
CEUR Workshop Proceedings. 2016, 1623 787-790.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.