Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 28 (2018): Issue 4 (December 2018)
Open Access
From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times
Dieter Fiems
Dieter Fiems
and
Stijn De Vuyst
Stijn De Vuyst
| Jan 11, 2019
International Journal of Applied Mathematics and Computer Science
Volume 28 (2018): Issue 4 (December 2018)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Jan 11, 2019
Page range:
695 - 704
Received:
Jan 23, 2018
Accepted:
Jun 20, 2018
DOI:
https://doi.org/10.2478/amcs-2018-0053
Keywords
queueing system
,
preemptive priority
,
server interruption
,
server breakdown
,
exhaustive vacations
© 2019 Dieter Fiems, Stijn De Vuyst, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
Dieter Fiems
Department of Telecommunications and Information Processing Ghent University, St-Pietersnieuwstraat 41, 9000
Gent, Belgium
Stijn De Vuyst
Department of Industrial Systems Engineering and Product Design Ghent University, Technologiepark 3, 9052
Zwijnaarde, Belgium