The Impact of Revenue‐Maximizing Priority Pricing on Customer Delay Costs

Speed is an increasingly important determinant of which suppliers will be given customers' business and is defined as the time between when an order is placed by the customer and when the product is delivered, or as the amount of time customers must wait before they receive their desired service. In either case, the speed a customer experiences can be enhanced by giving priority to that particular customer. Such a prioritization scheme will necessarily reduce the speed experienced by lower‐priority customers, but this can lead to a better outcome when different customers place different values on speed. We model a single resource (e.g., a manufacturer) that processes jobs from customers who have heterogeneous waiting costs. We analyze the price that maximizes priority revenue for the resource owner (i.e., supplier, manufacturer) under different assumptions regarding customer behavior. We discover that a revenue‐maximizing supplier facing self‐interested customers (i.e., those that independently minimize their own expected costs) charges a price that also minimizes the expected total delay costs across all customers and that this outcome does not result when customers coordinate to submit priority orders at a level that seeks to minimize their aggregate costs of priority fees and delays. Thus, the customers are better off collectively (as is the supplier) when the supplier and customers act independently in their own best interests. Finally, as the number of priority classes increases, both the priority revenues and the overall customer delay costs improve, but at a decreasing rate.     

Pricing and Operational Performance in Discretionary Services

In many services, for example, website or landscape design, the value or quality derived by a customer depends upon the service time, and this valuation differs across customers. Customers procure the service based on the expected value to be delivered, prices charged, and the timeliness of service. We investigate the performance of the optimal pricing scheme as well as two commonly used pricing schemes (fixed fee and time‐based pricing) for such services on important dimensions such as revenue, demand served, and utilization. We propose a novel model that captures the above features and wherein both service rate and demand are endogenous and functions of the pricing scheme. In particular, service time is an outcome of the pricing scheme adopted and the heterogeneous valuations of customers, unlike in the queueing‐based pricing literature. We find that the service system may benefit from a greater variance in consumer valuations, and the performance of pricing schemes is impacted by the shape of the distribution of customers' valuation of service time and the responsiveness desired by customers. Both the fixed fee and time‐based schemes do well relative to the optimal pricing scheme in terms of revenue in many plausible scenarios, but there are substantial differences between the pricing schemes in some important operational metrics. For instance, the fixed fee scheme serves more customers and has higher utilization than the time‐based scheme. We also explore variants of the fixed and time‐based schemes that have better revenue performance and show that the two‐part tariff which is a combination of fixed and time‐based pricing can do as well as the optimal scheme in terms of revenue.     

Self‐Service Operations at Retail Stores: The Role of Inter‐Customer Interactions

Inter‐customer interactions are important to the operation of self‐services in retail settings. More specifically, when self‐service terminals are used as part of customers’ checkout processes in retail operations without the explicit involvement of retailers as the direct service providers, inter‐customer interactions become a significant managerial issue. In this article, we examine the impact of inter‐customer interactions at retail self‐service terminals on customers’ service quality perceptions and repeat purchase intentions at retail stores. We conduct a scenario‐based experimental design (N = 674) using a 2 × 2 factorial design in which inter‐customer interactions are divided into “positive” vs. “negative” and occur during the “waiting” or during the actual “transaction” stages of self‐services at a retail store. We use attribution theory to develop the hypotheses. The results demonstrate that, through their interactions, fellow customers can exert influences on a focal customer's quality perceptions and repeat purchasing intentions toward a retail store. Furthermore, these influences were impacted by how customers attribute blame or assign responsibility toward the retail store. Service operations managers should leverage these interactions by designing into self‐service settings the capacities and interfaces that are best suited for customers’ co‐production of their self‐service experiences.     

效率参数不可观测下的SaaS云外包合约研究

客户企业在实施SaaS（软件即服务,Software as a Service）云外包时,面临因效率参数不可观测所引发的云服务提供商（Cloud Service Provider,CSP）道德风险问题。针对该问题,以激励机制设计方法为基础,以客户企业期望收益最大化为目标,在服务产出为公共信息,而效率参数信息为CSP私人信息下研究如何通过外包合约的设计诱使CSP显示出真实的信息,并付出最优的努力水平。研究表明,最优努力水平、服务报酬支付是效率参数的减函数;客户企业向CSP提供的最优合约可以用线性合约表示;在由固定服务报酬及收益共享构成的线性合约中,效率参数与固定服务报酬支付正相关,与收益共享系数负相关。     

