摘要
车间作业调度问题是优化组合中一个著名的难题,即使规模不大的算例,优化算法的时间也很长。文章提出了一种求解车间作业调度问题的快速智能枚举算法,选取了22个标准算例作为算法的测试试验集,该算法在较短的时间内找到了17个算例的最优解,试验结果表明智能枚举算法确实是一种快速的、有效的求解车间作业调度问题的近似算法。
The job shop scheduling problem is a notoriously difficult problem in combinatorial optimization.Although even modest sized instances,the computational time remains too long for optimization algorithms.An intelligent enumeration algorithm for job shop scheduling problem has been proposed in this paper.The algorithm has been tested on a total of 22 benchmark instances,16 instances have been found optimal solutions in short time,the computational results show that,the algorithm is a fast and effective approximate algorithm for job shop scheduling problem.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第30期32-34,67,共4页
Computer Engineering and Applications
基金
国家重点基础研究发展规划项目资助(编号:G1998030600)
关键词
车问作业调度
算法
智能枚举
job shop scheduling,algorithm,intelligent enumeration
