TIME‐BASED PRICING AND LEADTIME POLICIES FOR A BUILD‐TO‐ORDER MANUFACTURER

We studied time‐based policies on pricing and leadtime for a build‐to‐order and direct sales manufacturer. It is assumed that the utility of the product varies among potential customers and decreases over time, and that a potential customer will place an order if his or her utility is higher than the manufacturer's posted price. Once an order is placed, it will be delivered to the customer after a length of time called “leadtime.” Because of the decrease in a customer's utility during leadtime, a customer will cancel the order if the utility falls below the ordering price before the order is received. The manufacturer may choose to offer discounted prices to customers who would otherwise cancel their orders. We discuss two price policies: common discounted price and customized discounted price. In the common discounted price policy, the manufacturer offers a single lower price to the customers; in the customized discounted price policy, the manufacturer offers the customers separately for individual new prices. Our analytical and numerical studies show that the discounted price policies results in higher revenue and that the customized discounted price policy significantly outperforms the common discounted price policy when product utility decreases rapidly. We also study two leadtime policies when production cost decreases over time. The first uses a fixed leadtime, and the second allows the leadtime to vary dynamically over time. We find that the dynamic leadtime policy significantly outperforms the fixed leadtime policy when the product cost decreases rapidly.     

Service Systems with Experience‐Based Anecdotal Reasoning Customers

The existing queueing literature typically assumes that customers either perfectly know the expected waiting time or are able to form rational expectations about it. In contrast, in this article, we study canonical service models where customers do not have such full information or capability. We assume that customers lack full capability or ample opportunities to perfectly infer the service rate or estimate the expected waiting time, and thus can only rely on past experiences and anecdotal reasoning to make their joining decisions. We fully characterize the steady‐state equilibrium in this service system. Compared with the fully rational benchmark, we find that customers with anecdotal reasoning are less price‐sensitive. Consequently, with a higher market potential (higher arrival rate), a revenue‐maximizing firm may increase the price if the service rate is exogenous, and it may decrease the price if the service rate is at the firm's discretion. Both results go against the commonly accepted pricing recommendations in the fully rational benchmark. We also show that revenue maximization and welfare maximization lead to fundamentally different pricing strategies with anecdotal reasoning, whereas they are equivalent in the fully rational benchmark.     

PRICE‐DEPENDENT INVENTORY MODELS WITH DISCOUNT OFFERS AT RANDOM TIMES*

We consider an inventory model with a supplier offering discounts to a reseller at random epochs. The offer is accepted when the inventory position is lower than a threshold level. We compare three different pricing policies in which demand is induced by the resellers price variation. Policy 1 is the EOQ policy without discount offers. Policy 2 is a uniform price, stock‐independent policy. Policy 3 is a stock level‐dependent, discriminated price policy. Assuming constant demand rates, expressions are obtained for the optimal order quantities, prices, and profits. The numerical experiments show that if it is better to accept a suppliers discount, then it benefits the reseller to transfer the discount to downstream customers.     

Revenue Management with End‐of‐Period Discounts in the Presence of Customer Learning

Consider a firm that sells identical products over a series of selling periods (e.g., weekly all‐inclusive vacations at the same resort). To stimulate demand and enhance revenue, in some periods, the firm may choose to offer a part of its available inventory at a discount. As customers learn to expect such discounts, a fraction may wait rather than purchase at a regular price. A problem the firm faces is how to incorporate this waiting and learning into its revenue management decisions. To address this problem we summarize two types of learning behaviors and propose a general model that allows for both stochastic consumer demand and stochastic waiting. For the case with two customer classes, we develop a novel solution approach to the resulting dynamic program. We then examine two simplified models, where either the demand or the waiting behavior are deterministic, and present the solution in a closed form. We extend the model to incorporate three customer classes and discuss the effects of overselling the capacity and bumping customers. Through numerical simulations we study the value of offering end‐of‐period deals optimally and analyze how this value changes under different consumer behavior and demand scenarios.     

Pricing and Capacity Rationing with Customer Disappointment Aversion

Customers are averse to disappointment that arises when economic outcomes fall short of expectations. In this study, we study a two‐period model in which the firm may create rationing in either period. In the anticipation of possible disappointment due to stock‐outs, strategic customers decide when to purchase and the firm determines the prices and rationing levels in each period. We explore the impact of disappointment aversion on customers' strategic purchasing behavior and the firm's pricing and rationing decisions. Without disappointment aversion, it is optimal for the firm to adopt a uniform pricing policy without rationing. However, when strategic customers are averse to disappointment, a firm may be able to increase profits with an appropriate level of rationing. We analyze both the mark‐up and mark‐down policies. We show that, in a mark‐down scenario, the firm always benefits from disappointment aversion behavior by using an appropriate level of rationing in a low‐price period. However, in a mark‐up scenario, whether it is beneficial for the firm to induce disappointment aversion behavior depends on how customers frame payoffs in different periods when forming utilities. Particularly, when customers compartmentalize payoffs in different periods to form utilities, the firm should not induce disappointment aversion behavior.     

