Optimal Buffer Allocation in Tandem Closed Queuing Network with Single Server Using PSO

Abstract

Buffer Allocation Problem is an important research issue in manufacturing system design. Objective of this paper is to find optimum buffer allocation for closed queuing network with single server at each node. Sum of buffers in closed queuing network is constant. Attempt is made to find optimum number of pallets required to maximize throughput of manufacturing system which has pre specified space for allocating pallets. Expanded Mean Value Analysis is used to evaluate the performance of closed queuing network. Particle Swarm Optimization is used as generative technique to optimize the buffer allocation. Numerical experiments are shown to explain effectiveness of procedure.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.