Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems

Authors:
Young Su Yun
Affiliations:
Industrial and Mechanical Engineering, School of Automotive, Taegu University, Kyungbook 712-714, South Korea
Venue:
Computers and Industrial Engineering
Year:
2002

Citing 4
Cited 3

Genetic Algorithms and Manufacturing Systems Design

Genetic Algorithms and Manufacturing Systems Design
Dynamic Control of Genetic Algorithms Using Fuzzy Logic Techniques

Proceedings of the 5th International Conference on Genetic Algorithms
A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Short Communication: An effective TPA-based algorithm for job-shop scheduling problem

Expert Systems with Applications: An International Journal
Non-identical parallel machine scheduling using genetic algorithm

Expert Systems with Applications: An International Journal
A genetic algorithm application using fuzzy processing times in non-identical parallel machine scheduling problem

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose a new genetic algorithm (GA) with fuzzy logic controller (FLC) for dealing with preemptive job-shop scheduling problems (p-JSP) and non-preemptive job-shop scheduling problems (np-JSP). The proposed algorithm considers the preemptive cases of activities among jobs under single machine scheduling problems. For these preemptive cases, we first use constraint programming and secondly develop a new gene representation method, a new crossover and mutation operators in the proposed algorithm.However, the proposed algorithm, as conventional GA, also has a weakness that takes so much time for the fine-tuning of genetic parameters. FLC can be used for regulating these parameters.In this paper, FLC is used to adaptively regulate the crossover ratio and the mutation ratio of the proposed algorithm. To prove the performance of the proposed FLC, we divide the proposed algorithm into two cases: the GA with the FLC (pro-fGA) and the GA without the FLC (pro-GA).In numerical examples, we apply the proposed algorithms to several job-shop scheduling problems and the results applied are analyzed and compared. Various experiments show that the results of pro-fGA outperform those of pro-GA.