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

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...

Full description

Bibliographic Details
Main Authors: Atıl Kurt, Ferda Can Çetinkaya
Format: Article
Language:English
Published: University of Novi Sad, Faculty of Technical Sciences 2024-03-01
Series:International Journal of Industrial Engineering and Management
Subjects:
Online Access:http://www.ijiemjournal.uns.ac.rs/images/journal/volume15/IJIEM_345.pdf