Pages that link to "Item:Q1999621"
From MaRDI portal
The following pages link to A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621):
Displaying 14 items.
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches (Q2108816) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints (Q2140318) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method (Q2399325) (← links)
- Constraint programming model for multi-manned assembly line balancing problem (Q2664418) (← links)
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition (Q5084654) (← links)
- Balancing large-scale machining lines with multi-spindle heads using decomposition (Q5385387) (← links)
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach (Q6048109) (← links)
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers (Q6099415) (← links)
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem (Q6551052) (← links)
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem (Q6551151) (← links)
