Bounds and heuristics for assembly-like queues
From MaRDI portal
Publication:1121154
DOI10.1007/BF01158549zbMath0673.90036OpenAlexW2079752997MaRDI QIDQ1121154
Wallace J. Hopp, John T. Simon
Publication date: 1989
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158549
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30)
Related Items (21)
A decomposition-related throughput property of tandem queueing networks with blocking ⋮ Kitting process in a stochastic assembly system ⋮ Performance analysis of a kitting process in stochastic assembly systems ⋮ Double-ended queues with non-Poisson inputs and their effective algorithms ⋮ Analysis of a tripartite entanglement distribution switch ⋮ Transient and asymptotic behavior of synchronization processes in assembly-like queues ⋮ ANALYTICAL APPROXIMATIONS FOR KITTING SYSTEMS WITH MULTIPLE INPUTS ⋮ Performance analysis of a kitting process as a paired queue ⋮ Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations ⋮ Queueing-model based analysis of assembly lines with finite buffers and general service times ⋮ A Taylor series approach for service-coupled queueing systems with intermediate load ⋮ Estimating the throughput of an exponential CONWIP assembly system ⋮ Estimating the throughput of a cyclic assembly system ⋮ Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine ⋮ Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times ⋮ Performance analysis of assembly systems with unreliable machines and finite buffers ⋮ Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy ⋮ Throughput, flow times, and service level in an unreliable assembly system ⋮ A Maclaurin-series expansion approach to multiple paired queues ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Due-date assignment for multi-server multi-stage assembly systems
Cites Work
- Unnamed Item
- Unnamed Item
- Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
- An approximate analysis for a class of assembly-like queues
- Finite capacity assembly-like queues
- Approximate analysis of exponential tandem queues with blocking
- A Theorem of Elie Cartan
- Queues with paired customers
- Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers
- Assembly-like queues
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
This page was built for publication: Bounds and heuristics for assembly-like queues