Managing Clearance Sales in the Presence of Strategic Customers

We study the effect of strategic customer behavior on pricing and rationing decisions of a firm selling a single product over two periods. The seller may limit the availability of the product (that is, ration) in the second (clearance) period. Some customers are strategic and respond to the firm's decisions by timing their purchases. When capacity is nonconstraining and the seller has pricing flexibility, we show that rationing in the clearance period cannot improve revenue. However, when prices are fixed in advance, rationing can improve revenue. In the latter case, we conduct a detailed analysis for linear and exponential demand curves and derive explicit expressions for optimal rationing levels. We find that the policy of doing the better of not restricting availability at the clearance price or not offering the product at the clearance price is typically near optimal. Our analysis also suggests that rationing—although sometimes offering considerable benefit over allowing unrestricted availability in the clearance period—may allow the seller to obtain only a small fraction of the optimal revenue when the prices are chosen optimally without rationing. We extend the analysis to cases where the capacity is constraining and obtain similar results.     

Quality‐Speed Competition in Customer‐Intensive Services with Boundedly Rational Customers

We consider a system in which two competing servers provide customer‐intensive services and the service reward is affected by the length of service time. The customers are boundedly rational and choose their service providers according to a logit model. We demonstrate that the service provider revenue function is unimodal in the service rate, its decision variable, and show that the service rate competition has a unique and stable equilibrium. We then study the price decision under three scenarios with the price determined by a revenue‐maximizing firm, a welfare‐maximizing social planner, or two servers in competition. We find that the socially optimal price, subject to the requirement that the customer actual utility must be non‐negative, is always lower than the competition equilibrium price which, in turn, is lower than the revenue‐maximizing monopoly price. However, if the customer actual utility is allowed to be negative in social optimization, the socially optimal price can be higher than the other two prices in a large market.     

Staffing Call Centers with Uncertain Arrival Rates and Co‐sourcing

In a call center, staffing decisions must be made before the call arrival rate is known with certainty. Once the arrival rate becomes known, the call center may be over‐staffed, in which case staff are being paid to be idle, or under‐staffed, in which case many callers hang‐up in the face of long wait times. Firms that have chosen to keep their call center operations in‐house can mitigate this problem by co‐sourcing; that is, by sometimes outsourcing calls. Then, the required staffing N depends on how the firm chooses which calls to outsource in real time, after the arrival rate realizes and the call center operates as a M/M/N + M queue with an outsourcing option. Our objective is to find a joint policy for staffing and call outsourcing that minimizes the long‐run average cost of this two‐stage stochastic program when there is a linear staffing cost per unit time and linear costs associated with abandonments and outsourcing. We propose a policy that uses a square‐root safety staffing rule, and outsources calls in accordance with a threshold rule that characterizes when the system is “too crowded.” Analytically, we establish that our proposed policy is asymptotically optimal, as the mean arrival rate becomes large, when the level of uncertainty in the arrival rate is of the same order as the inherent system fluctuations in the number of waiting customers for a known arrival rate. Through an extensive numerical study, we establish that our policy is extremely robust. In particular, our policy performs remarkably well over a wide range of parameters, and far beyond where it is proved to be asymptotically optimal.     

基于顾客不公平规避的服务定价研究

设计合理的服务机制和定价策略对于企业运营至关重要。由于顾客异质性（等待时间成本不同）企业通常对顾客进行分类服务,然而分类服务会引发顾客的不公平心理,并带来负效用,从而引起顾客流动与转移,进而影响企业收益与社会成本。本文针对垄断型服务系统中,顾客不公平规避心理（用参数α表示）对于企业优化目标的影响进行分析,在此基础之上,研究企业是否对顾客采取分类服务以及如何合理定价。结果表明,当顾客不公平规避偏好心理较弱时,从社会成本最小化和企业收益最大化的角度都应该对顾客进行分类服务并收取优先服务费用。当顾客不公规避心理较强时,从企业收益最大化的角度应仅保留优先权顾客并收取优先服务费用,从社会成本最小化的角度则应取消优先服务费用仅保留普通顾客。最后,通过数值模拟和理论分析对上述结论进行验证。     

