Algorithms for Network Programming
Algorithms for Network Programming
Hi-index | 0.00 |
This note compares the performance of a queuing system in which customers can enter service only at multiples of the service time to the ordinary counterpart for both G/D/1 and M/D/1 systems. We show that the two modes of operation differ by at most one customer at any point in time. We give motivation for the use of a limited entry queuing system as a model for use in material handling analysis.