Title :
Hypothesis-test based simulated annealing for stochastic flow shop scheduling
Author :
Zhang, Liang ; Wang, Ling ; Tang, Fang
Author_Institution :
Dept. of Autom., Tsinghua Univ., Beijing, China
Abstract :
Stochastic flow shop scheduling problem with uncertain processing times is an important optimization problem with strong engineering background, which is of the difficulties such as inaccurate estimation of optimization objective and NP-hardness. As an effective methodology in statistics, hypothesis-test (H-T) is employed and incorporated into simulated annealing (SA) to solve the stochastic flow shop scheduling. The proposed approach not only reserves the global search ability of SA, but also can reduce too much repeated search with respect to those solutions with similar performance in statistical sense to some extend. Simulation results demonstrate the feasibility and effectiveness of the proposed method by comparison with usual SA methods.
Keywords :
computational complexity; flow shop scheduling; simulated annealing; stochastic processes; NP-hardness; hypothesis-test; optimization problem; search ability; simulated annealing; stochastic flow shop scheduling; Automation; Job shop scheduling; Physics; Simulated annealing; Single machine scheduling; Solid modeling; Space exploration; Statistics; Stochastic processes; Testing;
Conference_Titel :
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN :
0-7803-8131-9
DOI :
10.1109/ICMLC.2003.1259753