Optimal Policies for Selling New and Remanufactured Products

Because of environmental and economic reasons, an increasing number of original equipment manufacturers (OEMs) nowadays sell both new and remanufactured products. When both products are available, customers will buy the one that gives them a higher (and non‐negative) utility. Thus, if the firm does not price the products properly, then product cannibalization may arise and its revenue may be adversely impacted. In this paper, we study the pricing problem of a firm that sells both new and remanufactured products over a finite planning horizon. Customer demand processes for both new and remanufactured products are random and price‐sensitive, and product returns (also called cores) are random and remanufactured upon receipt. We characterize the optimal pricing and manufacturing policies that maximize the expected total discounted profit. If new products are made‐to‐order (MTO), we show that when the inventory level of remanufactured product increases, the optimal price of remanufactured product decreases while the price difference between new and remanufactured products increases; however, the optimal selling price of new product may increase or decrease. If new products are made to stock (MTS), then the optimal manufacturing policy is of a base‐stock policy with the base‐stock level decreasing in the remanufactured product inventory level. To understand the potential benefit in implementing an MTO system, we study the difference between the value functions of the MTO and MTS systems, and develop lower and upper bounds for it. Finally, we study several extensions of the base model and show that most of our results extend to those more general settings.     

Optimal Uniform Pricing Strategy of a Service Firm When Facing Two Classes of Customers

When facing heterogeneous customers, how should a service firm make its pricing decision to maximize revenue? If discrimination is allowed, then priority schemes and differentiated pricing are often used to achieve that. In many applications, however, the firm cannot or is not allowed to set discriminatory prices, for example, list price in retail stores, online shopping, and gas stations; thus a uniform price must be applied to all customers. This study addresses the optimal uniform pricing problem of a service firm using a queueing system with two classes of customers. Our result shows that the potential pool of customers plays a central role in the firm's optimal decision. Depending on the range of system parameters, which are determined explicitly by the primitive data, the firm's optimal strategy may choose to serve only one class of customers, a subset of a class of customers, or a combination of different classes of customers. In addition, the optimal price is in general not monotonic with respect to the potential market sizes because their changes may lead to a major shift in the firm's decision on which customer class to serve. However, unless such a shift occurs, the optimal price is weakly decreasing in the potential market sizes.     

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.     

Dynamic Pricing and Inventory Management with Dual Suppliers of Different Lead Times and Disruption Risks

It is common for a firm to make use of multiple suppliers of different delivery lead times, reliabilities, and costs. In this study, we are concerned with the joint pricing and inventory control problem for such a firm that has a quick‐response supplier and a regular supplier that both suffer random disruptions, and faces price‐sensitive random demands. We aim at characterizing the optimal ordering and pricing policies in each period over a planning horizon, and analyzing the impacts of supply source diversification. We show that, when both suppliers are unreliable, the optimal inventory policy in each period is a reorder point policy and the optimal price is decreasing in the starting inventory level in that period. In addition, we show that having supply source diversification or higher supplier reliability increases the firm's optimal profit and lowers the optimal selling price. We also demonstrate that, with the selling price as a decision, a supplier may receive even more orders from the firm after an additional supplier is introduced. For the special case where the quick‐response supplier is perfectly reliable, we further show that the optimal inventory policy is of a base‐stock type and the optimal pricing policy is a list‐price policy with markdowns.     

Dynamic Pricing and Inventory Management with Regular and Expedited Supplies

We consider a periodic‐review inventory system with regular and expedited supply modes. The expedited supply is faster than the regular supply but incurs a higher cost. Demand for the product in each period is random and sensitive to its selling price. The firm determines its order quantity from each supply in each period as well as its selling price to maximize the expected total discounted profit over a finite or an infinite planning horizon. We show that, in each period if it is optimal to order from both supplies, the optimal inventory policy is determined by two state‐independent thresholds, one for each supply mode, and a list price is set for the product; if only the regular supply is used, the optimal policy is a state‐dependent base‐stock policy, that is, the optimal base‐stock level depends on the starting inventory level, and the optimal selling price is a markdown price that decreases with the starting inventory level. We further study the operational impact of such supply diversification and show that it increases the firm's expected profit, reduces the optimal safety‐stock levels, and lowers the optimal selling price. Thus that diversification is beneficial to both the firm and its customers. Building upon these results, we conduct a numerical study to assess and compare the respective benefit of dynamic pricing and supply diversification.     

Optimal Policies for a Two‐Product Inventory System under a Flexible Substitution Scheme

