In the following we will proof NP-hardness for ALP1. For this
purpose we show how to transform instances of the 3-Partition
problem to aircraft landing. 3-Partition is well-known to be NPhard
in the strong sense (see Garey & Johnson, 1979) and can be
summarized as follows:ard
in the strong sense as is shown in the following section.