Improved heuristically guided genetic algorithm for the flow shop scheduling problem

Dipak Laha and Purnendu Mandal

International Journal of Services and Operations Management, 2007, vol. 3, issue 3, 316-331

Abstract: This paper deals with the problem of scheduling on makespan criterion in the flow shop environment. We have presented a new heuristic genetic algorithm (NGA) that combines the good features of both the genetic algorithms and heuristic search. The NGA is run on a large number of problems and its performance is compared with that of the Standard Genetic Algorithm (SGA) and the well-known Nawaz-Enscore-Ham (NEH) heuristic. The NGA is seen to perform better in almost all instances. The complexity of the NGA is found to be better than that of the SGA. The NGA also performs superior results when compared with the simulated annealing from the literature.

Keywords: flow shop scheduling; genetic algorithms; GA; simulated annealing; SA; Nawaz-Enscore-Ham heuristic; NEH; heuristics; makespan criterion. (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=13095 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:3:y:2007:i:3:p:316-331

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().