S. I. Vasilenko U.S.S.R. Comput. Math. Math. Phys. , vol.23 No.3 , 01.1983 , p. 125-129, language: английский ISSN 0041-5553  Аннотация The author considers a certain general problem of scheduling theory involving m precessors and n jobs. The time which every processor needs to do every job is known and the minimum finish time is to be found. If one solution to this NP-complete problem is known the author presents a method for finding the stability area of the solution. The radius of the stability area is found and some of its properties are proved.  Ключевые слова scheduling; NP-complete problem; stability area of the solution