Rendezvous optimization method for addressing long-job burst problem in industrial internet of things

Industrial Internet of Things (IIoT) cells suffer long-job bursts when arrival surges and interdependent tasks push jobs past their time limit. This article presents ROM-RS, a Rendezvous Optimization Method with rule-based Recommendation Scheduling for adaptive task scheduling and resource reallocation. ROM-RS matches a resource to a waiting task at the moment the resource is released, reallocates released resources across jobs, and applies three runtime rules that favour the jobs that can still finish within the limit. The method is evaluated on a discrete-event simulation of a CNC cell whose task types, precedence and processing times are taken from a public machining dataset, with 1,080 jobs per 8-hour shift and arrival surges, against first-come first-served dispatching, PSO- and GA-tuned priority rules and a DQN rule-selection scheduler. ROM-RS yields the lowest burst ratio of the five methods (0.125 against 0.150 for the tuned rules and 0.301 for FCFS; paired p < 0.001) with 0.25 s of computation per shift, while the tuned rules complete about 0.5% points more jobs at roughly 600 times the computation. An ablation attributes the result to the recommendation rules, the event-driven matching and the reallocation of released resources. The simulator and all outputs are deposited.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-14
DOI
https://doi.org/10.1038/s41598-026-77968-7
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

Rendezvous optimization method for addressing long-job burst problem in industrial internet of things

Abdullah Alghuried, Moahd Khaled Alghuson, Khaled Ali Abuhasel
Scientific Reports
Scheduling and Optimization Algorithms
article

Rendezvous optimization method for addressing long-job burst problem in industrial internet of things

Abdullah Alghuried, Moahd Khaled Alghuson, Khaled Ali Abuhasel
article en

Abstract

Industrial Internet of Things (IIoT) cells suffer long-job bursts when arrival surges and interdependent tasks push jobs past their time limit. This article presents ROM-RS, a Rendezvous Optimization Method with rule-based Recommendation Scheduling for adaptive task scheduling and resource reallocation. ROM-RS matches a resource to a waiting task at the moment the resource is released, reallocates released resources across jobs, and applies three runtime rules that favour the jobs that can still finish within the limit. The method is evaluated on a discrete-event simulation of a CNC cell whose task types, precedence and processing times are taken from a public machining dataset, with 1,080 jobs per 8-hour shift and arrival surges, against first-come first-served dispatching, PSO- and GA-tuned priority rules and a DQN rule-selection scheduler. ROM-RS yields the lowest burst ratio of the five methods (0.125 against 0.150 for the tuned rules and 0.301 for FCFS; paired p < 0.001) with 0.25 s of computation per shift, while the tuned rules complete about 0.5% points more jobs at roughly 600 times the computation. An ablation attributes the result to the recommendation rules, the event-driven matching and the reallocation of released resources. The simulator and all outputs are deposited.

Scientific Reports
University of Bisha (SA), University of Tabuk (SA)
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