by Bräsel, H., Sotskov, Yu. N., Werner, F..
Series: 1996-03, Preprints
This paper is devoted to the calculation of the stability radius of
an optimal schedule for a general shop scheduling problem, where the
objective is to minimize mean flow time. The stability raduis denotes
the largest quantity of independent variations of the processing times
of the operations such that an optimal schedule of the problem remains
optimal. We derive formulas for calculating the stability radius, and
necessary and sufficient conditions when it is equal to zero. Moreover,
computational results on the calculation of the stability radius for
randomly generated job shop scheduling problems are discussed
Optimal schedule, Disjunctive graph, Stability
This paper was published in:
Mathematical and Computer Modelling, Vol. 24, 1996, 39 - 56.