基于异质性顾客心理期望等待时间的优先权服务定价研究

本文以非抢占式M/M/1排队系统为背景,以企业收益最大化为目标,基于顾客异质性(单位时间等待成本不同)将顾客分为两类,针对顾客的心理期望等待时间对服务提供商最优定价策略的影响进行研究。首先研究优先权顾客心理期望等待时间对企业收益的影响以及相应的优先权定价,然后研究优先权顾客和普通顾客同时存在心理期望等待时间对企业收益的影响和相应的优先权定价。研究表明:仅考虑优先权顾客的心理期望等待时间,企业应通过提高优先权定价来获得最优收益;当优先权顾客和普通顾客同时存在心理期望等待时间时,企业仍然采取提高优先权定价的策略,若普通顾客的价值大(获取服务的基本费用大),企业应对普通顾客提供一定的折扣来消除其心理期望等待时间增加企业收益;如果普通顾客的价值较小,企业应"有意"流失部分普通顾客,吸引更多顾客到优先权队列获取服务来获得更多收益。本文研究对于服务提供商在考虑顾客心理期望等待时间基础上设置最合理的队列机制有一定的指导意义和实际应用价值。     

Competition and Coordination in Two‐Tier Public Service Systems under Government Fiscal Policy

As a result of government budgetary limits and rapid market growth, many public service systems—such as health care—are characterized by extensive customer wait times that have become a serious problem. This problem might be solved by allowing private firms to enter these markets, which would provide customers with a choice between a free (governmental) public service provider (SP) and a fee‐charging (or “toll”) private SP. In such a two‐tier service system, the two SPs are differentiated by service quality and cost efficiency. This study focuses on the competition and coordination issues for two‐tier service systems with customers who are sensitive to both service quality and delay. The free system attempts to maximize its expected total customer utility with limited capacity, whereas the toll system attempts to maximize its profit. Neither goal is aligned with the social welfare goal of the public service. To achieve the social welfare goal, the government plays a crucial role in coordinating the two‐tier service system via the budget, the tradeoff of social members' goals, and tax‐subsidy policies. Using a mixed duopoly game, we establish Nash equilibrium strategies and identify the conditions for the existence of the two‐tier service system. We employ several interesting and counter‐intuitive managerial insights generated by the model to show that the public service can be delivered more efficiently via customer choice and SP competition. In addition, we show that a relatively low tax‐subsidy rate can almost perfectly coordinate the two SPs to achieve most of the maximum possible benefit of the two‐tier service system.     

Strategic Management of Distressed Inventory

It is well known that maximizing revenue from a fixed stock of perishable goods may require discounting prices rather than allowing unsold inventory to perish. This behavior is seen in industries ranging from fashion retail to tour packages and baked goods. A number of authors have addressed the markdown management problem in which a seller seeks to determine the optimal sequence of discounts to maximize the revenue from a fixed stock of perishable goods. However, merchants who consistently use markdown policies risk training customers to “wait for the sale.” We investigate models in which the decision to sell inventory at a discount will change the future expectations of customers and hence their buying behavior. We show that, in equilibrium, a single‐price policy is optimal if all consumers are strategic and demand is known to the seller. Relaxing any of these conditions can lead to a situation in which a two‐price markdown policy is optimal. We show using numerical simulation that if customers update their expectations of availability over time, then optimal sales limit policies can evolve in a complex fashion.     

Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy

In this paper, equilibrium strategies and optimal balking strategies of customers in a constant retrial queue with multiple vacations and the N-policy under two information levels, respectively, are investigated. We assume that there is no waiting area in front of the server and an arriving customer is served immediately if the server is idle; otherwise (the server is either busy or on a vacation) it has to leave the system to join a virtual retrial orbit waiting for retrials according to the FCFS rules. After a service completion, if the system is not empty, the server becomes idle, available for serving the next customer, either a new arrival or a retried customer from the virtual retrial orbit; otherwise (if the system is empty), the server starts a vacation. Upon the completion of a vacation, the server is reactivated only if it finds at least N customers in the virtual orbit; otherwise, the server continues another vacation. We study this model at two levels of information, respectively. For each level of information, we obtain both equilibrium and optimal balking strategies of customers, and make corresponding numerical comparisons. Through Particle Swarm Optimization (PSO) algorithm, we explore the impact of parameters on the equilibrium and social optimal thresholds, and obtain the trend in changes, as a function of system parameters, for the optimal social welfare, which provides guiding significance for social planners. Finally, by comparing the social welfare under two information levels, we find that whether the system information should be disclosed to customers depends on how to maintain the growth of social welfare.

     

