DMCA
A new approach on two-machine flow shop problem with uncertain processing time (2003)
| Venue: | University of Maryland, College Park, USA |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Petrovic03anew,
author = {Sanja Petrovic and Xueyan Song},
title = {A new approach on two-machine flow shop problem with uncertain processing time},
booktitle = {University of Maryland, College Park, USA},
year = {2003},
pages = {110--115}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper deals with the problem of optimization of job sequence in a two-machine flow shop problem in the presence of uncertainty. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. A new optimization algorithm based on Johnson’s algorithm for deterministic processing times and on an improvement of McCahon & Lee’s algorithm is developed and presented. In order to compare fuzzy processing times, McCahon and Lee use mean values of their corresponding fuzzy sets. It is shown that this approach cannot fully explore possible relationships between fuzzy sets. In order to overcome this drawback we consider different fuzzy sets determined by �-cuts of the fuzzy processing times. Extensive experiments show that the new algorithm gives better solutions with respect to makespan than existing McCahon and Lee’s algorithm. 1.
Keyphrases
two-machine flow shop problem new approach uncertain processing time fuzzy processing time job sequence possible relationship fuzzy set mccahon lee algorithm johnson algorithm corresponding fuzzy set deterministic processing time new algorithm triangular fuzzy set different fuzzy set new optimization algorithm mean value processing time extensive experiment approach cannot
