Optimal Decision Rules for Product Recalls

Download
2012-08-01
We consider a hypothetical company that is assumed to have just manufactured and sold a number of copies of a product. It is known that, with a small probability, the company has committed a manufacturing fault that will require a recall. The company is able to observe the expiration times of the sold items whose distribution depends on whether the fault is present or absent. At the expiration of each item, a public inspection takes place that may reveal the fault, if it exists. Based on this information, the company can recall the product at any moment and pay back each customer the price of the product. If the company is not able to recall before an inspection reveals the fault, it pays a fine per item sold, which is assumed to be much larger than the price of the product. We compute the Optimal recall time that minimizes the expected cost of recall of this company. We then derive and solve a stationary limit recall problem and show that the original problem converges to it as the number of items initially sold increases to infinity. Finally, we propose two extensions of the original model and compute the optimal recall times for these. In the first extension, the expired items are inspected only if they expire earlier than expected; in the second extension, the company is able to conduct internal/private inspections on the expired items. We provide numerical examples and simulation results for all three models.
MATHEMATICS OF OPERATIONS RESEARCH

Suggestions

An Effective Matheuristic for the Multivehicle Inventory Routing Problem
Solyalı, Oguz; Süral, Haldun (2022-07-01)
Copyright: © 2022 INFORMS.This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed that is based on sequentially solving different mixed integer linear programs. The algorithm merges the advantage of being easy to design ...
Using aggregate fill rate for dynamic scheduling of multi-class systems
Kat, Bora; Avşar, Zeynep Müge (2011-01-01)
For dynamic scheduling of multi-class systems where backorder cost is incurred per unit backordered regardless of the time needed to satisfy backordered demand, the following models are considered: the cost model to minimize the sum of expected average inventory holding and backorder costs and the service model to minimize expected average inventory holding cost under an aggregate fill rate constraint. Use of aggregate fill rate constraint in the service model instead of an individual fill rate constraint f...
Competition of manufacturers for retailer shelf space
Diler, Betül; Karaer, Özgen; Bakal, İsmail Serdar; Department of Industrial Engineering (2016)
In this thesis, we consider two partially substitutable products sold through a twoechelon supply chain, consisting of two suppliers and one retailer. We assume a random aggregate demand that is split between the two products, so the products have separated random demand as long as both are available. In case of a stockout in one of the products, that product’s demand can spill over to the competing product, which causes a correlation between the final demand of the products and their stocking quantities. T...
Closed-loop supply chain network design under demand, return and quality uncertainty
Batun, Sakine (2018-07-08)
We consider the problem of designing a closed-loop supply chain (CLSC) network in the presence of uncertainty in demand quantities, return rates, and quality of the returned products. We formulate the problem as a two-stage stochastic mixed-integer program (SMIP) that maximizes the total expected profit. The first-stage decisions in our model are facility location and capacity decisions, and the second-stage decisions are the forward/backward flows on the network and hence the production/recovery quantities...
Integrated demand and procurement portfolio management with spot market volatility and option contracts
Merzifonluoglu, Yasemin (2017-04-01)
The newsvendor problem aims to optimally choose a level of order quantity to respond to a known demand distribution with the objective of maximizing expected return. In practice, the decision maker is often challenged with more complex settings involving multiple decisions and uncertainties. For instance, firms may benefit from choosing the set of customer orders to satisfy. It may also be worthwhile for many firms to select a supply portfolio instead of relying on a single procurement mode. This paper prov...
Citation Formats
A. D. Sezer, “Optimal Decision Rules for Product Recalls,” MATHEMATICS OF OPERATIONS RESEARCH, pp. 399–418, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30303.