A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
From MaRDI portal
Publication:1999621
DOI10.1016/j.ejor.2019.05.001zbMath1430.90590OpenAlexW2944047065WikidataQ127921296 ScholiaQ127921296MaRDI QIDQ1999621
Celso Gustavo Stall Sikora, Adalberto Sato Michels, Leandro Magatão, Thiago Cantos Lopes
Publication date: 27 June 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.05.001
mixed-integer linear programmingcombinatorial optimisationBenders' decompositioncombinatorial Benders' cutsmulti-manned assembly line balancing
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Production models (90B30)
Related Items
Assembly line balancing: what happened in the last fifteen years? ⋮ Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ Constraint programming model for multi-manned assembly line balancing problem ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem ⋮ Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Model and heuristics for the assembly line worker integration and balancing problem
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- A dynamic programming based heuristic for the assembly line balancing problem
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Partitioning procedures for solving mixed-variables programming problems
- Balancing a robotic spot welding manufacturing line: an industrial case study
- 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
- Scheduling of resource-constrained projects
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- 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
- A survey on problems and methods in generalized assembly line balancing
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Integrated assembly line balancing with resource restrictions
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- General Symmetry Breaking Constraints
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
