A decomposition based solution algorithm for U-type assembly line balancing with interval data
From MaRDI portal
(Redirected from Publication:337547)
Recommendations
- Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
- Robust balancing of mixed model assembly line
- U-OPT: An analysis of exact U-shaped line balancing procedures
- Stability factor for robust balancing of simple assembly lines under uncertainty
- The stochastic U-line balancing problem
Cites work
- A classification of assembly line balancing problems
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
- Balancing of U-type assembly systems using simulated annealing
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- Exact and heuristic algorithms for the interval data robust assignment problem
- Integer-programming software systems
- Note. Optimal balancing of U-shaped assembly lines
- 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
- Robust supply chain design under uncertain demand in agile manufacturing
- Scenario based robust line balancing: Computational complexity
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- Stability measure for a generalized assembly line balancing problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- The U-line Line Balancing Problem
- The robust vehicle routing problem with time windows
- The stochastic U-line balancing problem
- The stochastic U-line balancing problem: a heuristic procedure
- U-OPT: An analysis of exact U-shaped line balancing procedures
- U-shaped assembly line layouts and their impact on labor productivity: an experimental study
- ULINO: Optimally balancing U-shaped JIT assembly lines
Cited in
(14)- Assembly line balancing: what happened in the last fifteen years?
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
- Combinatorial Benders cuts for assembly line balancing problems with setups
- New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions
- Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
- 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
- Second order conic approximation for disassembly line design with joint probabilistic constraints
- Approximation algorithms for simple assembly line balancing problems
- Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times
- Stability factor for robust balancing of simple assembly lines under uncertainty
- Balancing U-type assembly lines with human-robot collaboration
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
This page was built for publication: A decomposition based solution algorithm for U-type assembly line balancing with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337547)
