Effective Online Order Acceptance Policies for Omnichannel Fulfillment

Author(s):  
Su Jia ◽  
Jeremy Karp ◽  
R. Ravi ◽  
Sridhar Tayur

Problem definition: Omnichannel retailing has led to the use of traditional stores as fulfillment centers for online orders. Omnichannel fulfillment problems have two components: (1) accepting a certain number of online orders prior to seeing store demands and (2) satisfying (or filling) some of these accepted online demands as efficiently as possible with any leftover inventory after store demands have been met. Hence, there is a fundamental trade-off between store cancellations of accepted online orders and potentially increased profits because of more acceptances of online orders. We study this joint problem of online order acceptance and fulfillment (including cancellations) to minimize total costs, including shipping charges and cancellation penalties in single-period and limited multiperiod settings. Academic/practical relevance: Despite the growing importance of omnichannel fulfillment via online orders, our work provides the first study incorporating cancellation penalties along with fulfillment costs. Methodology: We build a two-stage stochastic model. In the first stage, the retailer sets a policy specifying which online orders it will accept. The second stage represents the process of fulfilling online orders after the uncertain quantities of in-store purchases are revealed. We analyze threshold policies that accept online orders as long as the inventories are above a global threshold, a local threshold per region, or a hybrid. Results: For a single period, total costs are unimodal as a function of the global threshold and unimodal as a function of a single local threshold holding all other local thresholds at constant values, motivating a gradient search algorithm. Reformulating as an appropriate linear program with network flow structure, we estimate the derivative (using infinitesimal perturbation analysis) of the total cost as a function of the thresholds. We validate the performance of the threshold policies empirically using data from a high-end North American retailer. Our two-location experiments demonstrate that local thresholds perform better than global thresholds in a wide variety of settings. Conversely, in a narrow region with negatively correlated online demand between locations and very low shipping costs, global threshold outperforms local thresholds. A hybrid policy only marginally improves on the better of the two. In multiple periods, we study one- and two-location models and provide insights into effective solution methods for the general case. Managerial implications: Our methods provide effective algorithms to manage fulfillment costs for online orders, demonstrating a significant reduction over policies that treat each location separately and reflecting the significant advantage of incorporating shipping in computing thresholds. Numerical studies provide insights as to why local thresholds perform well in a wide variety of situations.

Author(s):  
Can Zhang ◽  
Atalay Atasu ◽  
Karthik Ramachandran

Problem definition: Faced with the challenge of serving beneficiaries with heterogeneous needs and under budget constraints, some nonprofit organizations (NPOs) have adopted an innovative solution: providing partially complete products or services to beneficiaries. We seek to understand what drives an NPO’s choice of partial completion as a design strategy and how it interacts with the level of variety offered in the NPO’s product or service portfolio. Academic/practical relevance: Although partial product or service provision has been observed in the nonprofit operations, there is limited understanding of when it is an appropriate strategy—a void that we seek to fill in this paper. Methodology: We synthesize the practices of two NPOs operating in different contexts to develop a stylized analytical model to study an NPO’s product/service completion and variety choices. Results: We identify when and to what extent partial completion is optimal for an NPO. We also characterize a budget allocation structure for an NPO between product/service variety and completion. Our analysis sheds light on how beneficiary characteristics (e.g., heterogeneity of their needs, capability to self-complete) and NPO objectives (e.g., total-benefit maximization versus fairness) affect the optimal levels of variety and completion. Managerial implications: We provide three key observations. (1) Partial completion is not a compromise solution to budget limitations but can be an optimal strategy for NPOs under a wide range of circumstances, even in the presence of ample resources. (2) Partial provision is particularly valuable when beneficiary needs are highly heterogeneous, or beneficiaries have high self-completion capabilities. A higher self-completion capability generally implies a lower optimal completion level; however, it may lead to either a higher or a lower optimal variety level. (3) Although providing incomplete products may appear to burden beneficiaries, a lower completion level can be optimal when fairness is factored into an NPO’s objective or when beneficiary capabilities are more heterogeneous.


Author(s):  
Tianqin Shi ◽  
Nicholas C. Petruzzi ◽  
Dilip Chhajed

