Bad luck when joining the shortest queue

Blanc, J.P.C.

doi:10.1016/j.ejor.2008.01.037

Cited by 13 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, the phenomenon has long been and continues to be incorporated in some form in mathematical models (cf. Blanc 2009, Glazer 1958, Koenigsberg 1966, Zhao and Grassmann 1990. Associated discussions, such as that provided by the classic work of Larson (1987), provide additional rich descriptions of some of the Note: Arrows capture the flow of information and the direction of causality.…”

Section: Putting It Together: Group Dynamicsmentioning

confidence: 99%

Bodies of Knowledge for Research in Behavioral Operations

Bendoly¹,

Croson²,

Gonçalves

et al. 2010

Production and Operations Management

296

260

View full text Add to dashboard Cite

Whenever intrepid researchers venture into new terrain, they find that they require knowledge outside of their formal training. This paper reviews bodies of knowledge for operations management (OM) researchers interested in the new area of Behavioral Operations. We highlight theoretical constructs and empirical phenomena from cognitive psychology, social psychology, group dynamics, and system dynamics. We also provide a guide for where to go to learn more about each body of knowledge. Our overall goal is to lower the startup costs for new researchers in Behavioral Operations.

show abstract

Section: Putting It Together: Group Dynamicsmentioning

confidence: 99%

Bodies of Knowledge for Research in Behavioral Operations

Bendoly¹,

Croson²,

Gonçalves

et al. 2010

Production and Operations Management

296

260

View full text Add to dashboard Cite

show abstract

“…Knessl (2005, 2006) provided an asymptotic analysis for a model with two M/M/∞ queues where a new arrival is routed to the queue with the smaller number of customers, by establishing and analyzing a bi-variate generating function for the number of customers in each queue. Blanc (2009) studied a non-symmetric multi-server Markovian system where customers follow the JSQ policy, and quantified the probability that a customers's service would have started earlier if one had joined another queue than the queue that was actually chosen.…”

Section: Introductionmentioning

confidence: 99%

A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy

Perel¹,

Perel²,

Yechiali³

2022

Preprint

View full text Add to dashboard Cite

In 1987, J.W. Cohen analyzed the so-called Serve the Longest Queue (SLQ) queueing system, where a single server attends two non-symmetric M/G/1-type queues, exercising a nonpreemptive priority switching policy. Cohen further analyzed in 1998 a non-symmetric 2-queue Markovian system, where newly arriving customers follow the Join the Shortest Queue (JSQ) discipline. The current paper generalizes and extends Cohen's works by studying a combined JSQ-SLQ model, and by broadening the scope of analysis to a non-symmetric 3-queue system, where arriving customers follow the JSQ strategy and a single server exercises the preemptive priority SLQ discipline. The system states' multi-dimensional probability distribution function is derived while applying a non-conventional representation of the underlying process's statespace. The analysis combines both Probability Generating Functions and Matrix Geometric methodologies. It is shown that the joint JSQ-SLQ operating policy achieves extremely well the goal of balancing between queue sizes. This is emphasized when calculating the Gini Index associated with the differences between mean queue sizes: the value of the coefficient is close to zero. Extensive numerical results are presented.

show abstract

“…The abovementioned analyses, except for the stair-escalator choice studied by Ji et al [28], were based on evacuation cases; however, there are few studies concerning the management of a queueing system with a choice of service windows. Furthermore, even though Blanc explored the probability that pedestrians lined up in shorter queues would suffer longer waiting times [35], to our knowledge, choices affected by queues to target service windows have not been sufficiently studied. Therefore, we tackled these two lapses by addressing the floor management of a queueing system and considering the queue to be an important element when choosing a service window.…”

Section: Introductionmentioning

confidence: 99%

Exclusive queueing model including the choice of service windows

Tanaka

Yanagisawa

Nishinari

2018

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells.We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates.The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

show abstract

Bad luck when joining the shortest queue

Cited by 13 publications

References 21 publications

Bodies of Knowledge for Research in Behavioral Operations

Bodies of Knowledge for Research in Behavioral Operations

A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy

Exclusive queueing model including the choice of service windows

Contact Info

Product

Resources

About