基于目标级联法的作业车间调度的研究

作业车间调度是一种典型的组合优化问题，大规模的调度优化是该类问题的难点。本文针对求解大规模的车间调度问题的需要，基于层次性优化的目标级联法，建立一种带层次性的车间调度模型，并以由两个零件族制造单元组成的车间调度为例，验证所建立的车间调度模型。研究表明，基于目标级联法的车间调度模型为大规模车间分层调度问题解决提供一种有效方法，而且能根据加工时间和工件数量动态合理地分配各制造单元的机器数量和工件的加工路径。

Research on Job-Shop Scheduling Based on Analytical Target Cascading

Job-shop scheduling is a typical combinatorial optimization problem, and large scale scheduling optimization is one of such difficult optimization problems. To solve large scale job-shop scheduling problem, a scheduling model for hierarchical job-shop is established based on the hierarchical optimization scheme - Analytical Target Cascading, and the model is verified by taking two manufacturing cells as examples. Research shows that the scheduling model offers an effective way to solve job-shop scheduling problem in large-scale, and it can dynamically and rationally arrange machines and the processing paths of workpieces for each manufacturing cell according to machining time and workpiece number.