Unrelated parallel machine scheduling under machine availability and eligibility constraints to minimize the makespan of non-resumable jobs

• Published in: IJIEM. International Journal of Industrial Engineering and Management (Online) Vol. 15; no. 1; pp. 18 - 33
• Main Authors: Kurt, Atıl, Çetinkaya, Ferda Can
• Format: Journal Article
• Language: English
• Published: Novi Sad University of Novi Sad 01.03.2024; University of Novi Sad, Faculty of Technical Sciences
• Subjects: machine availability and eligibility constraints; makespan; mixed integer linear programming; non-resumable jobs; scheduling; unrelated parallel machines

This study considers the scheduling problem of multiple independent and non-resumable jobs on unrelated parallel machines subject to machine availability and eligibility constraints. For each machine, there is a maximum continuous working time due to an unavailable period required for maintenance or...