Problem definition: The eco-toxicity arising from unused pharmaceuticals has regulators advocating the benign design concept of “green pharmacy,” but high research and development expenses can be prohibitive. We therefore examine the impacts of two regulatory mechanisms, patent extension and take-back regulation, on inducing drug manufacturers to go green. Academic/practical relevance: One incentive suggested by the European Environmental Agency is a patent extension for a company that redesigns its already patented pharmaceutical to be more environmentally friendly. This incentive can encourage both the development of degradable drugs and the disclosure of technical information. Yet, it is unclear how effective the extension would be in inducing green pharmacy and in maximizing social welfare. Methodology: We develop a game-theoretic model in which an innovative company collects monopoly profits for a patented pharmaceutical but faces competition from a generic rival after the patent expires. A social-welfare-maximizing regulator is the Stackelberg leader. The regulator leads by offering a patent extension to the innovative company while also imposing take-back regulation on the pharmaceutical industry. Then the two-profit maximizing companies respond by setting drug prices and choosing whether to invest in green pharmacy. Results: The regulator’s optimal patent extension offer can induce green pharmacy but only if the offer exceeds a threshold length that depends on the degree of product differentiation present in the pharmaceutical industry. The regulator’s correspondingly optimal take-back regulation generally prescribes a required collection rate that decreases as its optimal patent extension offer increases, and vice versa. Managerial implications: By isolating green pharmacy as a potential target to address pharmaceutical eco-toxicity at its source, the regulatory policy that we consider, which combines the incentive inherent in earning a patent extension on the one hand with the penalty inherent in complying with take-back regulation on the other hand, serves as a useful starting point for policymakers to optimally balance economic welfare considerations with environmental stewardship considerations.


2020 ◽  
Vol 22 (4) ◽  
pp. 735-753 ◽  
Author(s):  
Can Zhang ◽  
Atalay Atasu ◽  
Turgay Ayer ◽  
L. Beril Toktay

Problem definition: We analyze a resource allocation problem faced by medical surplus recovery organizations (MSROs) that recover medical surplus products to fulfill the needs of underserved healthcare facilities in developing countries. The objective of this study is to identify implementable strategies to support recipient selection decisions to improve MSROs’ value provision capability. Academic/practical relevance: MSRO supply chains face several challenges that differ from those in traditional for-profit settings, and there is a lack of both academic and practical understanding of how to better match supply with demand in this setting where recipient needs are typically private information. Methodology: We propose a mechanism design approach to determine which recipient to serve at each shipping opportunity based on recipients’ reported preference rankings of different products. Results: We find that when MSRO inventory information is shared with recipients, the only truthful mechanism is random selection among recipients, which defeats the purpose of eliciting information. Subsequently, we show that (1) eliminating inventory information provision enlarges the set of truthful mechanisms, thereby increasing the total value provision; and (2) further withholding information regarding other recipients leads to an additional increase in total value provision. Finally, we show that under a class of implementable mechanisms, eliciting recipient valuations has no value added beyond eliciting preference rankings. Managerial implications: (1) MSROs with large recipient bases and low inventory levels can significantly improve their value provision by appropriately determining the recipients to serve through a simple scoring mechanism; (2) to truthfully elicit recipient needs information to support the recipient selection decisions, MSROs should withhold inventory and recipient-base information; and (3) under a set of easy-to-implement scoring mechanisms, it is sufficient for MSROs to elicit recipients’ preference ranking information. Our findings have already led to a change in the practice of an award-winning MSRO.


Author(s):  
Nick Arnosti ◽  
Ramesh Johari ◽  
Yash Kanoria

Problem definition: Participants in matching markets face search and screening costs when seeking a match. We study how platform design can reduce the effort required to find a suitable partner. Practical/academic relevance: The success of matching platforms requires designs that minimize search effort and facilitate efficient market clearing. Methodology: We study a game-theoretic model in which “applicants” and “employers” pay costs to search and screen. An important feature of our model is that both sides may waste effort: Some applications are never screened, and employers screen applicants who may have already matched. We prove existence and uniqueness of equilibrium and characterize welfare for participants on both sides of the market. Results: We identify that the market operates in one of two regimes: It is either screening-limited or application-limited. In screening-limited markets, employer welfare is low, and some employers choose not to participate. This occurs when application costs are low and there are enough employers that most applicants match, implying that many screened applicants are unavailable. In application-limited markets, applicants face a “tragedy of the commons” and send many applications that are never read. The resulting inefficiency is worst when there is a shortage of employers. We show that simple interventions—such as limiting the number of applications that an individual can send, making it more costly to apply, or setting an appropriate market-wide wage—can significantly improve the welfare of agents on one or both sides of the market. Managerial implications: Our results suggest that platforms cannot focus exclusively on attracting participants and making it easy to contact potential match partners. A good user experience requires that participants not waste effort considering possibilities that are unlikely to be available. The operational interventions we study alleviate congestion by ensuring that potential match partners are likely to be available.


