Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
From MaRDI portal
Publication:6099415
Recommendations
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Combinatorial Benders cuts for assembly line balancing problems with setups
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
Cites work
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- A Production Line that Balances Itself
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- Combinatorial Benders cuts for assembly line balancing problems with setups
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Logic-based Benders decomposition
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
- Partitioning procedures for solving mixed-variables programming problems
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- The Benders decomposition algorithm: a literature review
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- Worker allocation in lean U-shaped production lines
Cited in
(9)- Combinatorial Benders cuts for assembly line balancing problems with setups
- 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
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem
- A matheuristic approach for the multi-manned assembly line balancing problem with collaborative robots
- Minimising cycle time in multi-manned assembly line balancing problem with dependent task times
- Modeling and analysis of the walking worker assembly line balancing problem considering worker-dependent task durations and walking times to increase production rate
- Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back
This page was built for publication: Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099415)
