A combination of shuffled frog leaping and fuzzy logic for Flexible Job-Shop Scheduling Problems

14Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

Flexible Job-Shop Scheduling Problem (FJSP) is a well known NP-hard combinatorial optimization problem. Over the last decade, many algorithms have been proposed to tackle FJSP. Evolutionary algorithms, which solve problems by mimicking the process of natural evolution, are the most widely used techniques in solving FJSP. This paper proposes a novel evolutionary algorithm that integrates the concept of a fuzzy logic into Shuffled Frog Leaping Algorithm. In the proposed SFLA-FS model, the fuzzy roulette wheel selection is used in selecting frogs to form a sub-memeplex. This selection method is proved to be better than the typically used rank selection. The objective of this research is to find a schedule for each of the 10 benchmark problems that minimize their makespan. The experimental results obtained from SFLA-FS show that the SFLA-FS is very efficient for all tested problems. © 2011 Published by Elsevier Ltd.

Cite

CITATION STYLE

APA

Teekeng, W., & Thammano, A. (2011). A combination of shuffled frog leaping and fuzzy logic for Flexible Job-Shop Scheduling Problems. In Procedia Computer Science (Vol. 6, pp. 69–75). Elsevier B.V. https://doi.org/10.1016/j.procs.2011.08.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free