IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v18y2009i4p396-408.html
   My bibliography  Save this article

Factorial representation in scheduling problems

Author

Listed:
  • Kazunori Watase

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.

Suggested Citation

  • Kazunori Watase, 2009. "Factorial representation in scheduling problems," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 18(4), pages 396-408.
    • Handle: RePEc:ids:ijmtma:v:18:y:2009:i:4:p:396-408
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=27773
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmtma:v:18:y:2009:i:4:p:396-408. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.