检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵顾惜 ZHAO Gu-xi(School of Management and Economics,Kunming University of Science and Technology,Kunming 650093,China)
机构地区:[1]昆明理工大学管理与经济学院,云南昆明650093
出 处:《物流工程与管理》2020年第12期156-160,共5页Logistics Engineering and Management
摘 要:研究了现代中小型铝企业在产业集群环境下作业车间调度问题。考虑实际生产中的局部柔性、动态到达和等待时间的惩罚等生产特性,以最小化加权完成时间和等待时间惩罚之和为目标函数建立数学模型。针对该模型设计了把机器能力耦合约束松弛到目标函数中的拉格朗日松弛算法,并将拉格朗日对偶函数按工件分解成子问题,采用动态规划法建立递归公式求解。最后,根据企业实际运营数据设计不同规模的算例进行仿真实验,将实验结果与当前流行优化软件计算结果相对比,结果表明,拉格朗日松弛算法能在合理的时间内获得较为满意的近优解。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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.102.182