Title :
Robustness analysis of the satisfied solution of some job-shop schedule problems
Author :
Ding, Ran ; Li, Qiqiang ; Sun, Tongjing
Author_Institution :
Sch. of Control Sci. & Eng., Shandong Univ., Jinan, China
Abstract :
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.
Keywords :
genetic algorithms; graph theory; job shop scheduling; critical path; disjunctive graph; genetic algorithm; heuristic algorithm; job-shop schedule problem; robustness analysis; Genetic algorithms; Heuristic algorithms; Job production systems; Radio access networks; Robust control; Robustness; Scheduling algorithm; Sun; Uncertainty;
Conference_Titel :
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN :
0-7803-8273-0
DOI :
10.1109/WCICA.2004.1343062
