By Topic

A Hybrid Approach Based on Artificial Neural Network and Genetic Algorithm for Job-shop Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fuqing Zhao ; Sch. of Comput. & Commun., Lanzhou Univ. of Technol. ; Yi Hong ; Dongmei Yu ; Yahong Yang

Job-shop scheduling problem (JSSP) is very common in a discrete manufacturing environment. It deals with multi-operation models, which are different from the flow shop models. There are some difficulties that make this problem difficult. Firstly, it is highly constrained problem that changes from shop to shop. Secondly, its decision mainly depends on other decision which are not isolated from other functions. It is an NP-hard problem. In this paper, we proposed a new hybrid approach, combining ANN and GA, for the job-shop scheduling. The GA is used for optimization of sequence, neural network (NN) is used for optimization of operation start times with a fixed sequence, thanks to the NN's parallel computability and the GA's searching efficiency, the computational ability of the hybrid approach is strong enough to deal with complex scheduling problems. The results indicate that the proposed algorithm can obtain satisfactory for the job-shop scheduling problem

Published in:

Neural Networks and Brain, 2005. ICNN&B '05. International Conference on  (Volume:3 )

Date of Conference:

13-15 Oct. 2005