We study a two‐product inventory model that allows substitution. Both products can be used to supply demand over a selling season of N periods, with a one‐time replenishment opportunity at the beginning of the season. A substitution could be offered even when the demanded product is available. The substitution rule is flexible in the sense that the seller can choose whether or not to offer substitution and at what price or discount level, and the customer may or may not accept the offer, with the acceptance probability being a decreasing function of the substitution price. The decisions are the replenishment quantities at the beginning of the season, and the dynamic substitution‐pricing policy in each period of the season. Using a stochastic dynamic programming approach, we present a complete solution to the problem. Furthermore, we show that the objective function is concave and submodular in the inventory levels—structural properties that facilitate the solution procedure and help identify threshold policies for the optimal substitution/pricing decisions. Finally, with a state transformation, we also show that the objective function is ‐concave, which allows us to derive similar structural properties of the optimal policy for multiple‐season problems.     

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.     

A Nonatomic‐Game Approach to Dynamic Pricing under Competition

We study a revenue management problem involving competing firms. We assume the presence of a continuum of infinitesimal firms where no individual firm has any discernable influence over the evolution of the overall market condition. Under this nonatomic‐game approach, the unanimous adoption of an equilibrium pricing policy by all firms will yield a market‐condition process that in turn will elicit the said policy as one of the best individual responses. For both deterministic‐ and stochastic‐demand cases, we show the existence of equilibrium pricing policies that exhibit well‐behaving monotone trends. Our computational study reveals many useful insights, including the fact that only a reasonable number of firms are needed for our approach to produce near‐rational pricing policies.     

Skill Management in Large‐Scale Service Marketplaces

Large‐scale, web‐based service marketplaces have recently emerged as a new resource for customers who need quick resolutions for their short‐term problems. Due to the temporary nature of the relations between customers and service providers (agents) in these marketplaces, customers may not have an opportunity to assess the ability of an agent before their service completion. On the other hand, the moderating firm has a more sustained relationship with agents, and thus it can provide customers with more information about the abilities of agents through skill screening mechanisms. In this study, we consider a marketplace where the moderating firm can run two skills tests on agents to assess if their skills are above certain thresholds. Our main objective is to evaluate the effectiveness of skill screening as a revenue maximization tool. We, specifically, analyze how much benefit the firm obtains after each additional skill test. We find that skill screening leads to negligible revenue improvements in marketplaces where agent skills are highly compatible and the average service times are similar for all customers. As the compatibility of agent skills weakens or the customers start to vary in their processing time needs, we show that the firm starts to experience sizable improvements in revenue from skill screening. Apparently, the firm can reap the most of these substantial benefits when it runs only one test. For instance, in marketplaces where agents posses uncorrelated skills, the second skill test only brings an additional 2% improvement in revenue. Accounting for possible skill screening costs, we then show the optimality of offering only one test when the compatibility between agent skills is sufficiently low. The results of this study also have important implications in terms of the right level of intervention in the marketplaces we study.     

Sourcing from Multiple Suppliers for Price‐Dependent Demands

We analyze a model that integrates demand shaping via dynamic pricing and risk mitigation via supply diversification. The firm under consideration replenishes a certain product from a set of capacitated suppliers for a price‐dependent demand in each period. Under deterministic capacities, we derive a multilevel base stock list price policy and establish the optimality of cost‐based supplier selection, that is, ordering from a cheaper source before more expensive ones. With general random capacities, however, neither result holds. While it is optimal to price low for a high inventory level, the optimal order quantities are not monotone with respect to the inventory level. In general, a near reorder‐point policy should be followed. Specifically, there is a reorder point for each supplier such that no order is issued to him when the inventory level is above this point and a positive order is placed almost everywhere when the inventory level is below this point. Under this policy, it may be profitable to order exclusively from the most expensive source. We characterize conditions under which a strict reorder‐point policy and a cost‐based supplier‐selection criterion become optimal. Moreover, we quantify the benefit from dynamic pricing, as opposed to static pricing, and the benefit from multiple sourcing, as opposed to single sourcing. We show that these two strategies exhibit a substitutable relationship. Dynamic pricing is less effective under multiple sourcing than under single sourcing, and supplier diversification is less valuable with price adjustments than without. Under limited supply, dynamic pricing yields a robust, long‐term profit improvement. The value of supply diversification, in contrast, mainly comes from added capacities and is most significant in the short run.     

Demand and Production Management with Uniform Guaranteed Lead Time

Recently, innovation‐oriented firms have been competing along dimensions other than price, lead time being one such dimension. Increasingly, customers are favoring lead time guarantees as a means to hedge supply chain risks. For a make‐to‐order environment, we explicitly model the impact of a lead time guarantee on customer demands and production planning. We study how a firm can integrate demand and production decisions to optimize expected profits by quoting a uniform guaranteed maximum lead time to all customers. Our analysis highlights the increasing importance of lead time for customers, as well as the tradeoffs in achieving a proper balance between revenue and cost drivers associated with lead‐time guarantees. We show that the optimal lead time has a closed‐form solution with a newsvendor‐like structure. We prove comparative statics results for the change in optimal lead time with changes in capacity and cost parameters and illustrate the insights using numerical experimentation.     

