Benders' decomposition for the balancing of assembly lines with stochastic demand
type: Item
instance of: scholarly article
title: Benders' decomposition for the balancing of assembly lines with stochastic demand
zbMATH Open document ID: 1487.90257
author: Celso Gustavo Stall Sikora
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 7356054
zbMATH Keywords: flexible manufacturing systems
zbMATH Keywords: assembly line balancing problem
zbMATH Keywords: stochastic optimization
zbMATH Keywords: combinatorial Benders' decomposition
zbMATH Keywords: mixed-model assembly line
describes a project that uses: SALBPGen
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.10.019
OpenAlex ID: W3092950424
cites work: Combinatorial Benders cuts for assembly line balancing problems with setups
cites work: An analytic framework for sequencing mixed model assembly lines
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A sample average approximation method for disassembly line balancing problem under uncertainty
cites work: Introduction to Stochastic Programming
cites work: A classification of assembly line balancing problems
cites work: Sequencing mixed-model assembly lines: survey, classification and model critique
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Accelerating benders decomposition with heuristicmaster problem solutions
cites work: Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
cites work: Scheduling in-house transport vehicles to feed parts to automotive assembly lines
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: A heuristic solution for fuzzy mixed-model line balancing problem
cites work: A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
cites work: Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Some complexity results in cyclic scheduling
cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
cites work: A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
cites work: Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
cites work: Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
cites work: Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
cites work: The Benders decomposition algorithm: a literature review
cites work: Improved integer programming models for simple assembly line balancing and related problems
cites work: Meeting demand variation using flexible U-shaped assembly lines
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
DOI: 10.1016/J.EJOR.2020.10.019
description: scientific article; zbMATH DE number 7356054