A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
From MaRDI portal
Cited in
(16)- Theory and applications of generalized dynamic programming: An overview
- Some comments on preference order dynamic programming models
- Balancing stochastic parallel assembly lines
- Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- A classification of assembly line balancing problems
- A versatile algorithm for assembly line balancing
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
- A survey on problems and methods in generalized assembly line balancing
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
- Second order conic approximation for disassembly line design with joint probabilistic constraints
- Designing energy-efficient serial production lines: the unpaced synchronous line-balancing problem
- A multiple criteria decision making approach for the assembly line balancing problem
- Stochastic assembly line balancing using simulated annealing
- A spreadsheet method for calculating work completion time probability distributions of paced or linked assembly lines
This page was built for publication: A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4114931)
