Lagrangian relaxation algorithm for material handling problems of assembly lines
ZHOU Bing-hai
HU Li-man
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.
Keywords：material handlingkanbanschedulingLagrangian relaxation
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 491-498 )