An improved adaptive neural network for job-shop scheduling
| dc.cclicence | CC-BY-NC | en |
| dc.contributor.author | Yang, Shengxiang | en |
| dc.date.accessioned | 2017-03-21T15:36:39Z | |
| dc.date.available | 2017-03-21T15:36:39Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper presents an improved adaptive neural network together with heuristic methods for job-shop scheduling problems. The neural network is based on constraints satisfaction of job-shop scheduling and can adapt its structure and neuron connections during the solving. Several heuristics are also proposed to be combined with the neural network to guarantee its convergence, accelerate its solving process, and improve the quality of solutions. Experimental study shows that the proposed hybrid approach outperforms two classical heuristic algorithms regarding the quality of solutions. | en |
| dc.funder | N/A | en |
| dc.identifier.citation | Yang, S. (2005) An improved adaptive neural network for job-shop scheduling. Proceedings of the 2005 IEEE International Conference on Systems, Man and Cybernatics, 2, pp. 1200-1205 | en |
| dc.identifier.uri | http://hdl.handle.net/2086/13807 | |
| dc.language.iso | en_US | en |
| dc.peerreviewed | Yes | en |
| dc.projectid | N/A | en |
| dc.publisher | IEEE | en |
| dc.researchgroup | Centre for Computational Intelligence | en |
| dc.researchinstitute | Institute of Artificial Intelligence (IAI) | en |
| dc.subject | Adaptive neural network | en |
| dc.subject | Job-shop scheduling | en |
| dc.subject | Constraint satisfaction | en |
| dc.subject | Heuristics | en |
| dc.title | An improved adaptive neural network for job-shop scheduling | en |
| dc.type | Conference | en |