Volume 17, Issue 1 (7-1998)                   JCME 1998, 17(1): 33-41 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

A. Memariani, G. Moslehi. A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem. JCME. 1998; 17 (1) :33-41
URL: http://jcme.iut.ac.ir/article-1-117-en.html
Abstract:   (2890 Views)
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.
Full-Text [PDF 464 kb]   (907 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 1998/07/15

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2022 CC BY-NC 4.0 | Computational Methods in Engineering

Designed & Developed by : Yektaweb