A sample average approximation method for disassembly line balancing problem under uncertainty

DOI10.1016/J.COR.2014.05.006zbMATH Open1348.90219OpenAlexW2050549064MaRDI QIDQ337118FDOQ337118

Authors: Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.006

Recommendations

• A branch, bound, and remember algorithm for the simple disassembly line balancing problem
• An integrated approach for a new flexible multi-product disassembly line balancing problem
• A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
• Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information
• A dynamic programming approach to a multi-objective disassembly line balancing problem

zbMATH Keywords

Monte Carlo samplingstochastic programmingproduct recoverydisassembly linessustainable manufacturingL-shaped algorithmline design

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Production models (90B30)

Cites Work

• A stochastic programming approach for supply chain network design under uncertainty
• The sample average approximation method for stochastic discrete optimization
• Title not available (Why is that?)
• Introduction to Stochastic Programming
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A two-stage stochastic programming model for transportation network protection
• A branch and bound method for stochastic global optimization
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
• Disassembly line in product recovery
• A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
• Profit-oriented disassembly-line balancing
• A balancing method and genetic algorithm for disassembly line balancing
• Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
• A two-stage stochastic programming model for electric energy producers
• Planning product disassembly for material recovery opportunities
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

Cited In (17)

• A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times
• A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
• Capacitated disassembly scheduling under stochastic yield and demand
• Constraint programming approaches to disassembly line balancing problem with sequencing decisions
• Order assignment and scheduling under processing and distribution time uncertainty
• Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
• A distributionally robust optimization approach for multi-product inventory decisions with budget constraint and demand and yield uncertainties
• Benders' decomposition for the balancing of assembly lines with stochastic demand
• Second order conic approximation for disassembly line design with joint probabilistic constraints
• Stability factor for robust balancing of simple assembly lines under uncertainty
• Mixed integer programming approaches to partial disassembly line balancing and sequencing problem
• An integrated approach for a new flexible multi-product disassembly line balancing problem
• Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information
• A disassembly line balancing problem with fixed number of workstations
• Master disassembly scheduling in a remanufacturing system with stochastic routings
• A branch, bound, and remember algorithm for the simple disassembly line balancing problem
• A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty

This page was built for publication: A sample average approximation method for disassembly line balancing problem under uncertainty

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