Pages that link to "Item:Q1652575"
From MaRDI portal
The following pages link to The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575):
Displayed 8 items.
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times (Q5147666) (← links)
- Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times (Q6105933) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)