Lead Time and Price Quotation Mode Selection: Uniform or Differentiated?

Firms in service and make‐to‐order manufacturing industries often quote lead times and prices to customers. We define uniform quotation mode (UQM) as the strategy where a firm offers a single lead time and price quotation, and differentiated quotation mode (DQM) is where a firm offers a menu of lead times and prices for customers to choose from. Both modes are followed in practice. Firms should determine which is more profitable. We classify customers into two groups: lead time sensitive (LS) and price sensitive (PS). LS customers value lead time reduction more than PS customers. We develop mathematical models of both quotation modes and analyze them to determine the most profitable mode under specified situations as well as the best lead time and price quotations within each mode. We find that DQM is dominated by UQM whenever PS customers have positive utilities from UQM or LS customers have positive utilities from DQM. Otherwise, which quotation mode is better depends on multiple factors, such as customer characteristics (including lead time reduction valuation and product valuation of a customer, and the proportion of LS customers) and production characteristics (including the desired service level and service or production cost).     

Will More Purchasing Options Benefit Customers?

This paper considers the sale of a seasonal product in the face of strategic customers. At the beginning of the selling season, the retailer announces both the price p_h at which the product will be sold during the selling season and the post‐season clearance price p<p_h for unsold items. We analyze two operating regimes: The “no reservation regime” allows a buyer either to purchase the product at price p_h when he arrives or to enter a lottery to purchase at price p if the product remains unsold. The “reservation regime” offers each buyer one extra option than the no reservation regime: reserve the product for purchase at the clearance price p. If the buyer reserves the product under the reservation regime and if it remains unsold at the end of the selling season, then he is obligated to purchase it at price p. We consider a situation in which heterogeneous customers with probabilistic valuation arrive in accord with a Poisson process. We characterize the rational purchasing behavior wherein each arriving customer is strategic; each customer takes other customers' purchasing behavior into consideration. By considering the Nash equilibrium of this game, we show that strategic customer behavior can render the customer to be worse off and the retailer to be better off under the reservation regime, despite the fact that this regime offers one extra option (reservation) to a customer. Hence, more purchasing options do not necessarily benefit customers.     

Dynamic Customer Acquisition and Retention Management

In consulting, finance, and other service industries, customers represent a revenue stream, and must be acquired and retained over time. In this paper, we study the resource allocation problem of a profit maximizing service firm that dynamically allocates its resources toward acquiring new clients and retaining unsatisfied existing ones. The interaction between acquisition and retention in our model is reflected in the cash constraint on total expected spending on acquisition and retention in each period. We formulate this problem as a dynamic program in which the firm makes decisions in both acquisition and retention after observing the current size of its customer base and receiving information about customers in danger of attrition, and we characterize the structure of the optimal acquisition and retention strategy. We show that when the firm's customer base size is relatively low, the firm should spend heavily on acquisition and try to retain every unhappy customer. However, as its customer base grows, the firm should gradually shift its emphasis from acquisition to retention, and it should also aim to strike a balance between acquisition and retention while spending its available resources. Finally, when the customer base is large enough, it may be optimal for the firm to begin spending less in both acquisition and retention. We also extend our analysis to situations where acquisition or retention success rate, as a function of resources allocation, is uncertain and show that the optimal acquisition and retention policy can be surprisingly complex. However, we develop an effective heuristic for that case. This paper aims to provide service managers some analytical principles and effective guidelines on resource allocation between these two significant activities based on their firm's customer base size.     

Revenue Management for Intermodal Transportation: The Role of Dynamic Forecasting

