Loading [MathJax]/extensions/MathMenu.js
A Benders’ Decomposition Algorithm for Balancing and Sequencing of the Mixed-Model Multi-Manned Assembly Lines | IEEE Journals & Magazine | IEEE Xplore
Scheduled Maintenance: On Monday, 30 June, IEEE Xplore will undergo scheduled maintenance from 1:00-2:00 PM ET (1800-1900 UTC).
On Tuesday, 1 July, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC).
During these times, there may be intermittent impact on performance. We apologize for any inconvenience.

A Benders’ Decomposition Algorithm for Balancing and Sequencing of the Mixed-Model Multi-Manned Assembly Lines


Abstract:

Assembly lines of large-size products usually allow multiple workers to process tasks simultaneously on the same product. Meanwhile, due to the increasing demand of custo...Show More

Abstract:

Assembly lines of large-size products usually allow multiple workers to process tasks simultaneously on the same product. Meanwhile, due to the increasing demand of customized products, a diverse product mix with more product models and optional features is necessary. Although line balancing and model sequencing are interwoven, only the balancing problem of the mixed-model multi-manned assembly lines (MMALs) has been explored. In this study, a new mixed-integer linear programming model is proposed for balancing and sequencing of MMALs to minimize the number of workers, the number of stations, and the amount of utility work. An innovative approach based on Benders’ decomposition algorithm (BDA) is developed. Valid inequalities based on maximal cliques are generated to deal with the incompatible tasks which cannot be assigned to the same station to tighten and reduce the size of the formulation. An initial solution based on the greedy algorithm feeds the BDA to accelerate the convergence. Only one branch-and-search tree is built for the master problem to speed up the algorithm, and optimality cuts based on the subproblems are used as lazy cuts. The effectiveness of the proposed BDA is demonstrated by numerical results.
Page(s): 2114 - 2124
Date of Publication: 18 December 2023

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.