Buffer allocation in flow-shop-type production systems with general arrival and service patterns
From MaRDI portal
Publication:5955474
DOI10.1016/S0305-0548(00)00060-5zbMath1026.90036OpenAlexW2087444712MaRDI QIDQ5955474
Ming-Guang Huang, Pao-Long Chang, Ying-Chyi Chou
Publication date: 13 February 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00060-5
Network design and communication in computer systems (68M10) Production models (90B30) Discrete location and assignment (90B80)
Related Items (7)
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 ⋮ A case study of the body shop design in an automotive factory using 3D simulation ⋮ Mathematical programming models for joint simulation-optimization applied to closed queueing networks ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS
Cites Work
- The generalized expansion method for open finite queueing networks
- Queueing models for a flexible machining station. II: The method of Coxian phases
- An approximate analysis of open tandem queueing networks with blocking and general service times
- Asymptotic behavior of the expansion method for open finite queueing networks
- Approximate analysis for queueing networks with finite capacity and customer loss
- Approximate analysis of exponential queueing systems with blocking
- Approximate analysis of exponential tandem queues with blocking
- Buffer allocation for an integer nonlinear network design problem
- Buffer allocation for a class of nonlinear stochastic knapsack problems
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- A Comment on “Buffer Space Allocation in Automated Assembly Lines”
- An Approximation Method for Tandem Queues with Blocking
- Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
- Approximate Analysis of General Queuing Networks by Decomposition
- Two-Moment Analysis of Open Queueing Networks with General Workstation Capabilities
- A computationally efficient approximation algorithm for feed-forward open queueing networks with blocking
- The optimal buffer allocation problem
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
This page was built for publication: Buffer allocation in flow-shop-type production systems with general arrival and service patterns
