Optimization of buffer allocation in unreliable production lines based on availability evaluation
From MaRDI portal
Publication:4563354
DOI10.1002/oca.2341zbMath1388.93109OpenAlexW2676081952MaRDI QIDQ4563354
Yuwang Liu, Binghai Zhou, Da Tao, Jia-Di Yu
Publication date: 31 May 2018
Published in: Optimal Control Applications and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/oca.2341
Production models (90B30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Optimal stochastic control (93E20)
Related Items
Cites Work
- Unnamed Item
- Two approaches for solving the buffer allocation problem in unreliable production lines
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- Optimal buffer allocation in finite closed networks with multiple servers
- Buffer allocation in general single-server queueing networks
- Maximizing system availability through joint decision on component redundancy and spares inventory
- A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines
- A continuous buffer allocation model using stochastic processes
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Approximate analysis of transfer lines with unreliable machines and finite buffers
- Selecting machines and buffers in unreliable series-parallel production lines
- Optimal control of work-in-process inventory of a two-station production line
