Approximations for the mean queue length of the GIX/G(b,b)/c queue

Authors:
Thomas Hanschke
Affiliations:
Technische Universität Clausthal, Institut für Mathematik, Erzstrasse 1, 38678 Clausthal-Zellerfeld, Germany
Venue:
Operations Research Letters
Year:
2006

Citing 4
Cited 2

Introduction to graph theory

Introduction to graph theory
Probability, statistics, and queueing theory with computer science applications

Probability, statistics, and queueing theory with computer science applications
Adventures in stochastic processes

Adventures in stochastic processes
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications

Queueing networks and Markov chains: modeling and performance evaluation with computer science applications

A queueing network based system to model capacity and cycle time for semiconductor fabrication

Proceedings of the 40th Conference on Winter Simulation
Queueing Model Improves IBM's Semiconductor Capacity and Lead-Time Management

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since the GI/G/c queue with general batch arrival and batch service patterns cannot be solved exactly, an approximate solution is proposed. The approach is based on a three-part classification of delay: batching time, queueing time and service time, and is subsequently compared with discrete event simulation as benchmark.