Optimising unrelated parallel machine scheduling in job shops with maximum allowable tardiness limit
Kianpour, Parsa Gupta, Deepak P. Krishnan, Krishna K. Gopalakrishnan, Bhaskaran
Kianpour, Parsa
Gupta, Deepak P.
Krishnan, Krishna K.
Gopalakrishnan, Bhaskaran
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2021-03-05
Type
Article
Genre
Keywords
Earliness,Inventory cost,Job shop,Penalty cost,Scheduling,Tardiness,Unrelated parallel machines
Subjects (LCSH)
Citation
Kianpour, P., Gupta, D., Krishnan, K., & Gopalakrishnan, B. (2021). Optimising unrelated parallel machine scheduling in job shops with maximum allowable tardiness limit. International Journal of Industrial and Systems Engineering, 37(3), 359-381. doi:10.1504/IJISE.2021.113443
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.
Table of Contents
Description
Click on the DOI link to access the article (may not be free).
Publisher
Inderscience
Journal
Book Title
Series
International Journal of Industrial and Systems Engineering;Vol. 37, Iss. 3
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
1748-5037
1748-5045
1748-5045