Abstract
Priority queueing systems in discrete time have not yet attained the degree of maturity as their counterparts in continuous time. Caution is needed in paralleling the continuous-time analysis, because instants of arrival and service completions may coincide when restricted to regularly spaced epochs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Heidelberg
About this paper
Cite this paper
Kramer, M. (1990). Discrete-Time Queues with Intermittently Available Server and Preemptive Priorities. In: Kistner, KP., Ahrens, J.H., Feichtinger, G., Minnemann, J., Streitferdt, L. (eds) Papers of the 18th Annual Meeting / Vorträge der 18. Jahrestagung. Operations Research Proceedings, vol 1989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75639-9_84
Download citation
DOI: https://doi.org/10.1007/978-3-642-75639-9_84
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52489-2
Online ISBN: 978-3-642-75639-9
eBook Packages: Springer Book Archive