An application of neural network for job shop scheduling.
Tan, Tuan Heng.
Date of Issue1997
Gintic Institute of Manufacturing Technology
The job shop scheduling problem has been well recognised as the NP-complete constraints satisfaction problem. The larger number of possibilities in which job operations can be sequenced in a realistic job shop has rendered the problem to be a very difficult one to solve.
NANYANG TECHNOLOGICAL UNIVERSITY