IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v15y2021i5p643-674.html
   My bibliography  Save this article

Scheduling the capacitated identical parallel machines problem: a new formulation with sequence-dependent setup costs and different due dates

Author

Listed:
  • Majid Esmaelian
  • Ahmad Sobhani
  • Hadi Shahmoradi
  • Milad Mohammadi

Abstract

This paper schedules capacitated parallel machines of a real production system by considering different quantities of production and processing times required to complete customer orders. A new mixed linear programming model is developed according to the concept of constrained vehicle routing problems to have a complete schedule for machines by determining the sequence of both jobs and idle times for each machine. The optimisation model minimises the total cost of the production system, including tardiness, earliness and sequence-dependent setup costs. A constraint programming (CP) model and a meta-heuristic hybrid algorithm are also developed to compare their results with the mixed linear programming model. The numerical findings show that the total cost estimated by the mixed integer programming model is 10%-13% better (lower) than the ones estimated by the CP model and the meta-heuristic algorithm when small instances of the scheduling problem are solved. By increasing the size of the scheduling problem, the meta-heuristic algorithm shows the best computational performance estimating 11% better (lower) total cost compared with the CP model. [Received: 14 April 2020; Accepted: 26 October 2020]

Suggested Citation

  • Majid Esmaelian & Ahmad Sobhani & Hadi Shahmoradi & Milad Mohammadi, 2021. "Scheduling the capacitated identical parallel machines problem: a new formulation with sequence-dependent setup costs and different due dates," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 15(5), pages 643-674.
    • Handle: RePEc:ids:eujine:v:15:y:2021:i:5:p:643-674
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=117337
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Soheil Azizi & Milad Mohammadi, 2023. "Strategy selection for multi-objective redundancy allocation problem in a k-out-of-n system considering the mean time to failure," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 1021-1044, June.

    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:eujine:v:15:y:2021:i:5:p:643-674. 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=210 .

    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.