Minimizing total actual flow time for multi-job batch scheduling on identical machines with a common due date
An International Journal of Optimization and Control: Theories & Applications (IJOCTA) · 08.07.2026 · 16 (4) · 1586
DOI: 10.36922/ijocta026140054 ↗Kurz gefasst
Fachartikel in der Zeitschrift An International Journal of Optimization and Control: Theories & Applications (IJOCTA), online erschienen am 08.07.2026. Verfasst von Rinto Yusriski und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Batch-processing on identical parallel machines is widely used in discrete manufacturing to reduce setup frequency and maintain coordinated material flow. This paper studies a discrete multi-job batch scheduling problem with job-dependent setup times and the objective of minimizing total actual flow time. Several jobs with integer demands must be assigned to parallel machines and completed by a single common due date. The scheduling decisions include assigning jobs to machines, determining the number and batch sizes, and sequencing the resulting batches under a backward just-in-time scheduling approach. An exact Branch-and-Bound (B&B) algorithm is developed for this problem. Feasible solutions are evaluated using a backwards-packed scheduling procedure, while horizon-based feasibility screening and an allocation-level lower bound are used to prune the search tree. A numerical example and computational experiments show that the algorithm can find globally optimal solutions for small- to medium-sized cases. This makes the proposed B&B a useful exact benchmark for future heuristic development.
Zitieren
APA
Yusriski, R., Nasution, A. R. K., & Suhaimi, M. A. (2026). Minimizing total actual flow time for multi-job batch scheduling on identical machines with a common due date. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 16(4), 1586. https://doi.org/10.36922/ijocta026140054
Vancouver
Yusriski R, Nasution ARK, Suhaimi MA. Minimizing total actual flow time for multi-job batch scheduling on identical machines with a common due date. An International Journal of Optimization and Control: Theories & Applications (IJOCTA). 2026;16(4):1586. doi:10.36922/ijocta026140054
BibTeX
@article{Yusriski2026,
author = {Yusriski, Rinto and Nasution, Andri Rachmat Kumalasian and Suhaimi, Mohd Azlan},
title = {Minimizing total actual flow time for multi-job batch scheduling on identical machines with a common due date},
journal = {An International Journal of Optimization and Control: Theories & Applications (IJOCTA)},
year = {2026},
volume = {16},
number = {4},
pages = {1586},
doi = {10.36922/ijocta026140054}
}
EUVIMED