Analysis of job assignment with batch arrivals among heterogeneous servers
DOI10.1016/J.EJOR.2011.09.001zbMATH Open1244.90055OpenAlexW2049951785MaRDI QIDQ439346FDOQ439346
Authors: Zhongju Zhang, John Daigle
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.001
Recommendations
- Managing Queues with Heterogeneous Servers
- Routing jobs with deadlines to heterogeneous parallel servers
- On the static assignment to parallel servers
- An assignment problem for a parallel queueing system with two heterogeneous servers
- Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay
Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Stochastic network models in operations research (90B15)
Cites Work
- The price of anarchy in an exponential multi-server
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Design of manufacturing systems using queueing models
- Title not available (Why is that?)
- To queue or not to queue: equilibrium behavior in queueing systems.
- Optimal control of a queueing system with two heterogeneous servers
- On the optimal assignment of customers to parallel servers
- Waiting Lines with Heterogeneous Servers
- On the Assignment of Customers to Parallel Queues
- Optimality of the shortest line discipline
- Two-Server Markovian Queues with Balking: Heterogeneous vs. Homogeneous Servers
- Dynamic routing in large-scale service systems with heterogeneous servers
- Analysis of the asymmetrical shortest two-server queueing model
- Analysis of the asymmetric shortest queue problem
- Two Similar Queues in Parallel
- J.comput. appl. math
- The shortest queue problem
- Deciding Which Queue to Join: Some Counterexamples
- Two queues in parallel
- Optimal control of a queueing system with heterogeneous servers and setup costs
- Optimal control of queueing systems with heterogeneous servers
- HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING
- Optimization of static traffic allocation policies
- Discrete-event control of stochastic networks: multimodularity and regularity.
- Web server load balancing: a queueing analysis
- Analysis of two queues in parallel with jockeying and restricted capacities
- On the infinite server shortest queue problem: non-symmetric case
- TWO QUEUES IN PARALLEL
- The shortest queue model with jockeying
- Title not available (Why is that?)
- Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- Title not available (Why is that?)
- A new heavy traffic limit for the asymmetric shortest queue problem
- Title not available (Why is that?)
- On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
- On Jockeying in Queues
- The optimal control of heterogeneous queueing systems: a paradigm for load-sharing and routing
- Title not available (Why is that?)
- Monotone control of queueing systems with heterogeneous servers
Cited In (9)
- Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration
- To split or not to split: selecting the right server with batch arrivals
- Job assignment in large-scale service systems with affinity relations
- Modelling and analysis of a multi-stage system involving batch processors with incompatible job families
- Optimal server assignment for a multiple customer classes problem
- Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay
- Tug scheduling for hinterland barge transport: a branch-and-price approach
- Steady-state analysis for multiserver queues under size interval task assignment in the quality-driven regime
- Comparing job allocation schemes where service demand is unknown
This page was built for publication: Analysis of job assignment with batch arrivals among heterogeneous servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439346)