Factorial representation in scheduling problems

Kazunori Watase

International Journal of Manufacturing Technology and Management, 2009, vol. 18, issue 4, 396-408

Abstract: For problems considered difficult to solve systematically, various search methods have been developed. Such methods include Genetic Algorithms (GAs), Simulated Annealing (SA) and Taboo Search (TS). In this study, we examined applications of GA for scheduling problems, and proposed a factorial representation as the chromosome expression. The advantage of using factorial numbers to express permutations is that lethal genes are not produced by crossover or mutation. As a result of numerical experiments, the search ability of the proposed method was greater than the methods using permutations in GA. In particular, the search ability was superior to SA or TS when the average work time was different by work.

Keywords: factorial representation; GAs; genetic algorithms; flow shop scheduling. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=27773 (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:ijmtma:v:18:y:2009:i:4:p:396-408

Access Statistics for this article

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