Scheduling is one of the most important missions for plant-wide optimization in steelmaking manufacturing systems. In the context of dynamic scheduling, the decision-maker should simultaneously minimize economic objectives within the decision space and violation penalty out of the decision space. In this study, we introduce a resilient scheduling model in steelmaking plants, which provides flexible decisions, including buffering times in between stages and controllable processing speeds in the casting stage, to enable the solution to absorb random disturbances and recover quickly. We formulate the dynamic steelmaking scheduling problem with resilient responding strategies, which is a variant of dynamic multi-objective optimization problems (DMOP), and propose a resilient scheduling optimization framework to solve it over time. First, we employ a vector with problem-specific knowledge to map the whole decision space to sub-schedules in the casting stage, which contains casting priority, casting speed and scaling ratio. Next, we form a multi-objective linear programming model to evaluate these problem-specific vectors. Last but not least, we develop a self-learning based dynamic multi-objective differential evolutionary algorithm to solve the variant DMOP, in which a hypothesis-testing technique is used to detect and identify environmental changes. The sensitivity analysis and algorithm comparisons are performed on a wide range of problem instances under dynamic environments. Experimental evidence validates that the proposed resilient model and the optimization framework is effective to solve the dynamic scheduling problem in steelmaking plants. Note to Practitioners—This paper investigates a dynamic scheduling problem that comes from steelmaking manufacturing systems and is extensively studied in existing works. Because a decision-maker only has incomplete knowledge about the realistic environments, this paper simultaneously considers that both the decision and objective space of a scheduling problem dynamically changed over time. We develop a resilient scheduling model which can absorb the different types or scales of disturbances caused by unforeseen events, and recover rapidly to the original state. We formulate the resilience scheduling model and propose a dynamic multi-objective algorithm based on the self-learning differential evolutionary algorithm to solve it. The effectiveness of the proposed model and algorithm is validated via sensitivity analysis and comparison to other well-known algorithms. Furthermore, the resilient scheduling model and its optimization framework can also be applied to dynamic scheduling problems in other industries.
Read full abstract