Pages that link to "Item:Q337547"
From MaRDI portal
The following pages link to A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547):
Displaying 13 items.
- Second order conic approximation for disassembly line design with joint probabilistic constraints (Q320132) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Stability factor for robust balancing of simple assembly lines under uncertainty (Q2146745) (← links)
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
- Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times (Q5147666) (← links)
- Balancing U-type assembly lines with human-robot collaboration (Q6047919) (← links)
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach (Q6048109) (← links)
- Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times (Q6105933) (← links)
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm (Q6547003) (← links)