A Hybrid Algorithm for Scheduling Problems of Flow Shop with Uncertain Processing Time

Author

Xu, Zhenhao ; Gu, Xingsheng

Author_Institution

Res. Inst. of Autom., East China Univ. of Sci. & Technol., Shanghai

Volume

1

fYear

0

fDate

0-0 0

Firstpage

3466

Lastpage

3470

Abstract

Scheduling is a very complex but important problem, and there are various uncertainties in the real production scheduling process. A fuzzy scheduling model for flow shop problems with uncertain processing time has been presented based on fuzzy programming theory, in which the uncertain processing can be dealt with by the fuzzy operators. The fuzzy model can be transformed to the optimal programming model and the worst programming model by the fuzzy cut-set. And a hybrid algorithm combining the immune algorithm with the branch and bound method is proposed to solve the model, which can avoid the blind search of the immune algorithm. Finally, simulation results have shown that the effectiveness of the fuzzy scheduling model and the high searching efficiency of the hybrid method

Keywords

artificial intelligence; flow shop scheduling; fuzzy set theory; genetic algorithms; tree searching; branch-and-bound method; flow shop scheduling; fuzzy cut-set; fuzzy programming theory; fuzzy scheduling; immune algorithm; optimal programming; production scheduling; uncertain processing time; Automation; Costs; Finishing; Fuzzy set theory; Immune system; Job shop scheduling; Mathematical model; Optimal scheduling; Scheduling algorithm; Uncertainty; Flow shop; Immune algorithm; The Branch and Bound; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1713012

Filename

1713012