Author(s):  
Hanlin Liu ◽  
Yimin Yu

Problem definition: We study shared service whereby multiple independent service providers collaborate by pooling their resources into a shared service center (SSC). The SSC deploys an optimal priority scheduling policy for their customers collectively by accounting for their individual waiting costs and service-level requirements. We model the SSC as a multiclass [Formula: see text] queueing system subject to service-level constraints. Academic/practical relevance: Shared services are increasingly popular among firms for saving operational costs and improving service quality. One key issue in fostering collaboration is the allocation of costs among different firms. Methodology: To incentivize collaboration, we investigate cost allocation rules for the SSC by applying concepts from cooperative game theory. Results: To empower our analysis, we show that a cooperative game with polymatroid optimization can be analyzed via simple auxiliary games. By exploiting the polymatroidal structures of the multiclass queueing systems, we show when the games possess a core allocation. We explore the extent to which our results remain valid for some general cases. Managerial implications: We provide operational insights and guidelines on how to allocate costs for the SSC under the multiserver queueing context with priorities.


Author(s):  
Yanzhe (Murray) Lei ◽  
Stefanus Jasin ◽  
Joline Uichanco ◽  
Andrew Vakhutinsky

Problem definition: We study a joint product framing and order fulfillment problem with both inventory and cardinality constraints faced by an e-commerce retailer. There is a finite selling horizon and no replenishment opportunity. In each period, the retailer needs to decide how to “frame” (i.e., display, rank, price) each product on his or her website as well as how to fulfill a new demand. Academic/practical relevance: E-commerce retail is known to suffer from thin profit margins. Using the data from a major U.S. retailer, we show that jointly planning product framing and order fulfillment can have a significant impact on online retailers’ profitability. This is a technically challenging problem as it involves both inventory and cardinality constraints. In this paper, we make progress toward resolving this challenge. Methodology: We use techniques such as randomized algorithms and graph-based algorithms to provide a tractable solution heuristic that we analyze through asymptotic analysis. Results: Our proposed randomized heuristic policy is based on the solution of a deterministic approximation to the stochastic control problem. The key challenge is in constructing a randomization scheme that is easy to implement and that guarantees the resulting policy is asymptotically optimal. We propose a novel two-step randomization scheme based on the idea of matrix decomposition and a rescaling argument. Managerial implications: Our numerical tests show that the proposed policy is very close to optimal, can be applied to large-scale problems in practice, and highlights the value of jointly optimizing product framing and order fulfillment decisions. When inventory across the network is imbalanced, the widespread practice of planning product framing without considering its impact on fulfillment can result in high shipping costs, regardless of the fulfillment policy used. Our proposed policy significantly reduces shipping costs by using product framing to manage demand so that it occurs close to the location of the inventory.


Author(s):  
Ming Hu ◽  
Yun Zhou

Problem definition: We consider an intermediary’s problem of dynamically matching demand and supply of heterogeneous types in a periodic-review fashion. Specifically, there are two disjoint sets of demand and supply types, and a reward for each possible matching of a demand type and a supply type. In each period, demand and supply of various types arrive in random quantities. The platform decides on the optimal matching policy to maximize the expected total discounted rewards, given that unmatched demand and supply may incur waiting or holding costs, and will be fully or partially carried over to the next period. Academic/practical relevance: The problem is crucial to many intermediaries who manage matchings centrally in a sharing economy. Methodology: We formulate the problem as a dynamic program. We explore the structural properties of the optimal policy and propose heuristic policies. Results: We provide sufficient conditions on matching rewards such that the optimal matching policy follows a priority hierarchy among possible matching pairs. We show that those conditions are satisfied by vertically and unidirectionally horizontally differentiated types, for which quality and distance determine priority, respectively. Managerial implications: The priority property simplifies the matching decision within a period, and the trade-off reduces to a choice between matching in the current period and that in the future. Then the optimal matching policy has a match-down-to structure when considering a specific pair of demand and supply types in the priority hierarchy.


Author(s):  
Yimin Wang ◽  
Scott Webster

