IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v37y2021i3p359-381.html
   My bibliography  Save this article

Optimising unrelated parallel machine scheduling in job shops with maximum allowable tardiness limit

Author

Listed:
  • Parsa Kianpour
  • Deepak Gupta
  • Krishna Krishnan
  • Bhaskaran Gopalakrishnan

Abstract

Motivated by the practical scheduling problem of job shops, this study evaluates unrelated parallel machine scheduling models. The researchers proposed a new mixed integer linear programming model considering effects of maximum limit on the allowable tardiness. An efficient solution technique was developed in MATLAB to minimise computational time. The model was validated using real-life data from local aircraft industry. It was shown that the proposed model leads to lower cost compared to the current models (i.e., without any limit on tardiness) in the literature. In addition, reduction in computational time enables corporate scheduling staff to use the model efficiently.

Suggested Citation

  • Parsa Kianpour & Deepak Gupta & Krishna Krishnan & Bhaskaran Gopalakrishnan, 2021. "Optimising unrelated parallel machine scheduling in job shops with maximum allowable tardiness limit," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 37(3), pages 359-381.
    • Handle: RePEc:ids:ijisen:v:37:y:2021:i:3:p:359-381
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=113443
    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:ijisen:v:37:y:2021:i:3:p:359-381. 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=188 .

    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.