Research Paper | Mathematics | Iraq | Volume 6 Issue 11, November 2017
Using Two Stage Hybrid Algorithm for Solving Flow-Shop Scheduling Problem
A. M. Kadhem
Abstract: The permutation flow shop scheduling is a well-known combinatorial optimization problem that have been widely used and many methods have been used to solve this issue because of their widespread use in the business life market. We reject some hybrid methods in solving these issues by generating a range of issues of different sizes. this paper presents a study on using Ant Colony Optimization (ACO), Genetic algorithm (GA) and their combinations (ACO+GA and GA+ACO) to tackle the FSSP. The computation results show that the two-stage algorithms are able to achieve better results in most cases than ACO and GA individually on the FSSP. The proposed two-stage algorithms and visual layout design system provide an effective tool to solve the practical FSSP.
Keywords: Permutation flow shop scheduling, Ant Colony Optimization, Genetic algorithm, Two stage Algorithm
Edition: Volume 6 Issue 11, November 2017,
Pages: 776 - 781
How to Cite this Article?
A. M. Kadhem, "Using Two Stage Hybrid Algorithm for Solving Flow-Shop Scheduling Problem", International Journal of Science and Research (IJSR), https://www.ijsr.net/get_abstract.php?paper_id=ART20177676, Volume 6 Issue 11, November 2017, 776 - 781, #ijsrnet
How to Share this Article?
Similar Articles with Keyword 'Genetic algorithm'
A New Model of Genetic Algorithm Using a Bipartite Graph and the Action of Largest Subgroup of Dihedral Group Dn on Invariance Markov Basis, n is a Multiple of 6
Hybrid Crossover - Mutation Pair for Genetic Algorithm in Solving Fuzzy Shortest Path Problem - Predominant and Subordinate Ants
V. Anusuya | R. Kavitha