Scenario based robust line balancing: Computational complexity

DOI10.1016/J.DAM.2012.04.011MaRDI QIDQ442208zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

computational complexityline balancingmin-max approachscenariouncertainty

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete location and assignment (90B80)

Recommendations

• Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions
• Stability factor for robust balancing of simple assembly lines under uncertainty
• Robust balancing of mixed model assembly line
• MIP-Based Heuristics for a Robust Transfer Lines Balancing Problem
• Balancing U-lines in a multiple U-line facility

Cites work

• \texttt{Absalom}: balancing assembly lines with assignment restrictions
• A classification of assembly line balancing problems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
• Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
• Complexity results for single-machine problems with positive finish-start time-lags
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
• Robust balancing of mixed model assembly line
• Robust discrete optimization and its applications
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
• Robustness in operational research and decision aiding: a multi-faceted issue
• Stability analysis of an optimal balance for an assembly line with fixed cycle time
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• Topological sorting of large networks

Cited in

(11)

• 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
• Stability factor for robust balancing of simple assembly lines under uncertainty
• Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems
• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
• A decomposition based solution algorithm for U-type assembly line balancing with interval data
• Robust balancing of mixed model assembly line
• MIP-Based Heuristics for a Robust Transfer Lines Balancing Problem
• A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty
• On solving the robust transfer line balancing problem with parallel tasks and interval processing times
• Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic

This page was built for publication: Scenario based robust line balancing: Computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442208)