产业集群环境下铝企业作业车间调度问题研究

Study on Job Shop Scheduling of Aluminum Enterprises in Industrial Cluster Environment

研究了现代中小型铝企业在产业集群环境下作业车间调度问题。考虑实际生产中的局部柔性、动态到达和等待时间的惩罚等生产特性,以最小化加权完成时间和等待时间惩罚之和为目标函数建立数学模型。针对该模型设计了把机器能力耦合约束松弛到目标函数中的拉格朗日松弛算法,并将拉格朗日对偶函数按工件分解成子问题,采用动态规划法建立递归公式求解。最后,根据企业实际运营数据设计不同规模的算例进行仿真实验,将实验结果与当前流行优化软件计算结果相对比,结果表明,拉格朗日松弛算法能在合理的时间内获得较为满意的近优解。

In this paper,the scheduling problem of small and medium sized aluminum enterprises in industrial cluster is studied.Considering the production characteristics such as local flexibility,dynamic arrival and waiting time penalty in actual production,the mathematical model is established by taking the sum of the minimum weighted completion time and waiting time penalty as the objective function.A Lagrangian relaxation algorithm is designed to relax the coupling constraint of machine capability into the objective function,and the Lagrangian dual function is decomposed into sub-problems according to the workpiece.Finally,according to the actual operation data of the enterprise,the simulation experiment is carried out with the calculation examples of different sizes,and the experimental results are compared with the calculation results of the current popular optimization software.The results show that the Lagrange relaxation algorithm can obtain a satisfactory near-optimal solution in a reasonable time.