【摘要】 介绍了车间作业调度技术问题的理论、算法分类、特点及一般框架 .将 JSSP问题的研究方法分为两类 :最优化方法和近似 /启发式方法 ,对各种算法逐一分析比较 .总结了近年来该研究领域取得的进展和存在的问题 ,并指明了将来的发展方向更多还原

【Abstract】 This paper aims to provide a concise survey of scheduling theories concerning job shop scheduling problem by dealing with classification of related algorithms, characteristic and general framework of JSSP. The research methods are divided into two classes: the optimization and the heuristics. The methods under each approach are analyzed and compared with the others. At last, problems, which need further investigating and possible research directions, are pointed out更多还原