DocumentCode
2135210
Title
A new approach to two-machine flow shop problem with uncertain processing time
Author
Petrovic, Sanja ; Song, Xueyan
Author_Institution
Sch. of Comput. Sci. & IT, Nottingham Univ.
fYear
2003
fDate
24-24 Sept. 2003
Firstpage
110
Lastpage
115
Abstract
We make an improvement on McCahon and Lee´s algorithm for two-machine flow shop problem with uncertain processing time represented with fuzzy number. Especially, the scheme used in McCahon and Lee´s algorithm for ranking fuzzy processing times is modified to calculate better the minimum makespan. Example and extensive simulation results are presented to show the improved performance on finding optimal job sequence. Analytical results are also provided to show the effectiveness of our algorithm
Keywords
computational complexity; flow shop scheduling; fuzzy set theory; uncertainty handling; Lee algorithm; McCahon algorithm; fuzzy number; fuzzy processing time; optimal job sequence; two-machine flow shop problem; uncertain processing time; Algorithm design and analysis; Cause effect analysis; Computer science; Fuzzy sets; Job shop scheduling; Uncertainty; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Uncertainty Modeling and Analysis, 2003. ISUMA 2003. Fourth International Symposium on
Conference_Location
College Park, MD
Print_ISBN
0-7695-1997-0
Type
conf
DOI
10.1109/ISUMA.2003.1236149
Filename
1236149
Link To Document