1. N. Z. Shor, ?An approach to multitime planning,? in: Abstracts for the First All-Union Conference on Mathematical Aspects of Network Planning and Management [in Russian], Kiev (1967).
2. A. B. Barskii, ?Minimization of the number of computers to implement computational process in a given time,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6 (1968).
3. V. Zaloom, ?On the resource constrained project scheduling problem,? AIIE Trans., 3, No. 4 (1971).
4. E. B. Fernandez and T. Lang, ?Computation of lower bounds for multiprocessor schedules,? IBM J. R and D, 19, No. 5 (1975).
5. A. I. Kuksa, ?Bounds for the lengths of shortest schedules for network planning with unstorable resources,? in: Theory of Optimal Decisions [in Russian], Izd. Inst. Kibernetika Akad. Nauk Ukr. SSR, Kiev (1975).