Project Scheduling问题和Job-Shop问题的神经网络解  

SOLVING PROJECT SCHEDULING PROBLEM AND JOB - SHOP PROBLEM BY NEURAL NETWORK

作　　者：章烔民 吴文娟[1] 陶增乐[1] 

机构地区：[1]华东师范大学计算机科学系,上海200062

出　　处：《计算机应用与软件》1998年第2期21-28,共8页Computer Applications and Software

摘　　要：Project Scheduling问题和Job-Shop问题是著名的NP难题。本文用神经网络方法去解这两个问题,软件模拟结果是令人满意的。这种方法也为解一大类组合优化问题提供了一个新的途径。Project Scheduling problem and Job-Shop problem are known as the difficult NP ones. In the paper, we solve them by neural network method. Their software simulations show that the results are satifactory, and provide a new channal for solving a larger class of optimizations problems.

关 键 词：JOB-SHOP问题 神经网络 解 优化问题 

分 类 号：O224[理学—运筹学与控制论]