Problem definition: With heightened global uncertainty, supply chain managers are under increasing pressure to craft strategies that accommodate both supply and demand risks. Although product flexibility is a well-understood strategy to accommodate risk, there is no clear guidance on the optimal flexibility configuration of a supply network that comprises both unreliable primary suppliers and reliable backup suppliers. Academic/practical relevance: Existing literature examines the value of flexibility with primary and backup suppliers independently. For a risk-neutral firm, research shows that (a) incorporating flexibility in a primary supplier by replacing two dedicated ones (in absence of backup supply) is always beneficial and that (b) adding flexibility to a reliable backup supplier (in absence of product flexibility in primary suppliers) is always valuable. It is unclear, however, how flexibility should be incorporated into a supply network with both unreliable primary suppliers and reliable backup suppliers. This research studies whether flexibility should be incorporated in a primary supplier, a backup supplier, or both. Methodology: We develop a normative model to analyze when flexibility benefits and when it hurts. Results: Compared with a base case of no flexibility, we prove that incorporating flexibility in either primary or backup suppliers is always beneficial. However, incorporating flexibility in both primary and backup suppliers can be counterproductive because the supply chain performance can decline with saturated flexibility, even if flexibility is costless. A key reason is that the risk-aggregation effect of consolidating flexibility in an unreliable supplier becomes more salient when flexibility is already embedded in a backup supplier. Managerial implications: This research refines the existing understanding of flexibility by illustrating that flexibility is not always beneficial. When there is a choice, a firm should prioritize incorporating flexibility in a reliable backup supplier.


Author(s):  
Liying Mu ◽  
Bin Hu ◽  
A. Amarender Reddy ◽  
Srinagesh Gavirneni

Problem definition: Inspired by India’s challenges in importing pulses, we study the negotiation of government-to-government food importing contracts, with a focus on ad hoc and forward negotiations with multiple suppliers (henceforth referred to as multiple-sourcing negotiations). Academic/practical relevance: We are the first to comprehensively study ad hoc and forward multiple-sourcing negotiations for food importing. Such problems are widespread, especially in developing nations, and thus the research can be relevant to the wellbeing of large underprivileged populations. Methodology: We develop an analytical negotiation model in the Nash bargaining framework and adopt the Nash-in-Nash framework to analyze multiple-sourcing negotiations. Results: We find that while forward negotiations are not necessarily better than ad hoc negotiations for the buyer, it would be true with sufficiently many suppliers. When facing a supplier pool, we show that it may be optimal to mix forward and ad hoc suppliers. In general, fewer suppliers should be assigned as ad hoc as the pool size increases. We also find that adding a hybrid supplier (engaged in a forward negotiation with an ad hoc negotiation as the fallback option) may be better or worse than adding a forward supplier in the presence of other suppliers. Managerial implications: Our findings inform how a food importer should strategically utilize ad hoc and forward negotiations with its suppliers to improve the outcome. The work may help countries’ food importing policymaking and strategies and may improve the wellbeing of large underprivileged populations.


Author(s):  
Xi Li ◽  
Yanzhi Li ◽  
Ying-Ju Chen

Problem definition: We consider the effects of strategic inventory (SI) in the presence of chain-to-chain competition in a two-period model. Academic/practical relevance: Established findings suggest that SI may alleviate double marginalization and improve the efficiency of a decentralized distribution channel. However, no studies consider the role of SI under chain-to-chain competition. Methodology: We build a two-period model consisting of two competing supply chains, each with an upstream manufacturer and an exclusive retailer. The retailers compete on either price or quantity. We characterize the firms’ strategies under the concept of perfect Bayesian equilibrium. We consider cases where contracts are either observable or unobservable across supply chains. Results: (1) SI still exists under chain-to-chain competition. Retailers may carry more inventory when the competition becomes fiercer, which further intensifies the supply chain competition. (2) Different from the existing findings, SI may backfire and hurt all firms. Interestingly, firms may benefit from a higher inventory holding cost. (3) Under supply chain competition, the prisoner’s dilemma can arise if competition intensity is intermediate; in other words, manufacturers are better off without strategic inventory, and yet they cannot help allowing strategic inventory, which is the unique equilibrium. Managerial implications: Despite its appeal among firms of a single supply chain, the role of SI is altered or even reversed by chain-to-chain competition. Conventional wisdom on SI should be applied with caution.


Sign in / Sign up

Export Citation Format

Share Document