控制理论与应用2017，Vol.34Issue(4)：491-498,8.DOI:10.7641/CTA.2017.60450
装配线物料搬运的拉格朗日松弛算法
Lagrangian relaxation algorithm for material handling problems of assembly lines
摘要
Abstract
To effectively enhance the performance of the mixed-model assembly line in automobile manufacture enter-prises, a kanban model-based scheduling method of multi-close-loops dolly train material delivery, Lagrangian relaxation algorithm for material delivery problems of assembly lines, is proposed in this paper. First of all, a problem domain of multiple-close-loops dolly train material delivery is presented and a few assumptions of the problem are depicted in detail in the paper. Then, a mixed integer programming model is constructed, which aims to minimize the total expected cost of material delivery system. On that basis, two algorithms–-Lagrangian relaxation based on subgradient and Lagrangian relaxation based on random step–-are proposed for the mixed integer programming model, which both decompose the relaxed problem into two decision sub-problems both of which are solved respectively. Simulation experiments show that the two scheduling methods are fit to solving the problem and have a better performance in calculating time and stability.关键词
物料搬运/看板/调度/拉格朗日松弛Key words
material handling/kanban/scheduling/Lagrangian relaxation分类
信息技术与安全科学引用本文复制引用
周炳海,胡理嫚..装配线物料搬运的拉格朗日松弛算法[J].控制理论与应用,2017,34(4):491-498,8.基金项目
国家自然科学基金项目(71471135)资助. Supported by National Natural Science Foundation of China (71471135). （71471135）
