Eliminating redundant columns in continuous tour scheduling problems
This paper presents a procedure for eliminating redundant columns in generalized set-covering formulations (GSCFs) of continuous tour scheduling problems that are characterized by labor requirements of zero in some planning periods. We describe the procedure and discuss properties of certain scheduling environments that may affect the appropriateness of its use. The procedure was applied to actual labor requirements and problem characteristics associated with 27 United Airlines Airport Stations and reduced the number of columns (tours) by an average of 56%.
scheduling theory mathematical programming