Computational Procedures for a Class of GI/D/k Systems in Discrete Time
A class of discrete time GI/D/k systems is considered for which the interarrival times have finite support and customers are served in first-in first-out (FIFO) order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2009-01-01
|
Series: | Journal of Probability and Statistics |
Online Access: | http://dx.doi.org/10.1155/2009/716364 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|