DocumentCode
2629816
Title
Solving job-shop scheduling problem with priority using neural network
Author
Zhang, Chang-shui ; Yan, Ping-fan ; Chang, Tong
Author_Institution
Dept. of Autom., Tsinghua Univ., Beijing, China
fYear
1991
fDate
18-21 Nov 1991
Firstpage
1361
Lastpage
1366
Abstract
Based on an improved method of neural networks for a job-shop scheduling problem (JSP), a method for JSP with priority is described. Two other very important JSPs-the string problem and JSP with due dates-were transformed to JSP with priority using the proposed method. Simulations were successfully done; the method was found to be good and simple
Keywords
neural nets; operations research; production control; due dates; job-shop scheduling; neural network; operations research; priority; production control; string problem; Automation; Constraint optimization; Cost function; Job shop scheduling; Laboratories; Neural networks; Neurons; Performance analysis; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN
0-7803-0227-3
Type
conf
DOI
10.1109/IJCNN.1991.170586
Filename
170586
Link To Document