The aircraft landing problem with aircraft classes
We consider the problem to sequence aircraft landings. Each aircraft belongs to a certain class and has a designated target time. Deviation of target time and actual landing time incurs a penalty according to a piece-wise linear convex penalty function. Landings must be separated by a minimum timespan. We focus on the setting where aircraft of the same classes differ only by their target time. We provide basic ideas of polynomial time algorithms for problems with a fixed number of classes and a fixed number of runways and corresponding special cases.