Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/5984
Title: An improved constraint satisfaction adaptive neural network for job-shop scheduling
Authors: Yang, S
Wang, D
Chai, T
Kendall, G
Keywords: Job-shop scheduling;Constraint satisfaction adaptive neural network;Heuristics;Active schedule;Non-delay schedule;Priority rule;Computational complexity
Issue Date: 2010
Publisher: Springer Verlag
Citation: Journal of Scheduling, 13(1): 17 - 38, 2010
Abstract: This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems. The neural network is constructed based on the constraint conditions of a job-shop scheduling problem. Its structure and neuron connections can change adaptively according to the real-time constraint satisfaction situations that arise during the solving process. Several heuristics are also integrated within the neural network to enhance its convergence, accelerate its convergence, and improve the quality of the solutions produced. An experimental study based on a set of benchmark job-shop scheduling problems shows that the improved constraint satisfaction adaptive neural network outperforms the original constraint satisfaction adaptive neural network in terms of computational time and the quality of schedules it produces. The neural network approach is also experimentally validated to outperform three classical heuristic algorithms that are widely used as the basis of many state-of-the-art scheduling systems. Hence, it may also be used to construct advanced job-shop scheduling systems.
Description: Copyright @ Springer Science + Business Media, LLC 2009
URI: http://www.springerlink.com/content/362523p540421710/
http://bura.brunel.ac.uk/handle/2438/5984
DOI: http://dx.doi.org/10.1007/s10951-009-0106-z
ISSN: 1094-6136
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf371.79 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.