Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
From MaRDI portal
Publication:5147666
DOI10.17535/crorr.2020.0018zbMath1458.90499OpenAlexW3116686931MaRDI QIDQ5147666
Publication date: 27 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2020.0018
Related Items (1)
Cites Work
- Unnamed Item
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- A chance-constrained approach to stochastic line balancing problem
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- Note. Optimal Balancing of U-Shaped Assembly Lines
- Theory and Applications of Robust Optimization
- The Price of Robustness
- Robust balancing of mixed model assembly line
- Stochastic assembly line balancing using beam search
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times