期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 170, 期 1, 页码 185-206出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2004.11.036
关键词
stochastic job shop scheduling; neural networks; simulated annealing
This paper presents a nonlinear mathematical programming model for a stochastic job shop scheduling problem. Due to the complexity of the proposed model, traditional algorithms have low capability in producing a feasible solution. Therefore, a hybrid method is proposed to obtain a near-optimal Solution within a reasonable amount of time. This method uses a neural network approach to generate initial feasible solutions and then a simulated annealing algorithm to improve the quality and performance of the initial solutions in order to produce the optimal/near-optimal solution. A number of test problems are randomly generated to verify and validate the proposed hybrid method. The computational results obtained by this method are compared with lower bound solutions reported by the Lingo 6 optimization software. The compared results of these two methods show that the proposed hybrid method is more effective when the problem size increases. (c) 2005 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据