EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"multi-class queueing system"
Narrow search

Narrow search

Year of publication
Subject
All
Achievable region 2 Branching bandit 2 Gittins index 2 Imposed priorities 2 Klimov network 2 Multi-class queueing system 2 Parallel scheduling 2 Matching 1 Queueing theory 1 Stochastic Models 1 Warteschlangentheorie 1 bipartite matching 1 first-come-first-served 1 flexibility design 1 multi-class queueing system 1 steady-state analysis 1
more ... less ...
Online availability
All
Undetermined 3
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
Undetermined 2 English 1
Author
All
Glazebrook, K. D. 2 Afèche, Philipp 1 Caldentey, René 1 Gupta, Varun 1
Published in...
All
Computational Statistics 1 Mathematical Methods of Operations Research 1 Operations research 1
Source
All
RePEc 2 ECONIS (ZBW) 1
Showing 1 - 3 of 3
Cover Image
On the optimal design of a bipartite matching queueing system
Afèche, Philipp; Caldentey, René; Gupta, Varun - In: Operations research 70 (2022) 1, pp. 363-401
Persistent link: https://www.econbiz.de/10012820661
Saved in:
Cover Image
An analysis of Klimov's problem with parallel servers
Glazebrook, K. D. - In: Computational Statistics 58 (2003) 1, pp. 1-28
We introduce a family of undiscounted branching bandits on parallel servers under controls which can impose priorities between customer classes. This family can be used to model a wide range of multi-class queueing scheduling problems, with the capacity to incorporate problem features such as...
Persistent link: https://www.econbiz.de/10010759564
Saved in:
Cover Image
An analysis of Klimov's problem with parallel servers
Glazebrook, K. D. - In: Mathematical Methods of Operations Research 58 (2003) 1, pp. 1-28
We introduce a family of undiscounted branching bandits on parallel servers under controls which can impose priorities between customer classes. This family can be used to model a wide range of multi-class queueing scheduling problems, with the capacity to incorporate problem features such as...
Persistent link: https://www.econbiz.de/10010950348
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...