Scenario based robust line balancing: Computational complexity
From MaRDI portal
Publication:442208
DOI10.1016/j.dam.2012.04.011zbMath1250.90046OpenAlexW2038821862MaRDI QIDQ442208
Sergey Kovalev, Alexandre Dolgui
Publication date: 10 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.011
Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations ⋮ Stability factor for robust balancing of simple assembly lines under uncertainty ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions ⋮ Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems
Cites Work
- Unnamed Item
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- \texttt{Absalom}: balancing assembly lines with assignment restrictions
- Robust discrete optimization and its applications
- Complexity results for single-machine problems with positive finish-start time-lags
- A classification of assembly line balancing problems
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- Topological sorting of large networks
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Robust balancing of mixed model assembly line
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Scenario based robust line balancing: Computational complexity
