Eligibility-Aware Scheduling of Parallel Production Machines with Planned Downtime

Background. Production jobs can have different processing times across machines, and equipment qualification or tooling restrictions may limit where each job can run. Planned maintenance further constrains machine assignments and job sequences. Methods. This computational study compares three dispatching rules for minimising makespan on three unrelated parallel machines with a planned unavailability window on each machine. The rules use the same earliest-completion assignment step and differ in how they prioritise jobs. An exact subset dynamic program provides a benchmark. Sixty synthetic eightjob batches were evaluated under three downtime durations, yielding 180 batch–calendar combinations. Results. When each job had one or two eligible machines, the eligibility-first rule reduced mean relative optimality gaps from 4.80%, 13.28%, and 11.21% under the longest-job-first rule to 1.41%, 9.21%, and 7.80% for downtime durations of zero, six, and twelve time units, respectively. When jobs had two or three eligible machines, longest-job-first achieved a lower mean gap without downtime, while the two rules gave nearly equal mean gaps with downtime. Conclusion. In these generated batches, eligibility-first priority was most beneficial when machine options were scarce. The results identify a condition under which planners can compare dispatch rules against exact schedules for small production batches.

Authors

Publication Details

Journal
International Journal of Modern Science and Research Technology
Published
2026-11-15
DOI
https://doi.org/10.67317/ijmsrt26nov049
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Eligibility-Aware Scheduling of Parallel Production Machines with Planned Downtime

Adenuga Michael Ayotunde
International Journal of Modern Science and Research Technology
Scheduling and Optimization Algorithms
article

Eligibility-Aware Scheduling of Parallel Production Machines with Planned Downtime

Adenuga Michael Ayotunde
article en

Abstract

Background. Production jobs can have different processing times across machines, and equipment qualification or tooling restrictions may limit where each job can run. Planned maintenance further constrains machine assignments and job sequences. Methods. This computational study compares three dispatching rules for minimising makespan on three unrelated parallel machines with a planned unavailability window on each machine. The rules use the same earliest-completion assignment step and differ in how they prioritise jobs. An exact subset dynamic program provides a benchmark. Sixty synthetic eightjob batches were evaluated under three downtime durations, yielding 180 batch–calendar combinations. Results. When each job had one or two eligible machines, the eligibility-first rule reduced mean relative optimality gaps from 4.80%, 13.28%, and 11.21% under the longest-job-first rule to 1.41%, 9.21%, and 7.80% for downtime durations of zero, six, and twelve time units, respectively. When jobs had two or three eligible machines, longest-job-first achieved a lower mean gap without downtime, while the two rules gave nearly equal mean gaps with downtime. Conclusion. In these generated batches, eligibility-first priority was most beneficial when machine options were scarce. The results identify a condition under which planners can compare dispatch rules against exact schedules for small production batches.

International Journal of Modern Science and Research TechnologyVol. 4(11)
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon