2018
DOI: 10.1080/00207543.2018.1556410
|View full text |Cite
|
Sign up to set email alerts
|

An approximation method for 2-chain flexible queues with preemptive priority

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…Kleinrock [2] proposed a time-dependent priority queue and derived the expressions for the average waiting times for different priorities. Priorities can be classified into two categories [3]: pre-emptive priority [4][5][6], in which a higher-priority customer entering the system will cause any ongoing work to be interrupted, and the maintainer will immediately serve the higher-priority customer, and non-pre-emptive priority [7], in which a customer with priority entering the system will be placed at the front of the queue automatically.…”
Section: Introductionmentioning
confidence: 99%
“…Kleinrock [2] proposed a time-dependent priority queue and derived the expressions for the average waiting times for different priorities. Priorities can be classified into two categories [3]: pre-emptive priority [4][5][6], in which a higher-priority customer entering the system will cause any ongoing work to be interrupted, and the maintainer will immediately serve the higher-priority customer, and non-pre-emptive priority [7], in which a customer with priority entering the system will be placed at the front of the queue automatically.…”
Section: Introductionmentioning
confidence: 99%