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

A Genetic Algorithm Approach to Parallel Machine Scheduling Problems Under Effects of Position-Dependent Learning and Linear Deterioration: Genetic Algorithm to Parallel Machine Scheduling Problems

Author

Listed:
  • Oğuzhan Ahmet Arık

    (Nuh Naci Yazgan University, Turkey)

  • Mehmet Duran Toksarı

    (Erciyes University, Turkey)

Abstract

This paper investigates parallel machine scheduling problems where the objectives are to minimize total completion times under effects of learning and deterioration. The investigated problem is in NP-hard class and solution time for finding optimal solution is extremely high. The authors suggested a genetic algorithm, a well-known and strong metaheuristic algorithm, for the problem and we generated some test problems with learning and deterioration effects. The proposed genetic algorithm is compared with another existing metaheuristic for the problem. Experimental results show that the proposed genetic algorithm yield good solutions in very short execution times and outperforms the existing metaheuristic for the problem.

Suggested Citation

  • Oğuzhan Ahmet Arık & Mehmet Duran Toksarı, 2021. "A Genetic Algorithm Approach to Parallel Machine Scheduling Problems Under Effects of Position-Dependent Learning and Linear Deterioration: Genetic Algorithm to Parallel Machine Scheduling Problems," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 12(3), pages 195-211, July.
    • Handle: RePEc:igg:jamc00:v:12:y:2021:i:3:p:195-211
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2021070109
    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:12:y:2021:i:3:p:195-211. 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.