Constraint Satisfaction Adaptive Neural Network and Heuristics Combined Approaches for Generalized Job-Shop Scheduling  

Oleh:

Yang, S. ; Wang, Dingwei

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 11 no. 2 (2000), page 474-486.
Topik: heuristics; satisfaction; neural network; heuristics combined; approaches; job - shop scheduling

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job - shop scheduling problem, one of NP - complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job - shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali