Analysis of job assignment with batch arrivals among heterogeneous servers

DOI10.1016/j.ejor.2011.09.001zbMath1244.90055OpenAlexW2049951785MaRDI QIDQ439346

Zhongju Zhang, John N. 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

zbMATH Keywords

batch arrivalparallel queuesthreshold policyjob assignment

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (2)

Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal control of queueing systems with heterogeneous servers
• Dynamic routing in large-scale service systems with heterogeneous servers
• Design of manufacturing systems using queueing models
• Analysis of the asymmetrical shortest two-server queueing model
• Optimization of static traffic allocation policies
• Discrete-event control of stochastic networks: multimodularity and regularity.
• To queue or not to queue: equilibrium behavior in queueing systems.
• The price of anarchy in an exponential multi-server
• 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
• Analysis of the asymmetric shortest queue problem
• TWO QUEUES IN PARALLEL
• Waiting Lines with Heterogeneous Servers
• Two Similar Queues in Parallel
• Optimal control of a queueing system with two heterogeneous servers
• On the Assignment of Customers to Parallel Queues
• The shortest queue model with jockeying
• J.comput. appl. math
• Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
• The shortest queue problem
• Deciding Which Queue to Join: Some Counterexamples
• 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
• Two queues in parallel
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• Optimal control of a queueing system with heterogeneous servers and setup costs
• A new heavy traffic limit for the asymmetric shortest queue problem
• On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers
• HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING
• 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
• Two-Server Markovian Queues with Balking: Heterogeneous vs. Homogeneous Servers
• Monotone control of queueing systems with heterogeneous servers

This page was built for publication: Analysis of job assignment with batch arrivals among heterogeneous servers