IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v4y2013i2p17-30.html
   My bibliography  Save this article

A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources

Author

Listed:
  • Fayçal Belkaid

    (Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria)

  • Zaki Sari

    (Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria)

  • Mehdi Souier

    (Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria, & Tlemcen Preparatory School of Economics, Tlemcen, Algeria)

Abstract

In this paper, the authors’ interest is focused on the scheduling problem on identical parallel machines with consumable resources in order to minimize the makespan criterion. Each job consumes several components which arrive at different times. The arrival of each component is represented by a curve-shaped staircase. This problem is NP-hard, further, there are not universal methods making it possible to solve all the cases effectively, especially for medium or large instances. A genetic algorithm is proposed to solve this problem due to proven great performance in solving combinatorial optimization problems. To check its effectiveness this algorithm is compared with an exact resolution method which enumerates all possible solutions for small instances and with a heuristic for large instances. Various randomly generated instances, which can represent realistic situations, are tested. The computation results show that this algorithm outperforms heuristic procedure and is tailored for larger scale problems.

Suggested Citation

  • Fayçal Belkaid & Zaki Sari & Mehdi Souier, 2013. "A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 4(2), pages 17-30, April.
    • Handle: RePEc:igg:jamc00:v:4:y:2013:i:2:p:17-30
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2013040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:4:y:2013:i:2:p:17-30. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.