The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without...
The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without switch-over times
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
A 2-queue system with a single-server operating according to the combined ‘Join the Shortest Queue–Serve the Longest Queue’ regime is analyzed. Both cases, with or without server’s switch-over times, are investigated under the non-preemptive discipline. Instead of dealing with a state space comprised of two un-bounded dimensions, a non-conventional...
Alternative Titles
Full title
The non-preemptive ‘Join the Shortest Queue–Serve the Longest Queue’ service system with or without switch-over times
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_3050331222
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_3050331222
Other Identifiers
ISSN
1432-2994
E-ISSN
1432-5217
DOI
10.1007/s00186-023-00848-7
