Explicit Learning: an Effort towards Human Scheduling Algorithms

Jingpeng Li, Uwe Aickelin

Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approache…