STABILITY OF AN OPTIMAL SCHEDULE

This paper deals with the problem of optimal scheduling n uninterrupted operations on m machines with respect to a regular criterion. The stability radius rho(s)(ABAR) for an optimal schedule SBAR relative to the changes in the vector ABAR = (a1,..., a(n)) of durations of operations Q = {1,..., n} is studied. The problem of calculating rho(s)(ABAR) is reduced to the solution of a non-linear mathematical programming problem. The necessary and sufficient conditions for rho(s)(ABAR) > 0 and for rho(s)(ABAR) = infinity are given in the case when SBAR is the optimal makespan schedule.