A Fuzzy Heuristic Algorithm for the Flow Shop Scheduling Problem


Authors

Mehdi Heydari - Iran university of science and technology, Department of industrial engineering Emran Mohammadi - Iran university of science and technology, Department of industrial engineering


Abstract

The two-machine flow shop problem with the objective of minimizing makespan that is known as Johnson problem is now standard fundamental in the theory of scheduling. We generalize Johnson’s results for more than two machine problems, using a fuzzy heuristic algorithm. Performance of the new algorithm is analyzed with some numerical examples. To evaluate the performance of the proposed heuristic, we have used it on some small size problems and the results are compared with optimum scheduling. Notice that scheduling the problems with large sizes, is NP hard.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Mehdi Heydari, Emran Mohammadi, A Fuzzy Heuristic Algorithm for the Flow Shop Scheduling Problem, Journal of Mathematics and Computer Science, 1 (2010), no. 4, 349--354

AMA Style

Heydari Mehdi, Mohammadi Emran, A Fuzzy Heuristic Algorithm for the Flow Shop Scheduling Problem. J Math Comput SCI-JM. (2010); 1(4):349--354

Chicago/Turabian Style

Heydari, Mehdi, Mohammadi, Emran. "A Fuzzy Heuristic Algorithm for the Flow Shop Scheduling Problem." Journal of Mathematics and Computer Science, 1, no. 4 (2010): 349--354


Keywords


MSC


References