A new adaptive neural network and heuristics hybrid approach for job-shop scheduling

被引:52
作者
Yang, SX [1 ]
Wang, DW
机构
[1] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
[2] Northeastern Univ, Dept Syst Engn, Shenyang 110006, Peoples R China
基金
中国国家自然科学基金;
关键词
job-shop scheduling; adaptive neural network; heuristics;
D O I
10.1016/S0305-0548(00)00018-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the feasible solution. Two heuristics are presented, which can be combined with the neural network. One heuristic is used to accelerate the solving process of the neural network and guarantee its convergence, the other heuristic is used to obtain non-delay schedules from the feasible solutions gained by the neural network. Computer simulations have shown that the proposed hybrid approach is of high speed and efficiency. The strategy for solving practical job-shop scheduling problems is provided. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:955 / 971
页数:17
相关论文
共 27 条
[1]  
BAKER KR, 1974, INTRO SEQUENCE SCHED
[2]  
Bellman R, 1982, MATH ASPECTS SCHEDUL
[3]  
Conway R.W., 1967, Theory of Scheduling
[4]  
*DARPA, 1988, DARPA NUER NETW STUD
[5]   FUZZY CONSTRAINTS IN JOB-SHOP SCHEDULING [J].
DUBOIS, D ;
FARGIER, H ;
PRADE, H .
JOURNAL OF INTELLIGENT MANUFACTURING, 1995, 6 (04) :215-234
[6]   FINDING SOME ESSENTIAL CHARACTERISTICS OF FEASIBLE SOLUTIONS FOR A SCHEDULING PROBLEM [J].
ERSCHLER, J ;
ROUBELLAT, F ;
VERNHES, JP .
OPERATIONS RESEARCH, 1976, 24 (04) :774-783
[7]  
Foo S. P. Y, 1988, P IEEE IJCNN SAN DIE, V2, P341
[8]   JOB-SHOP SCHEDULING BASED ON MODIFIED TANK-HOPFIELD LINEAR-PROGRAMMING NETWORKS [J].
FOO, SY ;
TAKEFUJI, Y ;
SZU, H .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 1994, 7 (03) :321-327
[9]  
FOO SY, 1988, P IEEE IJCNN SAN DIE, V2, P283
[10]  
FOO YPS, 1988, 1988 P IEEE ICNN SAN, V2, P275