Knowledge that Transforms

In this article, we study the joint pricing and inventory control problem for perishables when a retailer does not sell new and old inventory at the same time. At the beginning of a period, the retailer makes replenishment and pricing decisions, and at the end of a period, the retailer decides whether to dispose of ending inventory or carry it forward to the next period. The objective of the retailer is to maximize the long‐run average profit. Assuming zero lead time, we propose an efficient solution approach to the problem, which is also generalized to solve three extensions to the basic model. A feature of the present study is that we consider explicitly the influence of perishability on the demand. Among the insights gathered from the numerical analysis, we find that dynamic pricing aids extending shelf life and when disposal incurs a lower cost, or even a positive salvage value, the retailer is induced to dispose earlier since the benefit of selling new inventory offsets the loss due to disposal. We also observe that the faster the perceived rate of deterioration, the lower the threshold of the ending inventory for disposal. Perhaps a bit counter‐intuitive, maximizing profits does not mean eliminating disposals or expirations.

Supply chain risk management (SCRM) is a nascent area emerging from a growing appreciation for supply chain risk by practitioners and by researchers. However, there is diverse perception of research in supply chain risk because these researchers have approached this area from different domains. This paper presents our study of this diversity from the perspectives of operations and supply chain management scholars: First, we reviewed the researchers' output, i.e., the recent research literature. Next, we surveyed two focus groups (members of Supply Chain Thought Leaders and International SCRM groups) with open‐ended questions. Finally, we surveyed operations and supply chain management researchers during the 2009 INFORMS meeting in San Diego. Our findings characterize the diversity in terms of three “gaps”: a definition gap in how researchers define SCRM, a process gap in terms of inadequate coverage of response to risk incidents, and a methodology gap in terms of inadequate use of empirical methods. We also list ways to close these gaps as suggested by the researchers.

In this article, we study the newsvendor problem with endogenous setting of price and quoted lead‐time. This problem can be observed in situations where a firm orders semi‐finished product prior to the selling season and customizes the product in response to customer orders during the selling season. The total demand during the selling season and the lead‐time required for customization are uncertain. The demand for the product depends not only on the selling price but also on the quoted lead‐time. To set the quoted lead‐time, the firm has to carefully balance the benefit of increasing demand as the quoted lead‐time is reduced against the cost of increased tardiness. Our model enables the firm to determine the optimal selling price, quoted lead‐time, and order quantity simultaneously, and provides a new set of insights to managers.

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.

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).

We consider the problem of optimal capacity allocation in a hospital setting, where patients pass through a set of units, for example intensive care and acute care (AC), or AC and post‐acute care. If the second stage is full, a patient whose service at the first stage is complete is blocked and cannot leave the first stage. We develop a new heuristic for tandem systems to efficiently evaluate the effects of such blocking on system performance and we demonstrate that this heuristic performs well when compared with exact solutions and other approaches presented in the literature. In addition, we show how our tandem heuristic can be used as a building block to model more complex multi‐stage hospital systems with arbitrary patient routing, and we derive insights and actionable capacity strategies for a real hospital system where such blocking occurs between units.

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.

High surgical bed occupancy levels often result in heightened staff stress, frequent surgical cancellations, and long surgical wait times. This congestion is in part attributable to surgical scheduling practices, which often focus on the efficient use of operating rooms but ignore resulting downstream bed utilization. This paper describes a transparent and portable approach to improve scheduling practices, which combines a Monte Carlo simulation model and a mixed integer programming (MIP) model. For a specified surgical schedule, the simulation samples from historical case records and predicts bed requirements assuming no resource constraints. The MIP model complements the simulation model by scheduling both surgeon blocks and patient types to reduce peak bed occupancies. Scheduling guidelines were developed from the optimized schedules to provide surgical planners with a simple and implementable alternative to the MIP model. This approach has been tested and delivered to planners in a health authority in British Columbia, Canada. The models have been used to propose new surgical schedules and to evaluate the impact of proposed system changes on ward congestion.

In outpatient healthcare clinics, capacity, patient flow, and scheduling are rarely managed in an integrated fashion, so a question of interest is whether clinic performance can be improved if the policies that guide these decisions are set jointly. Despite the potential importance of this issue, we find surprisingly few studies that look at how the allocation of capacity, paired with various appointment scheduling policies and different patient flow configurations, affects patient flow and clinical efficiency. In this paper, we develop an empirically based discrete‐event simulation to examine the interactions between patient appointment policies and capacity allocation policies (i.e., the number of available examination rooms) and how they jointly affect various performance measures, such as resource utilization and patient waiting time. Findings suggest that scheduling lower‐variance, shorter appointments earlier in the clinic (and, conversely, higher‐variance, longer appointments later) results in less overall patient waiting without reducing physician utilization or increasing clinic duration. Additionally, exam rooms exhibited classic bottleneck behavior: there was no effect on physician utilization by adding exam rooms beyond a certain threshold, but too few exam rooms were devastating to clinic throughput. Some significant interactions between these variables were observed, but were not influential to the level of managerial concern. Clinicians' intuition about managing capacity in healthcare settings may differ substantially from best policies.

Examination of team productivity finds that team familiarity , i.e., individuals' prior shared work experience, can positively impact the efficiency and quality of team output. Despite the attention given to team familiarity and its contingencies, prior work has focused on whether team members have worked together, not on which team members have worked together, and under what conditions. In this paper, I parse overall team familiarity to consider effects of geographic location and the hierarchical roles of team members. Using data on all software‐development projects completed over 3 years at a large Indian firm in the global outsourced software services industry, I find that team familiarity gained when team members work together in the same location has a significantly more positive effect on team performance compared with team familiarity gained while members were collaborating in different locations. Additionally, I find that hierarchical team familiarity (a manager's experience with front‐line team members) and horizontal team familiarity (front‐line team members' experience gained with one another) have differential effects on project team performance. These findings provide insight into the relationship between team experience and team performance.