1. Sotskov, Yu.N. Teoriya raspisanii. Sistemy s neopredelennymi chislovymi parametrami / Yu.N. Sotskov, N.Yu. Sotskova. - Minsk: OIPI NAN Belarusi, 2004. - 290 c.
2. Tanaev, V.S. Teoriya raspisanii. Odnostadiinye sistemy / V.S. Tanaev, V.S. Gordon, Ya.M. Shafranskii. - M.: Nauka, 1984. - 382 c.
3. Tanaev, V.S. Teoriya raspisanii. Mnogostadiinye sistemy / V.S. Tanaev, Yu.N. Sotskov, V.A. Strusevich. - M.: Nauka, 1989. - 328 c.
4. Novak, B.V. Taim-menedzhment na komp'yutere. Kak upravlyat' svoim vremenem effektivno? / B.V. Novak. - SPb.: Piter, 2007. - 128 s.
5. Dontsov, D.A. 150 luchshikh programm dlya ofisa / D.A. Dontsov. - SPb.: Piter, 2006. - 336 s.
6. Villet, E. Office XP. Bibliya pol'zovatelya / E. Villet, S. Kammigs. - M.: Vil'yams, 2002. - 848 s.
7. Birn, R. Sozdanie prilozhenii s pomoshch'yu Microsoft Outlook. Versiya 2002 / R. Birn. - M.: SP EKOM, 2003. - 928 s.
8. Marmel, E. Microsoft Project 2002. Bibliya pol'zovatelya / E. Marmel. - M.: Vil'yams, 2003. - 624 s.
9. Tanaev, V.S. Teoriya raspisanii. Gruppovye tekhnologii / V.S. Tanaev, M.Ya. Kovalev, Ya.M. Shafranskii. - Minsk: OIPI NAN Belarusi, 1998. - 290 c.
10. Optimization and approximation in deterministic sequencing and scheduling. A survey / R.L. Graham [et al.] // Annals of Discrete Mathematics. - 1979. - Vol. 5. - P. 287-326.
11. Braun, O. Optimality of Jackson’s permutations with respect to limited machine availability / O. Braun, N.M. Leshchenko, Yu.N. Sotskov // International Transactions in Operational Research. - 2006. - Vol. 13. - P. 59-74.
12. Geri, M. Vychislitel'nye mashiny i trudnoreshaemye zadachi / M. Geri, D. Dzhon-son. - M.: Mir, 1982. - 416 c.
13. Jackson, J.R. An extension of Johnson’s results on job lot scheduling / J.R. Jackson // Naval Research Logistic Quarterly. - 1956. - Vol. 3, № 3. - P. 201-203.
14. Leshchenko, N.M. Optimal'noe po bystrodeistviyu obsluzhivanie konfliktnykh trebovanii s nefiksirovannymi dlitel'nostyami / N.M. Leshchenko, Yu.N. Sotskov // Vestsi NAN Belarusi. Ser. fiz.-mat. navuk. - 2006. - № 4. - S. 103-110.
15. Egorova, N.G. Vybor optimal'nogo poryadka obsluzhivaniya trebovanii dvumya priborami v protsesse realizatsii raspisaniya / N.G. Egorova, N.M. Matveichuk, Yu.N. Sotskov // Vestsi NAN Belarusi. Ser. fiz.-mat. navuk. - 2006. - № 5. - S. 20-24.
16. Leschenko, N.M. A dominant schedule for the uncertain two-machine shop-scheduling problem / N.M. Leschenko, Yu.N. Sotskov // Proc. of XII International Conference «Knowledge-Dialogue-Solution». - Varna, Bulgaria, 2006. - P. 291-297.
17. Leschenko, N.M. Realization of an optimal schedule for the two-machine flow-shop with
18. interval job processing times / N.M. Leschenko, Yu.N. Sotskov // International Journal «Information Theories & Applications». - 2007. - Vol. 14. - P. 182-189.
19. Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length / Yu.N. Sotskov [et al.] // International Journal of Operations Research. (To appear.)
20. Sotskov, Yu.N. Minimizatsiya vzveshennoi summy momentov zaversheniya obsluzhivaniya odnim priborom trebovanii s interval'nymi dlitel'nostyami / Yu.N. Sotskov, N.G. Egorova // Materialy VIII Mezhdunar. nauch. konf. «Problemy prognozirovaniya i gosudarstvennogo regulirovaniya sotsial'no-ekonomicheskogo razvitiya». - Minsk, 2007. - T. 4. - P. 111-114.
Email this article 