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.