On the optimal assignment of customers to parallel servers

From MaRDI portal
Revision as of 11:46, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4157788

DOI10.2307/3213411zbMath0378.60095OpenAlexW2064823719MaRDI QIDQ4157788

Richard R. Weber

Publication date: 1978

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213411




Related Items

To Pool or Not to Pool: Queueing Design for Large-Scale Service SystemsPerformance balancing size-interval routing policiesChoosing among heterogeneous server cloudsStochastically minimizing the number of customers in exponential queueing systemsDelay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable ServersPractical load balancing for content requests in peer-to-peer networksMultiscale Q-learning with linear function approximationOptimal QoS control of interacting service stationsDynamic routing to heterogeneous collections of unreliable serversOn computing average cost optimal policies with application to routing to parallel queuesShortest expected delay routing for Erlang serversDynamic routing in distinguishable parallel queues: an application of product returns for remanufacturingA load balancing system in the many-server heavy-traffic asymptoticsOptimal control of multiclass parallel service systemsOptimality of the shortest line discipline with state-dependent service ratesSample path methods in the control of queuesUnderstanding the marginal impact of customer flexibilityScalable Load Balancing in Networked Systems: A Survey of Recent AdvancesPerformance bounds for the effectiveness of pooling in multi-processing systemsStationary analysis of the shortest queue problemStability of Parallel Server SystemsStochastic coordination in heterogeneous load balancing systemsSTRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUESOn Accommodating Customer Flexibility in Service SystemsOptimal Routing of Fixed Size Jobs to Two Parallel ServersOptimal control of a queueing system with an exponential and an Erlangian server and renewal input streamUniversality of Power-of-d Load Balancing in Many-Server SystemsMonotonicity properties of user equilibrium policies for parallel batch systemsPersistent-Idle Load-DistributionAnalysis of job assignment with batch arrivals among heterogeneous serversMaximizing throughput in finite-source parallel queue systemsA conservative index heuristic for routing problems with multiple heterogeneous service facilitiesScheduling service in tandem queues attended by a single serverTransform Methods for Heavy-Traffic AnalysisOptimality of routing and servicing in dependent parallel processing systemsSteady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regimeOptimal dynamic load distribution in a class of flow-type flexible manufacturing systemsAn Overview for Markov Decision Processes in Queues and NetworksOn the Value Function of the M/G/1 FCFS and LCFS QueuesOn the average optimality of circular assignment policyMulti-layered round robin routing for parallel serversTask allocation in multiserver systems -- a survey of results.Dynamic routing in open queueing networks: Brownian models, cut constraints and resource poolingA survey of Markov decision models for control of networks of queuesMartingales and buffer overflow for the symmetric shortest queue modelJoin the Shortest Queue with Many Servers. The Heavy-Traffic AsymptoticsPower-of-d-Choices with Memory: Fluid Limit and OptimalityAsymptotic Optimality of Power-of-d Load Balancing in Large-Scale SystemsThroughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systemsDYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEMUser-Optimal State-Dependent Routeing in Parallel Tandem Queues with LossMultiple-server system with flexible arrivalsDynamic Scheduling of a Four-Station Queueing NetworkOn the Optimality of the Generalized Shortest Queue PolicyOn the Shortest Queue Policy for the Tandem Parallel QueueCHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERSPartial Flexibility in Routeing and SchedulingA general ``power-of-\(d\) dispatching framework for heterogeneous systemsSignaling for decentralized routing in a queueing networkControl of arrivals to two queues in seriesSystem planning and configuration problems for optimal system designDynamics of the Non-Homogeneous Supermarket ModelA nonparametric predictive method for queues