DocumentCode
401701
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
Volume
3
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
1607
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1259753
Filename
1259753
Link To Document