In the Micromouse competition, tiny autonomous robots race to solve complex mazes as quickly as possible. Some of the fastest robots can complete the course in as little as six seconds, using sensors, ...

Abstract: To address the flexible assembly job shop scheduling problem, an improved differential evolution algorithm based on Q-Learning is proposed to optimize the makespan, the average product ...

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 ...