A decomposition based solution algorithm for U-type assembly line balancing with interval data
From MaRDI portal
Publication:337547
DOI10.1016/j.cor.2015.01.010zbMath1348.90224OpenAlexW2002670031MaRDI QIDQ337547
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.01.010
Related Items (12)
Approximation algorithms for simple assembly line balancing problems ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Stability factor for robust balancing of simple assembly lines under uncertainty ⋮ Second order conic approximation for disassembly line design with joint probabilistic constraints ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach ⋮ Balancing U-type assembly lines with human-robot collaboration ⋮ Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach ⋮ Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times ⋮ Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times ⋮ 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
Cites Work
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem
- The robust vehicle routing problem with time windows
- Scenario based robust line balancing: Computational complexity
- Exact and heuristic algorithms for the interval data robust assignment problem
- Integer-programming software systems
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- Robust supply chain design under uncertain demand in agile manufacturing
- Partitioning procedures for solving mixed-variables programming problems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- U-shaped assembly line layouts and their impact on labor productivity: an experimental study
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Stability measure for a generalized assembly line balancing problem
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- A classification of assembly line balancing problems
- The stochastic U-line balancing problem: a heuristic procedure
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- Note. Optimal Balancing of U-Shaped Assembly Lines
- ULINO: Optimally balancing U-shaped JIT assembly lines
- The stochastic U-line balancing problem
- Balancing of U-type assembly systems using simulated annealing
- U-OPT: An analysis of exact U-shaped line balancing procedures
- The U-line Line Balancing Problem
This page was built for publication: A decomposition based solution algorithm for U-type assembly line balancing with interval data
