1 July 2017 in Manufacturing & Service Operations Management
Online purchases constitute about one-tenth of U.S. retail sales. The supply chains that support online retailing are fundamentally different from those that support traditional brick-and-mortar stores. Traditional solutions are not always appropriate to solve online retailing’s operations problems; thus, there is an opportunity to understand and improve these novel supply chains. One key characteristic of the inventory systems for online retailing is demand spillover, whereby a stockout at a fulfillment center (FC) results in demand spilling over to another FC. For this context we examine how to allocate inventory to the FCs under a periodic-review joint-replenishment policy, with an objective to minimize outbound shipping costs for a fixed amount of inventory. We first show how traditional decentralized allocation policies may perform suboptimally and induce dynamics (whiplash) that result in costly spillover. We find that this phenomenon increases with the prevalence of local stockouts and with the level of inventory imbalance. We then describe that inventory imbalance occurs in online retailing because of operational realities and provide evidence based on real data. Finally, we propose a heuristic to allocate inventory accounting for possible spillover during the lead time. We test the heuristic by a simulation and show that it performs better than the status quo policy, is robust to operational realities, and captures over 90% of the possible improvement as compared to a pseudo-optimal policy. The online appendix is available at https://doi.org/10.1287/msom.2016.0614 .
1 January 2012 in Production and Operations Management
1 March 2010 in Production and Operations Management
The replacement of an existing product with a new one presents many challenges. In particular, uncertainties in a new product introduction often lead to extreme cases of demand and supply mismatches. This paper addresses inventory planning decisions for product upgrades when there is no replenishment opportunity during the transition period. We allow product substitution: when a company runs out of the old product, a customer may be offered the new product as a substitute. We show that the optimal substitution decision is a time‐varying threshold policy and establish the optimal planning policy. Further, we determine the optimal delay in a new product introduction, given the initial inventory of the old product.
1 September 2021 in Manufacturing & Service Operations Management
Problem definition : This paper studies an online retailer’s problem of choosing fulfillment centers in which to place items. We formulate the problem as a mixed-integer program that models thousands or millions of items to be placed in dozens of fulfillment centers and shipped to dozens of customer regions. The objective is to minimize the sum of shipping and fixed costs over one planning period. Academic/practical relevance : A good placement plan can significantly reduce the operational cost, which is crucial for online-retail businesses because they often have a low profit margin. The placement problem can be difficult to solve with existing techniques or off-the-shelf software because of the large number of items and the fulfillment center fixed costs and capacity constraints. Methodology : We propose a large-scale optimization framework that aggregates items into clusters, solves the cluster-level problem with column generation, and disaggregates the solution into item-level placement plans. We develop an a priori bound on the optimality gap, and we also apply the framework to a numerical example that consists of 1,000,000 items. Results : The a priori bound provides insights on how to select the appropriate aggregation criteria. For the numerical example, our framework produces a near-optimal solution in a few hours, significantly outperforming a sequential placement heuristic that approximates the status quo. Managerial implications : Our study provides a computationally efficient approach for solving online-retail inventory placement as well as similar large-scale optimization problems in practice.
31 May 2014 in Health Care Management Science
This paper introduces a deterministic model to plan the physician requirements for outpatient clinics to achieve service targets for the appointment lead-times of patients. The Ministry of Health of Singapore has established targets for the median, 95th percentile, and 100th percentile of appointment lead-times for patients, since long appointment postponements are regarded as being unacceptable for health care services. The study is to match the capacity of the healthcare providers to the patient demand for a re-entry system, subject to restrictions on the appointment lead-times for patients. We propose a mixed-integer programming model for planning capacity with the minimization of the maximum required capacity as its objective. In the model we assume a finite planning horizon, deterministic arrivals, multiple types of patients, identical physicians, and dependent demand between types of patients. We solve this model with a Branch and Cut algorithm. We test the model with numerical experiments using real data from the chosen specialty at the outpatient clinic of the studied hospital. The results show the value of the proposed model via a systematic push-pull mechanism in scheduling patients’ requests to minimize the objective. The clinic should use one of the appointment lead-time targets to determine the patients’ appointment dates. Finally, from the sensitivity analyses we demonstrate that the objective is negatively correlated with first-visit patients’ appointment lead-time targets, the discharge rates, and the re-visit patients’ mean appointment lead-time; we find a positive correlation between the first-visit patients’ mean appointment lead-time and the appointment lead-time targets.