An application of neural network for job shop scheduling
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.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/20528 |