1. Tanaev, V.S., Gordon, V.S., and Shafranskii, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Theory of Schedules. One-stage Systems), Moscow: Nauka, 1984.
2. Barskii, A.B., Parallel?nye protsessy v vychislitel?nykh sistemakh. Planirovanie i organizatsiya (Parallel Processes in Computer Systems. Planning and Organization), Moscow: Radio i Svyaz?, 1990.
3. Federgruen, A. and Groenevelt, H., Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Technique, Manag. Sci., 1986, vol. 32, no. 3, pp. 812?829.
4. Minoux, M., Programmation math�matique. Th�orie et algorithms, Paris: Dunod, 1989. Translated under the title Matematicheskoe programmirovanie, Moscow: Nauka, 1990.
5. Vaidya, P.M., Speeding up Linear Programming Using Fast Matrix Multiplication, in Proc. 30th Ann. Sympos. Foundations Comput. Sci., 1989, pp. 332?337.