An Adaptive Mutation Harris Hawk Optimization algorithm achieved a best completion makespan of 56.45 hours and an average makespan of 56.70 hours in scheduling tests for small-batch coke manufacturing, researchers reported in Cluster Computing. The computational method recorded the lowest average completion time alongside the lowest variability among all evaluated algorithms on an enterprise dataset. According to the research team, these experimental results demonstrate that the optimization model delivers an effective and stable method for managing finite-cycle, small-batch coke production workflows.
The scheduling framework was developed to resolve complex operational bottlenecks in coking hybrid flow workshops. Coke represents an essential industrial raw material closely related to national economic development, but manufacturing facilities face operational bottlenecks caused by diversified product specifications, fluctuating market orders, and customized small-batch orders. To address these interconnected challenges under coupled process constraints, the authors constructed a single-objective intelligent scheduling model specifically formulated to minimize the maximum completion time across shop floors.
The mathematical formulation incorporates several industry-specific operational constraints, including fixed process precedence, non-preemption conditions, machine exclusivity rules, delivery deadlines, and physical equipment workload limits. To solve this constrained model, the researchers modified the standard Harris Hawk Optimization algorithm by embedding four targeted improvement strategies: a nonlinear prey-energy attenuation strategy, sine–cosine search rules, an adaptive mutation operator, and a population information interaction mechanism.
The research team evaluated the performance of the algorithm across standard benchmark functions, standard hybrid flow-shop scheduling instances, and an empirical production dataset. The industrial validation utilized production records containing 15 coke products obtained from an operating coking enterprise in China. The authors noted that the study demonstrated effective optimization for finite-cycle production under these defined operating constraints, providing a dedicated computational approach for coking workshops operating under small-batch customized production modes.
Subject of Research: Intelligent scheduling optimization for coking hybrid flow workshops using an adaptive mutation algorithm
Article Title: Implementing intelligent coke production scheduling: a novel approach utilizing adaptive mutation harris hawk optimization algorithm
Article References: Zhu, X., Zhang, Z., Xia, P., Ni, L., & Ni, Z. (2027). Implementing intelligent coke production scheduling: a novel approach utilizing adaptive mutation harris hawk optimization algorithm. Cluster Computing, 30(1), Article 42. https://doi.org/10.1007/s10586-026-06814-2
Image Credits: AI Generated
DOI: 10.1007/s10586-026-06814-2
Keywords: coke production, coking hybrid flow shops, scheduling optimization, makespan minimization, adaptive mutation harris hawk optimization, harris hawk optimization, nonlinear prey-energy attenuation, sine-cosine search rules, adaptive mutation operator, population information interaction, machine exclusivity, non-preemption, process precedence, delivery deadlines, equipment workload limits, small-batch production, finite-cycle scheduling
News Source: Denise Maddox. (November 21, 2026). Adaptive Mutation Harris Hawk Algorithm Optimizes Coking Production Scheduling Makespan in Testing. Scienmag.



