Abstract: The Steelmaking-Continuous Casting (SCC) scheduling problem is usually regarded as a type of hybrid flow-shop scheduling problems (HFSP) with special process constraints. To research the SCC ...

Abstract: The Branch-and-Bound(B&B) algorithm is an effective method for solving the Mixed Integer Linear Programming (MILP) problem. Its performance significantly impacts the overall performance of ...