A genetic algorithm for flow shop scheduling problem
Date
2010-04
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper considers the problem of scheduling in flow-shop by Johnson's Algorithm method and Genetic Algorithm method to find an optimal sequence for n jobs m-machine based on minimum elapsed time. It has been shown that the method for finding an optimal sequence for n jobs, m-machine based on minimum make span using genetic algorithm provides a better result.
Description
Keywords
:Johnson's hlgoritlim, Scheduling, Flow-Shop, Gcnctic Algorithm, Optimal SC~UCI~CC