Factorial representation in scheduling problems
by Kazunori Watase
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 18, No. 4, 2009

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.

Online publication date: Mon, 10-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com