Time-table scheduling using neural network algorithms
Tao-Chun Yu · 1990
A demonstration is presented of how to use neural network algorithms to schedule classes in an educational institute. Such a scheduling problem is basically a graph-coloring or graph-partitioning problem which belongs to the large class of NP (nondeterministic polynomial time)-complete problems, and it is difficult to solve. G.C. Fox and W. Furmanski (1988) proposed some neural network algorithms to decompose loosely synchronous problems onto parallel machines. The author adopts these algorithms to schedule timetables. The algorithms can be implemented on a digital computer or on analog neural networks