Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
DOI10.1007/s10479-022-05118-zzbMath1517.90037OpenAlexW4311379928MaRDI QIDQ6099415
Publication date: 20 June 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-05118-z
mathematical programmingBenders decompositionassembly line balancingexact solution methodmulti-manned assembly lines
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Combinatorial Benders cuts for assembly line balancing problems with setups
- The Benders decomposition algorithm: a literature review
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Worker allocation in lean U-shaped production lines
- A Production Line that Balances Itself
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
This page was built for publication: Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
