A batch scheduling model on unrelated parallel machines with resource constraints and sequence-dependent setup time to minimize total actual flow time

Findings: The proposed algorithm achieves an average efficiency of 99.32% compared to the enumeration algorithm, with minimal deviation (0.4%). The results validate the main proposition for efficient scheduling, including prioritizing jobs based on due dates, allocating job demands based on machine...

Descripció completa

Dades bibliogràfiques

Autors principals:	Rinto Yusriski, Andri Rachmat Kumalasian Nasution, Mohammad Mi’radj Isnaini, Abdul Hakim Halim
Format:	Artigo
Idioma:	Inglês
Publicat:	OmniaScience 2026-02-01
Col·lecció:	Journal of Industrial Engineering and Management
Matèries:	batch scheduling, unrelated parallel machine, total actual flow time, sequence-dependent setup, resource constraints
Accés en línia:	https://www.jiem.org/index.php/jiem/article/view/8710
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!