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 Traveling Salesman Problem (TSP) is a famous combinatorial optimization problem. Recent research has proposed an anchor-based supervised learning approach. This approach predicts ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results