Heuristic algorithms for buffer allocation in a production line with unreliable machines

DOI10.1080/00207549508904794zbMath0913.90146OpenAlexW2091257728WikidataQ126247370 ScholiaQ126247370MaRDI QIDQ4399026

No author found.

Publication date: 17 May 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549508904794

zbMATH Keywords

heuristic algorithmsbuffer allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (7)

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 ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ A parallel tabu search for solving the primal buffer allocation problem in serial production systems ⋮ A new method for the placement of buffers in serial production lines ⋮ Topological network design of general, finite, multi-server queueing networks ⋮ Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation

Cites Work

• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• Stochastic concavity of throughput in series of queues with finite buffers
• Concavity of the throughput of tandem queueing systems with finite buffer storage space
• Reversibility of Tandem Blocking Queueing Systems
• The Reversibility Property of Production Lines

This page was built for publication: Heuristic algorithms for buffer allocation in a production line with unreliable machines