A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
From MaRDI portal
Publication:4114931
DOI10.1287/mnsc.22.10.1097zbMath0345.90017OpenAlexW2135315422MaRDI QIDQ4114931
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.10.1097
Stochastic programming (90C15) Production models (90B30) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)
Related Items
A classification of assembly line balancing problems, A spreadsheet method for calculating work completion time probability distributions of paced or linked assembly lines, 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 versatile algorithm for assembly line balancing, Balancing stochastic parallel assembly lines, Theory and applications of generalized dynamic programming: An overview, Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming, Some comments on preference order dynamic programming models, Stochastic assembly line balancing using simulated annealing, Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm, A multiple criteria decision making approach for the assembly line balancing problem, Benders' decomposition for the balancing of assembly lines with stochastic demand, Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems, 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
