Job Shop Problem Geometric Approach Stability Analysis
Issue Date:
2003
Publisher:
Institute of Information Theories and Applications FOI ITHEA
Abstract:
The usual assumption that the processing times of the operations are known in advance is the
strictest one in scheduling theory. This assumption essentially restricts practical aspects of deterministic
scheduling theory since it is not valid for the most processes arising in practice. The paper is devoted to a
stability analysis of an optimal schedule, which may help to extend the significance of scheduling theory for
decision-making in the real-world applications. The term stability is generally used for the phase of an
algorithm, at which an optimal solution of a problem has already been found, and additional calculations are
performed in order to study how solution optimality depends on variation of the numerical input data.