On the Problem of Batch Arrivals and its Application to a Scheduling System

A. Soriano
Additional contact information
A. Soriano: Institute for Defense Analyses, Arlington, Virginia

Operations Research, 1966, vol. 14, issue 3, 398-408

Abstract: The single-server queuing problem where customers arrive in batches is considered with general types of service time and batch interarrival time distributions. Following an argument similar to that of Lindley, transient and steady-state time distribution functions are obtained for the two processes: (i) a random batch size, and (ii) a periodic batch size. It is shown how to apply the general solution of the process with a random batch size in obtaining particular solutions for the cases with p 2 = 1, q 1 = 1, and (1) M / G /1 or (2) D / E /1. The latter solution has been used in a comparison of two scheduling systems.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.3.398 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:14:y:1966:i:3:p:398-408

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().