Network-Aware Smart Scheduling for Semi-Automated Ceramic Production via Improved Discrete Hippopotamus Optimization
Bibliographic record
Abstract
The increasing integration of automation and intelligent sensing technologies in daily-use ceramic manufacturing poses new challenges for efficient scheduling under hybrid flow-shop and shared-kiln constraints. To address these challenges, this study proposes a Mixed-Integer Linear Programming (MILP) model and an Improved Discrete Hippopotamus Optimization (IDHO) algorithm designed for smart, network-aware production environments. The MILP formulation captures key practical features such as batch processing, no-idle kiln constraints, and machine re-entry dynamics. The IDHO algorithm enhances global search performance via segment-based encoding, nonlinear population reduction, and operation-specific mutation strategies, while a parallel evaluation framework accelerates computational efficiency, making the solution viable for industrial-scale, time-sensitive scenarios. The experimental results from 12 benchmark cases demonstrate that IDHO achieves superior performance over six representative metaheuristics (e.g., PSO, GWO, Jaya, DBO), with an average ARPD of 1.04%, statistically significant improvements (p < 0.05), and large effect sizes (Cohen’s d > 0.8). Compared to the commercial solver CPLEX, IDHO provides near-optimal results with substantially lower runtime. The proposed approach contributes to the development of intelligent networked scheduling systems for cyber-physical manufacturing environments, enabling responsive, scalable, and data-driven optimization in smart sensing-enabled production settings.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".