Benders' decomposition for the balancing of assembly lines with stochastic demand

DOI10.1016/J.EJOR.2020.10.019zbMath1487.90257OpenAlexW3092950424MaRDI QIDQ2030547

Celso Gustavo Stall Sikora

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.019

zbMATH Keywords

stochastic optimizationflexible manufacturing systemsmixed-model assembly linecombinatorial Benders' decompositionassembly line balancing problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Production models (90B30) Stochastic scheduling theory in operations research (90B36)

Related Items (4)

Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ Solving multistage stochastic linear programming via regularized linear decision rules: an application to hydrothermal dispatch planning ⋮ Mixed-model assembly line balancing problem considering learning effect and uncertain demand

Uses Software

• SALBPGen

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Benders decomposition without separability: a computational study for capacitated facility location problems
• A sample average approximation method for disassembly line balancing problem under uncertainty
• Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
• Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Partitioning procedures for solving mixed-variables programming problems
• Some complexity results in cyclic scheduling
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
• Combinatorial Benders cuts for assembly line balancing problems with setups
• The Benders decomposition algorithm: a literature review
• Scheduling in-house transport vehicles to feed parts to automotive assembly lines
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
• Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
• A classification of assembly line balancing problems
• A heuristic solution for fuzzy mixed-model line balancing problem
• Introduction to Stochastic Programming
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Meeting demand variation using flexible U-shaped assembly lines
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• An analytic framework for sequencing mixed model assembly lines
• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
• A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
• Accelerating benders decomposition with heuristicmaster problem solutions
• Improved integer programming models for simple assembly line balancing and related problems
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: Benders' decomposition for the balancing of assembly lines with stochastic demand