Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time by taking advantage of fuzzy mathematics. This method is based on the behavior of the decision maker who can make either pessimistic or the most likely decisions. The algorithm includes proper relations and corresponding results.
A. Memariani, , & G. Moslehi, (1998). A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem. Journal of Advanced Materials in Engineering (Esteghlal), 17(1), 33-41.
MLA
A. Memariani; G. Moslehi. "A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem", Journal of Advanced Materials in Engineering (Esteghlal), 17, 1, 1998, 33-41.
HARVARD
A. Memariani, , G. Moslehi, (1998). 'A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem', Journal of Advanced Materials in Engineering (Esteghlal), 17(1), pp. 33-41.
VANCOUVER
A. Memariani, , G. Moslehi, A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem. Journal of Advanced Materials in Engineering (Esteghlal), 1998; 17(1): 33-41.
', './data/jame/coversheet/cover_en.jpg'))