Scheduling in Industry 4.0: A Digital Twin-based approach for scheduling and smart Material-Handling Considerations
Bibliographic record
Abstract
Smart manufacturing constitutes the backbone of Industry 4.0 (I4.0), allowing for heightened autonomy of the various interacting cyber-physical systems on the production floor. Connectivity, a vital enabler, plays a crucial role through state-of-the-art Digital Twin (DT) technologies driven by underlying innovations like the industrial Internet of Things, Cloud Computing, and advancements in sensory devices. In this article, it is argued that a pre-DT optimal approach employing queuing aspects of the machine buffers can play a crucial role in optimally determining the baseline schedules for the shop as well as a few related system-design aspects vis-à-vis the size of the utilized fleet of smart Automated Guided Vehicles (sAGVs) and the employed buffer capacities. sAGVs are autonomous vehicles used for material transportation between machines, reducing manual handling and improving efficiency. Initial dispatching rules for the sAGVs are also determined at that stage. Such initially produced schedules and sAGV dispatching rules are constantly revisited, though, later in the development lifecycle of the manufacturing system at the DT level, according to the undertaking disruptions on the shop floor. At that DT stage, other operational aspects pertaining to the material handling system, namely, aisle directionality, mobile modular buffers, and input/output points of the work centers, are adjusted. The employed two-stage planning framework, integrating both Pre-DT and full-scale DT planning, aims to optimize aspects of the system from the design phase to its real-time operations, employing a novel methodology leveraging mathematical programming, queuing models, and deep learning. A key finding of this study is that dynamically adjusting aisle directionality, rerouting AGVs through alternative paths, and deploying modular mobile buffers while optimizing job scheduling significantly reduce transportation time, minimize delays, and enhance real-time adaptability. The proposed framework effectively mitigates disruptions, achieving 100% elimination of machine failure impact, a 33% reduction in aisle congestion delays, and a 37% decrease in buffer overflow delays, demonstrating notable improvements in system performance and resilience.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".