1. H. Bräsel, Yu. N. Sotskov, and F. Werner, Stability of a schedule minimizing mean flow time, Math. Comput. Modell. (to appear).
2. P. Chretienne, E.G. Coffman, J.K. Lenstra, and Z. Liu, (eds), 1995, Scheduling Theory and its Applications, John Wiley Sons, New York, NY.
3. H. Fisher, and M.L. Thompson, 1963, Probabilistic learning combinations of local job-shop scheduling rules, in: Industrial Scheduling; Muth, J.F. and Thompson, G.L. (eds.), Prentice-Hall, Englewood Cliffs, 225 - 251.
4. E.N. Gordeev, 1987, Algorithms of polynomial complexity for computing the stability radius in two classes of trajectory problems, U.S.S.R. Comput. Maths. Math. Phys., 27, 14 - 20.
5. E.N. Gordeev, 1989, Solution stability of the shortest path problem, Discrete Math, 1, 45 - 56 (in Russian).