A sample average approximation method for disassembly line balancing problem under uncertainty
From MaRDI portal
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
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A balancing method and genetic algorithm for disassembly line balancing
- A branch and bound method for stochastic global optimization
- A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
- A stochastic programming approach for supply chain network design under uncertainty
- A two-stage stochastic programming model for electric energy producers
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- A two-stage stochastic programming model for transportation network protection
- Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
- Disassembly line in product recovery
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- Introduction to Stochastic Programming
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Planning product disassembly for material recovery opportunities
- Profit-oriented disassembly-line balancing
- State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
- The sample average approximation method for stochastic discrete optimization
Cited in
(18)- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- Capacitated disassembly scheduling under stochastic yield and demand
- A distributionally robust optimization approach for multi-product inventory decisions with budget constraint and demand and yield uncertainties
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- 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
- Stability factor for robust balancing of simple assembly lines under uncertainty
- Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information
- Master disassembly scheduling in a remanufacturing system with stochastic routings
- 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
- Second order conic approximation for disassembly line design with joint probabilistic constraints
- A disassembly line balancing problem with fixed number of workstations
- A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
- Stability factor for robust balancing of transfer lines under task processing time uncertainty
- A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times
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)
