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

Authors: Parsa Kianpour; Deepak Gupta; Krishna Krishnan; Bhaskaran Gopalakrishnan

Addresses: Department of Industrial, Systems, and Manufacturing Engineering, Wichita State University, Wichita, KS, USA ' Department of Industrial, Systems, and Manufacturing Engineering, Wichita State University, Wichita, KS, USA ' Department of Industrial, Systems, and Manufacturing Engineering, Wichita State University, Wichita, KS, USA ' Benjamin M. Statler College of Engineering and Mineral Resources, West Virginia University, Morgantown, WV, USA

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.

DOI: 10.1504/IJISE.2021.113443

International Journal of Industrial and Systems Engineering, 2021 Vol.37 No.3, pp.359 - 381

Received: 15 Feb 2019
Accepted: 15 Jun 2019
Published online: 05 Mar 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article