1. V. Ya. Burdyuk, ?Regular g-orderings and Smith functions,? Kibernetika, No. 2 (1975).
2. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
3. V. V. Martynyuk, ?On transitively equivalent directed graphs,? Kibernetika, No. 1 (1973).
4. V. S. Gordon and Ya. M. Shafranskii, ?Optimal ordering in the presence of sequence-parallel precedence constraints,? Dokl. Akad. Nauk BSSR,22 (1978).
5. M. Sh. Levin and E. V. Levner, ?On an effective solution of the Bellman?Johnson problem on a network having the form of a tree,? Avtom. Telemekh., No. 10 (1978).