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

Parsa Kianpour, Deepak Gupta, Krishna Krishnan and Bhaskaran Gopalakrishnan

International Journal of Industrial and Systems Engineering, 2021, vol. 37, issue 3, 359-381

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.

Keywords: job shop; scheduling; unrelated parallel machines; tardiness; earliness; inventory cost; penalty cost. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=113443 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:37:y:2021:i:3:p:359-381

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().