Simulation-based transfer function modeling for transient analysis of general queueing systems
This paper is concerned with characterizing the transient behavior of general queueing systems, which is widely known to be notoriously difficult. The objective is to develop a statistical methodology, integrated with extensive offline simulation and preliminary queueing analysis, for the estimation of a small number of transfer function models (TFMs) that quantify the input–output dynamics of a general queueing system. The input here is the time-varying arrival rate of jobs to the system; the time-dependent output performances include the departure rate of jobs and the mean of the work in process (i.e., number of jobs in the system). The resulting TFMs are difference equations, like the discrete approximations of the ordinary differential equations provided by an analytical approach, while possessing the high fidelity of simulation. Our method is expected to overcome the shortcomings of the existing transient analysis approaches, i.e., the computational burden of simulation and the lack of fidelity of analytical queueing models.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Zapfel, G. & Missbauer, H., 1993. "Production Planning and Control (PPC) systems including load-oriented order release -- Problems and research perspectives," International Journal of Production Economics, Elsevier, vol. 30(1), pages 107-122, July.
- Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
- Otis B. Jennings & Avishai Mandelbaum & William A. Massey & Ward Whitt, 1996. "Server Staffing to Meet Time-Varying Demand," Management Science, INFORMS, vol. 42(10), pages 1383-1394, October.
- Lawrence M. Leemis, 1991. "Nonparametric Estimation of the Cumulative Intensity Function for a Nonhomogeneous Poisson Process," Management Science, INFORMS, vol. 37(7), pages 886-900, July.
- Stephen G. Eick & William A. Massey & Ward Whitt, 1993. "Mt/G/\infty Queues with Sinusoidal Arrival Rates," Management Science, INFORMS, vol. 39(2), pages 241-252, February.
- Michael H. Rothkopf & Shmuel S. Oren, 1979. "A Closure Approximation for the Nonstationary M/M/s Queue," Management Science, INFORMS, vol. 25(6), pages 522-534, June.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:223:y:2012:i:1:p:150-166. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.