ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

DOI10.1017/S0269964802162048zbMath1014.90021OpenAlexW2151608698MaRDI QIDQ4548062

Nicholas Bambos, George Michailidis

Publication date: 21 August 2002

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964802162048

zbMATH Keywords

queuesallocating

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (6)

Understanding the marginal impact of customer flexibility ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Queueing and scheduling in random environments ⋮ Multiple-server system with flexible arrivals ⋮ Queueing networks of random link topology: stationary dynamics of maximal throughput schedules ⋮ Partial Flexibility in Routeing and Scheduling

This page was built for publication: ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS