On the Assignment of Customers to Parallel Queues
From MaRDI portal
Publication:3416065
DOI10.1017/S0269964800002692zbMath1134.90341MaRDI QIDQ3416065
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Related Items
Assigning multiple job types to parallel specialized servers, OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES, SERVER COORDINATION IN QUEUEING SYSTEMS: WHEN AND HOW?, Optimal policies for the berth allocation problem under stochastic nature, Insensitive versus efficient dynamic load balancing in networks without blocking, Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing, Zero-sum Markov games and worst-case optimal control of queueing systems, Optimal repairman assignment in two symmetric maintenance models, Waiting time based routing policies to parallel queues with percentiles objectives, Optimal Routing of Fixed Size Jobs to Two Parallel Servers, A case for on-machine load balancing, Analysis of job assignment with batch arrivals among heterogeneous servers, Maximizing throughput in finite-source parallel queue systems, A conservative index heuristic for routing problems with multiple heterogeneous service facilities, On the scheduling of operations in a chat contact center, Asymptotically optimal control of parallel tandem queues with loss, Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster, Admission control strategies for tandem Markovian loss systems, User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss, Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs, The M/M/c with critical jobs, Signaling for decentralized routing in a queueing network, Stochastic scheduling games with Markov decision arrival processes, A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: Existence and approximation
- Optimality of routing and servicing in dependent parallel processing systems
- Throughput maximization in a loss queueing system with heterogeneous servers
- Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization
- On the optimal assignment of servers and a repairman
- The µc-rule is not optimal in the second node of the tandem queue: a counterexample
- Optimality of the shortest line discipline
