A GREEDY ALGORITHM FOR MULTIOBJECTIVE FUZZY FLOW-SHOP SCHEDULING PROBLEM

ENGİN O., Yilmaz M. K., Akkoyunlu M. C., BAYSAL M. E., SARUCAN A.

10th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science (FLINS), İstanbul, Turkey, 26 - 29 August 2012, vol.7, pp.189-194, (Full Text) identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 7
  • City: İstanbul
  • Country: Turkey
  • Page Numbers: pp.189-194
  • Kocaeli University Affiliated: Yes

Abstract

In this paper, a new greedy algorithm is proposed to solve the fuzzy multiobjective flow shop scheduling problem. We use the two approaches; the possibility measure and the area of intersection for multi objective fuzzy flow shop scheduling problem. The proposed new greedy algorithm is tested on the benchmark problems in the literature. The performance parameters of proposed greedy algorithm are determined by full factorial design of experiments (DOE). The performance of the proposed greedy algorithm is compared with the scatter search method.