{"title":"Wait Time Based Pricing for Queues with Customer-Chosen Service Times","authors":"Chen-An Lin, Kevin H. Shang, Peng Sun","doi":"10.2139/ssrn.3709573","DOIUrl":"https://doi.org/10.2139/ssrn.3709573","url":null,"abstract":"This paper studies a pricing problem for a single-server queue where customers arrive according to a Poisson process. For each arriving customer, the service provider announces a price rate and system wait time. In response, the customer decides whether to join the queue, and, if so, the duration of the service time. The objective is to maximize either the long-run average revenue or social welfare. We formulate this problem as a continuous-time control model whose optimality conditions involve solving a set of delay differential equations. We develop an innovative method to obtain the optimal control policy, whose structure reveals interesting insights. The optimal dynamic price rate policy is not monotone in the wait time. That is, in addition to the congestion effect (the optimal price rate increases in the wait time), we find a compensation effect, meaning that the service provider should lower the price rate when the wait time is longer than a threshold. Compared with the prevalent static pricing policy, our optimal dynamic pricing policy improves the objective value through admission control, which, in turn, increases the utilization of the server. In a numerical study, we find that our revenue-maximizing pricing policy outperforms the best static pricing policy, especially when the arrival rate is low, and customers are impatient. Interestingly, the revenue-maximizing policy also improves social welfare over the static pricing policy in most of the tested cases. We extend our model to consider nonlinear pricing and heterogeneous customers. Nonlinear pricing may improve the revenue significantly, although linear pricing is easier to implement. For the hetergeneous customer case, we obtain similar policy insights as our base model. This paper was accepted by Baris Ata, stochastic models and simulation.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126870719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rachel R. Chen, Subodha Kumar, Jaya Singhal, K. Singhal
{"title":"The Value and Cost of the Customer’s Waiting Time","authors":"Rachel R. Chen, Subodha Kumar, Jaya Singhal, K. Singhal","doi":"10.1287/msom.2020.0914","DOIUrl":"https://doi.org/10.1287/msom.2020.0914","url":null,"abstract":"The (relative) cost of the customer’s waiting time has long been used as a key parameter in queuing models, but it can be difficult to estimate. A recent study introduced a new queue characteristic, the value of the customer’s waiting time, which measures how an increase in the total customer waiting time reduces the servers’ idle time. This paper connects and contrasts these two fundamental concepts in the queuing literature. In particular, we show that the value can be equal to the cost of waiting when the queue is operated at optimal. In this case, we can use the observed queue length to compute the value of waiting, which helps infer the cost of waiting. Nevertheless, these two measures have very different economic interpretations, and in general, they are not equal. For nonoptimal queues, comparing the value with the cost helps shed light on the underlying causes of the customer’s waiting. Although it is tempting to conclude that customers in a queue with a lower value of waiting expect to wait longer, we find that the value of waiting in general does not have a monotonic relationship with the expected waiting time, nor with the expected queue length.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"604 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115188892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Synchronizing Travelling and Waiting Processes: Customer Strategy with an Online Reservation System","authors":"Opher Baron, O. Berman, Lu Wang","doi":"10.2139/ssrn.3536517","DOIUrl":"https://doi.org/10.2139/ssrn.3536517","url":null,"abstract":"Online reservation system allows customers to join a queue and virtually wait for service before arriving on site. For example, some platforms have been designed to collect the information of restaurants and show the real-time congestion levels (e.g., Nowait). We consider a model in which customers must travel from their location to the service site incurring a travelling cost. Upon arrival to the service site the customer may have to wait until the customers ahead finish their service. When customers intend to book service online, they are informed about their positions in the queue at the time of booking, so that they make their decision whether or not to join the queue taking into account both their travelling time and expected waiting time. Intuitively, the more time customers spend on travelling to the site, the less time they have to wait in line. Therefore, there exists a tradeoff between the travelling and waiting cost. We show that if the travelling cost is sufficiently high, the attraction of the service is decreasing in the distance between the customer and service location; and if the travelling cost is negligible, the attraction of the service is increasing in the distance. With such customers behavior, the optimal location strategy of a service site heavily relies on the conditions of the travelling and benefit of the service.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"2 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120973404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Minglong Zhou, G. Loke, Chaithanya Bandi, Z. Q. G. Liau, Wilson Wang
{"title":"Intraday Scheduling with Patient Re-Entries and Variability in Behaviours","authors":"Minglong Zhou, G. Loke, Chaithanya Bandi, Z. Q. G. Liau, Wilson Wang","doi":"10.2139/ssrn.3451911","DOIUrl":"https://doi.org/10.2139/ssrn.3451911","url":null,"abstract":"Problem definition: We consider the intraday scheduling problem in a group of orthopaedic clinics where the planner schedules appointment times, given a sequence of appointments. We consider patient re-entry—where patients may be required to go for an x-ray examination, returning to the same doctor they have seen—and variability in patient behaviours such as walk-ins, earliness, and no-shows, which leads to inefficiency such as long patient waiting time and physician overtime. Academic/practical relevance: In our data set, 25% of the patients are required to go for x-ray examination. We also found significant variability in patient behaviours. Hence, patient re-entry and variability in behaviours are common, but we found little in the literature that could handle them. Methodology: We formulate the problem as a two-stage optimization problem, where scheduling decisions are made in the first stage. Queue dynamics in the second stage are modeled under a P-Queue paradigm, which minimizes a risk index representing the chance of violating performance targets, such as patient waiting times. The model reduces to a sequence of mixed-integer linear-optimization problems. Results: Our model achieves significant reductions, in comparative studies against a sample average approximation (SAA) model, on patient waiting times, while keeping server overtime constant. Our simulations further characterize the types of uncertainties under which SAA performs poorly. Managerial insights: We present an optimization model that is easy to implement in practice and tractable to compute. Our simulations indicate that not accounting for patient re-entry or variability in patient behaviours will lead to suboptimal policies, especially when they have specific structure that should be considered.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130454651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qingxia Kong, Shan Li, Nan Liu, C. Teo, Zhenzhen Yan
{"title":"Appointment Scheduling Under Time-Dependent Patient No-Show Behavior","authors":"Qingxia Kong, Shan Li, Nan Liu, C. Teo, Zhenzhen Yan","doi":"10.1287/mnsc.2019.3366","DOIUrl":"https://doi.org/10.1287/mnsc.2019.3366","url":null,"abstract":"This paper studies how to schedule medical appointments with time-dependent patient no-show behavior and random service times. The problem is motivated by our studies of independent datasets from c...","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116999919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Value Iteration Proof of the Three-Server Heterogeneous Server Problem","authors":"Yu Zhang, Shiliang Cui, Kaili Li, Jinting Wang","doi":"10.2139/ssrn.3306578","DOIUrl":"https://doi.org/10.2139/ssrn.3306578","url":null,"abstract":"We study a three-server queueing system where servers are heterogeneous in terms of their service speed. The goal of the system operator is to find an optimal routing strategy, which assigns each customer to a server, in order to minimize all customers' expected sojourn time in the system. Using a value iteration approach, we establish that the optimal routing policy is of a threshold type. In addition, suppose the service speed of server-1 is greater than that of server-2 which is greater than that of server-3, it is found that the optimal routing threshold of server-2 when server-3 is busy, is no greater than the optimal routing threshold of server-3 or that of server-2 when server-3 is idle. Finally, we employ numerical experiments to demonstrate sensitivity analysis.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125834915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Fluid Model for an Overloaded Bipartite Queueing System with Heterogeneous Matching Utility","authors":"Yichuan Ding, S. McCormick, M. Nagarajan","doi":"10.2139/ssrn.2854492","DOIUrl":"https://doi.org/10.2139/ssrn.2854492","url":null,"abstract":"We consider a bipartite queueing system (BQS) with multiple types of servers and customers, where different customer-server combinations may generate different utilities. Whenever a server is available, it serves the customer with the highest index, which is the sum of a customer's waiting index and the matching index. We call this an {em M W} index. We assume that the waiting index is an increasing function of a customer's waiting time and the matching index depends on both the customer's and the server's types. We develop a fluid model to approximate the behavior of such a BQS system, and show that the fluid limit process can be computed over any finite horizon. We develop an efficient algorithm to check whether a steady state of the fluid process exists or not. When a steady state exists, the algorithm also computes one efficiently. We prove that there can be at most one steady state, and that the fluid limit process converges to the steady state under mild conditions. These results enable a policy designer to predict the behavior of a BQS when using an M W index, and to choose an indexing formula that optimizes a given set of performance metrics. We derive a closed-form M W index that optimizes the steady-state performance according to some well-known efficiency and fairness metrics.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"132 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132914563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Structural Estimation Approach to Agent Attrition","authors":"S. Emadi, B. Staats","doi":"10.2139/ssrn.3180225","DOIUrl":"https://doi.org/10.2139/ssrn.3180225","url":null,"abstract":"Worker attrition is a costly and operationally disruptive challenge throughout the world. Although large bodies of research have documented drivers of attrition and its operational consequences, managers still lack an integrated approach to understanding attrition and making decisions to address it on a forward-going basis. To fill this need, we build a structural model that captures both the firm's decision to terminate a workers' employment (involuntary attrition) and uses an optimal stopping problem process to model a workers' decision to leave the firm (voluntary attrition). We then estimate the parameters of the model and conduct counterfactual analyses on the population of 1,135 agents serving one client over four years for an Indian business process management (BPM) company. Our model reveals a number of interesting findings as we see that agents' voluntary attrition decisions are relatively insensitive to salary. We also find that supervisors have a strong impact on whether employees stay as they reshape the way that agents make their decisions. If all employees were managed by the best supervisor in our data then voluntary attrition would reduce by over 40%. Altogether our paper contributes to the burgeoning literature on people operations, as well as to managerial practice.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Equilibrium Strategies in M/M/1 Priority Queues with Balking","authors":"Jinting Wang, Shiliang Cui, Zhongbin Wang","doi":"10.2139/ssrn.2911419","DOIUrl":"https://doi.org/10.2139/ssrn.2911419","url":null,"abstract":"We consider an M/M/1 queueing system with a pay-for-priority option, and study customers' joint decisions between joining/balking and pay-for-priority. The equilibrium strategies are thus two-dimensional. First, we fully characterize the equilibrium structure and identify the Pareto-dominant strategies of such a game analytically, under both the observable and unobservable settings. Interestingly, the equilibrium structure, the system throughput, and the service provider's optimal price for priority premium can all be non-monotone in the service reward, which departs from the existing models of priority queues without balking. In particular, we fi nd that an increase in service reward can actually hurt the firm's revenue (everything else being equal). Second, we compare the server's revenue between the observable and the unobservable settings. We find that the service provider is better off with the observable setting when the system load is either low or high, but benefi ts more from the unobservable setting when the system load is medium. The fact that the optimal setting switches twice as the system load increases, is rather interesting; we explain the intuitions behind it in this paper. Finally, we demonstrate the implications of these fi ndings by applying our model framework to Papa John's Pizza, based on publicly available information. Our analysis suggests that Papa John's could benefi t from providing customers with wait information while slightly decreasing its fee for Papa Priority.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"7 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133915271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yichuan Ding, Eric Park, Mahesh Nagarajan, Eric Grafstein
{"title":"Patient Prioritization in Emergency Department Triage Systems: An Empirical Study of Canadian Triage and Acuity Scale (CTAS)","authors":"Yichuan Ding, Eric Park, Mahesh Nagarajan, Eric Grafstein","doi":"10.2139/ssrn.2843932","DOIUrl":"https://doi.org/10.2139/ssrn.2843932","url":null,"abstract":"Emergency departments (EDs) typically use a triage system to classify patients into priority levels. However, most triage systems do not specify how exactly to route patients within the assigned triage levels, hence, decision makers in EDs often have to use their own discretion to route patients. Also, how patient waiting is perceived and accounted for in ED operations is not clearly understood. In this paper, we identify the ED patient waiting cost structure perceived by the ED patient-routing decision maker, based on patient ED visit data, and derive policy implications and make suggestions for improving triage systems. We analyze the patient routing behaviors of ED decision makers in four EDs in the metro Vancouver, British Columbia area. They all use the Canadian Triage and Acuity Scale (CTAS), which has a wait time-related target service level objective. We propose a general discrete choice framework, consistent with queueing literature, as a tool to analyze prioritization behaviors in multi-class queues under mild assumptions. We find that the decision makers in all four EDs 1) apply a delay-dependent (dynamic) prioritization across different triage levels; 2) have a perceived marginal ED patient waiting cost that is best fit by a piece-wise linear concave function in wait time; 3) generally follow, in the same triage level, the first-come first-served (FCFS) principle, but their adherence to the principle decreases for patients who wait past a certain threshold; and 4) do not use patient-complexity as a major criterion in prioritization decisions.","PeriodicalId":348642,"journal":{"name":"Queuing Theory eJournal","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127568890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}