Robustness analysis of the satisfied solution of some job-shop schedule problems

It is very important to analyze the robustness of the production schedule before it using it, because in the real world there are always various uncertainties. For a class of job-shop schedule problem, this paper studies the invariability of satisfied schedule received by some kind of heuristic algorithm when the processing times vary in some closed interval. This paper analyzes the critical jobs and the critical path of the disjunctive graph. A robustness analytical method to the satisfied schedule is given.