Sotskov, Y.N.

stability stability radius problem schedule radius vector solution value digraph theorem scheduling function section condition objective stability ball inequality operation processing times result scheduling problems sotskov stability analysis digraph gs point calculation processing region instance component proof number machine objective vector p solution x analysis stability radii | j *| property makespan example stability region algorithm satis ed semi-active schedules problem g ==cmax figure formula problem g cmax paper shop problem semi-active subset equality problem 7.1 radii intersection point system 0.5 interval vector p column graph complexity length ==cmax polynomial time path 2 hk intersection graph g 0 polynomial programming disjunctive salesman problem job shop problem x 2 x optimization 7.1 x ∈ x p f 2g