A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines
From MaRDI portal
Publication:2566896
DOI10.1155/S1024123X04402014zbMath1084.90022MaRDI QIDQ2566896
Chrissoleon T. Papadopoulos, A. C. Diamantidis
Publication date: 29 September 2005
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52243
Dynamic programming in optimal control and differential games (49L20) Production models (90B30) Dynamic programming (90C39)
Related Items (9)
Modeling of throughput in production lines using response surface methodology and artificial neural networks ⋮ Two approaches for solving the buffer allocation problem in unreliable production lines ⋮ Hybrid approach for buffer allocation in open serial production lines ⋮ A parallel tabu search for solving the primal buffer allocation problem in serial production systems ⋮ Optimization of buffer allocation in unreliable production lines based on availability evaluation ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines ⋮ Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds ⋮ Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation
This page was built for publication: A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines
