Hypothesis-test based simulated annealing for stochastic flow shop scheduling

  • Liang Zhang*
  • , Ling Wang
  • , Fang Tang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationInternational Conference on Machine Learning and Cybernetics
Pages1607-1612
Number of pages6
StatePublished - 2003
Event2003 International Conference on Machine Learning and Cybernetics - Xi'an, China
Duration: 2 Nov 20035 Nov 2003

Publication series

NameInternational Conference on Machine Learning and Cybernetics
Volume3

Conference

Conference2003 International Conference on Machine Learning and Cybernetics
Country/TerritoryChina
CityXi'an
Period2/11/035/11/03

Keywords

  • Hypothesis test
  • Simulated annealing
  • Stochastic flow shop

Fingerprint

Dive into the research topics of 'Hypothesis-test based simulated annealing for stochastic flow shop scheduling'. Together they form a unique fingerprint.

Cite this