We study a joint capacity leasing and demand acceptance problem in intermodal transportation. The model features multiple sources of evolving supply and demand, and endogenizes the interplay of three levers—forecasting, leasing, and demand acceptance. We characterize the optimal policy, and show how dynamic forecasting coordinates leasing and acceptance. We find (i) the value of dynamic forecasting depends critically on scarcity, stochasticity, and volatility; (ii) traditional mean‐value equivalence approach performs poorly in volatile intermodal context; (iii) mean‐value‐based forecast may outperform stationary distribution‐based forecast. Our work enriches revenue management models and applications. It advances our understanding on when and how to use dynamic forecasting in intermodal revenue management.     

Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management

Discrete‐choice models are widely used to model consumer purchase behavior in assortment optimization and revenue management. In many applications, each customer segment is associated with a consideration set that represents the set of products that customers in this segment consider for purchase. The firm has to make a decision on what assortment to offer at each point in time without the ability to identify the customer's segment. A linear program called the Choice‐based Deterministic Linear Program (CDLP) has been proposed to determine these offer sets. Unfortunately, its size grows exponentially in the number of products and it is NP‐hard to solve when the consideration sets of the segments overlap. The Segment‐based Deterministic Concave Program with some additional consistency equalities (SDCP+) is an approximation of CDLP that provides an upper bound on CDLP's optimal objective value. SDCP+ can be solved in a fraction of the time required to solve CDLP and often achieves the same optimal objective value. This raises the question under what conditions can one guarantee equivalence of CDLP and SDCP+. In this study, we obtain a structural result to this end, namely that if the segment consideration sets overlap with a certain tree structure or if they are fully nested, CDLP can be equivalently replaced with SDCP+. We give a number of examples from the literature where this tree structure arises naturally in modeling customer behavior.     

基于顾客公平偏好的服务机制与定价研究

由于顾客异质性（单位时间等待成本不同），服务提供商通常对顾客采取分类服务策略，然而分类服务会引起服务系统中不同类型顾客之间等待时间和服务价值的差异性，从而给顾客带来心理上的不公平感，进而引起顾客在服务系统中的流动和转移，进一步影响企业收益和社会福利。本文针对非抢占M/M/1服务系统顾客分类情形为背景，由两种顾客之间期望等待时间的不同和公平偏好参数相结合构建普通顾客的公平心理效用模型，以垄断型服务系统为背景，分别从企业收益、社会福利与顾客效用三个视角进行分析。研究表明，服务提供商应对顾客采取可观测型的分类服务机制来获得最大收益；从社会福利视角，服务提供商应对顾客采取不可观测型的分类服务机制；从顾客效用视角，服务提供商应取消顾客分类服务，仅保留普通顾客。最后同现有结论进行比较分析，并进行拓展研究。本文研究对服务提供商采取合理的服务机制及相应的服务定价具有重要参考价值和指导意义。     

Advance selling with freebies and limited production capacity

We consider a two-period pricing model in which a seller offers freebies along with the product when making advance sales, and production is constrained by capacity. The seller can offer freebies to increase both market base and customer׳s valuation toward the product in advance. The customers strategically determine whether to purchase the product in advance and gain freebies when their valuation on the product is uncertain, or delay their purchase decision until the regular selling period. We characterize the optimal pricing, quality level of the freebie and production quantity decisions that maximize the expected profits of the seller over the two periods.     

Optimal Dynamic Pricing of Perishable Items by a Monopolist Facing Strategic Consumers

We introduce a dynamic pricing model for a monopolistic company selling a perishable product to a finite population of strategic consumers (customers who are aware that pricing is dynamic and may time their purchases strategically). This problem is modeled as a stochastic dynamic game in which the company's objective is to maximize total expected revenues, and each customer maximizes the expected present value of utility. We prove the existence of a unique subgame‐perfect equilibrium pricing policy, provide equilibrium optimality conditions for both customer and seller, and prove monotonicity results for special cases. We demonstrate through numerical examples that a company that ignores strategic consumer behavior may receive much lower total revenues than one that uses the strategic equilibrium pricing policy. We also show that, when the initial capacity is a decision variable, it can be used together with the appropriate pricing policy to effectively reduce the impact of strategic consumer behavior. The proposed model is computationally tractable for problems of realistic size.