A Choice‐Based Dynamic Programming Approach for Setting Opaque Prices

Opaque pricing is a form of pricing where certain characteristics of the product or service are hidden from the consumer until after purchase. In essence, opaque selling transforms a differentiated good into a commodity. Opaque pricing has become popular in service pricing as it allows firms to sell their differentiated product at higher prices to regular brand loyal customers while simultaneously selling to non‐brand loyal customers at discounted prices. We use a nested logit model in combination with logistic regression and dynamic programming to illustrate how a service firm can optimally set prices on an opaque sales channel. The choice model allows the characterization of consumer trade‐offs when purchasing opaque products while the dynamic programming approach allows the characterization of the optimal pricing policy as a function of inventory and time remaining. We compare optimal prices and expected revenues when dynamic pricing is restricted to daily price changes. We provide an illustrative example using data from an opaque selling mechanism ( Hotwire.com ) and a Washington DC‐based hotel.     

Cash‐Flow Based Dynamic Inventory Management

Small‐to‐medium‐sized enterprises (SMEs), including many startup firms, need to manage interrelated flows of cash and inventories of goods. In this study, we model a firm that can finance its inventory (ordered or manufactured) with loans in order to meet random demand which in general may not be time stationary. The firm earns interest on its cash on hand and pays interest on its debt. The objective is to maximize the expected value of the firm's capital at the end of a finite planning horizon. The firm's state at the beginning of each period is characterized by the inventory level and the capital level measured in units of the product, whose sum represents the “net worth” of the firm. Our study shows that the optimal ordering policy is characterized by a pair of threshold parameters as follows. (i) If the net worth is less than the lower threshold, then the firm employs a base stock order up to the lower threshold. (ii) If the net worth is between the two thresholds, then the firm orders exactly as many units as it can afford, without borrowing. (iii) If the net worth is above the upper threshold, then the firm employs a base stock order up to the upper threshold. Further, upper and lower bounds for the threshold values are developed using two simple‐to‐compute myopic ordering policies which yield lower bounds for the value function. We also derive an upper bound for the value function by considering a sell‐back policy. Subsequently, it is shown that policies of similar structure are optimal when the loan and deposit interest rates are piecewise linear functions, when there is a maximal loan limit and when unsatisfied demand is backordered. Finally, further managerial insights are provided with extensive numerical studies.     

Pareto‐Improving Contracts for Express Package Delivery Services

We address the problem of an express package delivery company in structuring a long‐term customer contract whose terms may include prices that differ by day‐of‐week and by speed‐of‐service. The company traditionally offered speed‐of‐service pricing to its customers, but without day‐of‐week differentiation, resulting in customer demands with considerable day‐of‐week seasonality. The package delivery company hoped that using day‐of‐week and speed‐of‐service price differentiation for contract customers would induce these customers to adjust their demands to become counter‐cyclical to the non‐contract demand. Although this usually cannot be achieved by pricing alone, we devise an approach that utilizes day‐of‐week and speed‐of‐service pricing as an element of a Pareto‐improving contract. The contract provides the lowest‐cost arrangement for the package delivery company while ensuring that the customer is at least as well off as he would have been under the existing pricing structure. The contract pricing smoothes the package delivery company's demand and reduces peak requirements for transport capacity. The latter helps to decrease capital costs, which may allow a further price reduction for the customer. We formulate the pricing problem as a biconvex optimization model, and present a methodology for designing the contract and numerical examples that illustrate the achievable savings.     

Equilibrium Joining Strategies and Optimal Control of a Make‐to‐Stock Queue

We consider a make‐to‐stock, finite‐capacity production system with setup cost and delay‐sensitive customers. To balance the setup and inventory related costs, the production manager adopts a two‐critical‐number control policy, where the production starts when the number of waiting customers reaches a certain level and shuts down when a certain quantity of inventory has accumulated. Once the production is set up, the unit production time follows an exponential distribution. Potential customers arrive according to a Poisson process. Customers are strategic, i.e., they make decisions on whether to stay for the product or to leave without purchase based on their utility values, which depend on the production manager's control decisions. We formulate the problem as a Stackelberg game between the production manager and the customers, where the former is the game leader. We first derive the equilibrium customer purchasing strategy and system performance. We then formulate the expected cost rate function for the production system and present a search algorithm for obtaining the optimal values of the two control variables. We further analyze the characteristics of the optimal solution numerically and compare them with the situation where the customers are non‐strategic.