IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v34y2019i3p339-368.html
   My bibliography  Save this article

Preemptive just-in-time scheduling problem on uniform parallel machines with time-dependent learning effect and release dates

Author

Listed:
  • Keyvan Shokoufi
  • Javad Rezaeian
  • Babak Shirazi
  • Iraj Mahdavi

Abstract

This paper considers uniform parallel machines scheduling problem with time-dependent learning effects, release dates, allowable preemption and machine idle time to minimise the total weighted earliness and tardiness penalties which is known to be strongly NP-hard. To solve this problem, this research proposes a mixed integer nonlinear programming (MINLP) model. Afterward, in order to find the best solution in an effective solution space, a dominant set is proposed for the length of the schedule experimentally. Also, based on the allowable idle time, a new time-dependent learning model on parallel machines is proposed. Furthermore, a genetic algorithm (GA) and a hybrid of genetic algorithm and particle swarm optimisation (HGA-PSO) are proposed. Taguchi method is applied to calibrate the parameters of the proposed algorithms. Finally, the computational results are provided to compare the results of the algorithms. Then, the efficiency of the proposed algorithms is discussed.

Suggested Citation

  • Keyvan Shokoufi & Javad Rezaeian & Babak Shirazi & Iraj Mahdavi, 2019. "Preemptive just-in-time scheduling problem on uniform parallel machines with time-dependent learning effect and release dates," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 34(3), pages 339-368.
    • Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:339-368
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=98311
    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:ijores:v:34:y:2019:i:3:p:339-368. 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=170 .

    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.