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:"Generalized round robin routing"
Narrow search

Narrow search

Year of publication
Subject
All
Generalized round robin routing 2 Graph order 2 Periodic sequence 2 Unbalance 2
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
Undetermined 2
Author
All
Hordijk, Arie 2 Laan, Dinard van der 2
Published in...
All
Computational Statistics 1 Mathematical Methods of Operations Research 1
Source
All
RePEc 2
Showing 1 - 2 of 2
Cover Image
The unbalance and bounds on the average waiting time for periodic routing to one queue
Hordijk, Arie; Laan, Dinard van der - In: Computational Statistics 59 (2004) 1, pp. 1-23
In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the...
Persistent link: https://www.econbiz.de/10010847948
Saved in:
Cover Image
The unbalance and bounds on the average waiting time for periodic routing to one queue
Hordijk, Arie; Laan, Dinard van der - In: Mathematical Methods of Operations Research 59 (2004) 1, pp. 1-23
In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the...
Persistent link: https://www.econbiz.de/10010950328
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...