Downloads: 126
Research Paper | Mathematics | Volume 6 Issue 11, November 2017 | Pages: 776 - 781 | Iraq
Using Two Stage Hybrid Algorithm for Solving Flow-Shop Scheduling Problem
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
How to Cite?: A. M. Kadhem, "Using Two Stage Hybrid Algorithm for Solving Flow-Shop Scheduling Problem", Volume 6 Issue 11, November 2017, International Journal of Science and Research (IJSR), Pages: 776-781, https://www.ijsr.net/getabstract.php?paperid=ART20177676, DOI: https://dx.doi.org/10.21275/ART20177676