IDEAS home Printed from https://ideas.repec.org/a/ids/ijemec/v3y2012i1-2p22-39.html
   My bibliography  Save this article

Flexible job-shop scheduling problem by genetic algorithm and learning by partial injection of sequences

Author

Listed:
  • Asma Fekih
  • Olfa Jellouli
  • Atidel Boubaker Hadj-Alouane

Abstract

The flexible job-shop scheduling problem (FJSP) is one of the most complex problems (Meriem and Ghédira, 2004). Thus, exact methods are not effective for solving the FJSP and heuristic approaches are generally used to find near optimal solutions within reasonable computation times. In our previous works (Fekih and Jallouli, 2010), we have proposed a new approach based on genetic algorithms and the learning by injection of sequences for solving the flexible job-shop scheduling problem (FJSP) with partial or total flexibility. This approach was based on a joint resolution of the inherent assignment subproblem and the sequencing subproblem. In this paper, we develop a new structure of genetic algorithm and defined a new strategy of learning (partial injection of sequences) in order to improve the total duration of the schedule or the makespan. The proposed genetic algorithm uses a new crossover and mutation operators. We called this approach genetic algorithm with learning by partial injection of sequences (GALIS.II). Numerical experiments show that our GALIS.II algorithm is effective for solving the FJSP.

Suggested Citation

  • Asma Fekih & Olfa Jellouli & Atidel Boubaker Hadj-Alouane, 2012. "Flexible job-shop scheduling problem by genetic algorithm and learning by partial injection of sequences," International Journal of Engineering Management and Economics, Inderscience Enterprises Ltd, vol. 3(1/2), pages 22-39.
    • Handle: RePEc:ids:ijemec:v:3:y:2012:i:1/2:p:22-39
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=48603
    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:ijemec:v:3:y:2012:i:1/2:p:22-39. 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=299 .

    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.