Information Utilization Strategies Integration-Enhanced Rule Decision Framework for Rule-Based Real-Time Scheduling in Make-to-Order Flexible Job Shops

In make-to-order (MTO) flexible job shops, frequent and dynamic job arrivals place stringent demands on the real-time responsiveness of scheduling systems. Dispatching rules are widely used in real-time scheduling because they can generate decisions within milliseconds, but their performance depends strongly on how information is utilized at decision time. Using more up-to-date job shop information improves information timeliness, whereas incorporating information on the predictable release times of subsequent operations of unfinished jobs improves information completeness. However, the conventional assign-then-sequence (A-T-S) decision framework fixes machine-assignment decisions too early, making it difficult to combine forward-looking reservation with real-time revision. This paper proposes an information-utilization-enhanced rule decision framework for MTO flexible job shops. A sequence-then-assign (S-T-A) decision framework is developed to reorganize the timing and order of rule decisions, allowing predictive information on subsequent operations to be incorporated into the real-time decision scope. Because such forward-looking reservation may create machine idleness, a gap-filling mechanism is introduced to insert other processable operations into available idle intervals. Moreover, since the expanded information scope enlarges the rule element set and search space, multiple crossover operators are embedded in a gene expression programming (GEP) based rule-mining procedure to improve rule quality and search efficiency. Simulation experiments under six shop configurations show that the proposed framework achieves the lowest best-found and mean makespan values in all scenarios. In terms of mean makespan, the proposed framework reduces the value by 2.09–5.87% relative to the timeliness-enhancement-only variant and by 6.35–9.82% relative to the completeness-enhancement-only variant.

Authors

Institutions

Publication Details

Journal
Machines
Published
2026-10-14
DOI
https://doi.org/10.3390/machines14101191
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Information Utilization Strategies Integration-Enhanced Rule Decision Framework for Rule-Based Real-Time Scheduling in Make-to-Order Flexible Job Shops

Shuo Zhu, Xin Chen, Zhigang Jiang, Jie Yang et al.
Machines
Scheduling and Optimization Algorithms
article

Information Utilization Strategies Integration-Enhanced Rule Decision Framework for Rule-Based Real-Time Scheduling in Make-to-Order Flexible Job Shops

Shuo Zhu, Xin Chen, Zhigang Jiang, Jie Yang, Yanan Wang
article en

Abstract

In make-to-order (MTO) flexible job shops, frequent and dynamic job arrivals place stringent demands on the real-time responsiveness of scheduling systems. Dispatching rules are widely used in real-time scheduling because they can generate decisions within milliseconds, but their performance depends strongly on how information is utilized at decision time. Using more up-to-date job shop information improves information timeliness, whereas incorporating information on the predictable release times of subsequent operations of unfinished jobs improves information completeness. However, the conventional assign-then-sequence (A-T-S) decision framework fixes machine-assignment decisions too early, making it difficult to combine forward-looking reservation with real-time revision. This paper proposes an information-utilization-enhanced rule decision framework for MTO flexible job shops. A sequence-then-assign (S-T-A) decision framework is developed to reorganize the timing and order of rule decisions, allowing predictive information on subsequent operations to be incorporated into the real-time decision scope. Because such forward-looking reservation may create machine idleness, a gap-filling mechanism is introduced to insert other processable operations into available idle intervals. Moreover, since the expanded information scope enlarges the rule element set and search space, multiple crossover operators are embedded in a gene expression programming (GEP) based rule-mining procedure to improve rule quality and search efficiency. Simulation experiments under six shop configurations show that the proposed framework achieves the lowest best-found and mean makespan values in all scenarios. In terms of mean makespan, the proposed framework reduces the value by 2.09–5.87% relative to the timeliness-enhancement-only variant and by 6.35–9.82% relative to the completeness-enhancement-only variant.

MachinesVol. 14(10)
Deakin University (AU), Wuhan University of Science and Technology (CN), Wuhan Institute of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 13%
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.