1. Bartlett, T.E. (1957) An algorithm for the minimum number of transport units to maintain a fixed schedule. Naval Research Logistics Quarterly, 4(2), 139-149.
2. Ceder, A. (2016) Public Transit Planning and Operation: Modelling, Practice and Behaviour, second ed. CRC Press, Boca Raton, USA.
3. Ceder, A., and Stern, H.I. (1981) Deficitfunction bus scheduling with deadheading trip insertions for fleet size reduction. Transportation Science, 15(4), 338-363.
4. Gertsbach (Gertsbakh), I
1. Ceder, A. and Stern, H. (1981) Deficitfunction bus scheduling with deadheading trip insertions for fleet size reduction. Transportation Science, 15(4), 338-363.
2. Ceder, A. and Stern, H. (1985) The variable trip procedure used in the AUTOBUS vehicle scheduler. In: Rousseau, J.-M. (Ed.), Computer Scheduling of Public Transport 2. Elsevier Science, Publisher B.V., North-Holland, 371-390.
3. Day, P. R. and Ryan, D. M. (1997) Flight attendant rostering for short-haul operations. Operations Research
We consider a periodic aviation schedule which is a finite collection of flights with given arrival/departure times. For this schedule, we solve the problem of finding the minimal number of aircrafts needed to carry out the flights. The crucial role in solving this problem is played by so-called deficit function (DFs) defined as the difference between departures and arrivals on interval [0,t] for each terminal.