E-Fulfillment and Multi-Channel Distribution – A Review

This review addresses the specific supply chain management issues of Internet fulfillment in a multi-channel environment. It provides a systematic overview of managerial planning tasks and reviews corresponding quantitative models. In this way, we aim to enhance the understanding of multi-channel e-fulfillment and to identify gaps between relevant managerial issues and academic literature, thereby indicating directions for future research. One of the recurrent patterns in today’s e-commerce operations is the combination of ‘bricks-and-clicks’, the integration of e-fulfillment into a portfolio of multiple alternative distribution channels. From a supply chain management perspective, multi-channel distribution provides opportunities for serving different customer segments, creating synergies, and exploiting economies of scale. However, in order to successfully exploit these opportunities companies need to master novel challenges. In particular, the design of a multi-channel distribution system requires a constant trade-off between process integration and separation across multiple channels. In addition, sales and operations decisions are ever more tightly intertwined as delivery and after-sales services are becoming key components of the product offering.Distribution;E-fulfillment;Literature Review;Online Retailing

A Stackelberg game theoretic model for optimizing product family architecting with supply chain consideration

Planning of an optimal product family architecture (PFA) plays a critical role in defining an organization's product platforms for product variant configuration while leveraging commonality and variety. The focus of PFA planning has been traditionally limited to the product design stage, yet with limited consideration of the downstream supply chain-related issues. Decisions of supply chain configuration have a profound impact on not only the end cost of product family fulfillment, but also how to design the architecture of module configuration within a product family. It is imperative for product family architecting to be optimized in conjunction with supply chain configuration decisions. This paper formulates joint optimization of PFA planning and supply chain configuration as a Stackelberg game. A nonlinear, mixed integer bilevel programming model is developed to deal with the leader–follower game decisions between product family architecting and supply chain configuration. The PFA decision making is represented as an upper-level optimization problem for optimal selection of the base modules and compound modules. A lower-level optimization problem copes with supply chain decisions in accordance with the upper-level decisions of product variant configuration. Consistent with the bilevel optimization model, a nested genetic algorithm is developed to derive near optimal solutions for PFA and the corresponding supply chain network. A case study of joint PFA and supply chain decisions for power transformers is reported to demonstrate the feasibility and potential of the proposed Stackelberg game theoretic joint optimization of PFA and supply chain decisions

Reinforcement Learning Algorithms and Complexity of Inventory Control, A Review

Driven by the ability to perform sequential decision-making in complex dynamic situations, Reinforcement Learning (RL) has quickly become a promising avenue to solve inventory control (IC) problems. The objective of this paper is to provide a comprehensive overview of the IC problems that have been effectively solved due to the application of RL. Our contributions include providing the first systematic review in this field of interest and application. We also identify potential extensions and come up with four propositions that formulate a theoretical framework that may help develop RL algorithms to solve complex IC problems. We recommend specific future research directions and novel approaches in solving IC problems

Inventory Analytics

"Inventory Analytics provides a comprehensive and accessible introduction to the theory and practice of inventory control – a significant research area central to supply chain planning. The book outlines the foundations of inventory systems and surveys prescriptive analytics models for deterministic inventory control. It further discusses predictive analytics techniques for demand forecasting in inventory control and also examines prescriptive analytics models for stochastic inventory control. Inventory Analytics is the first book of its kind to adopt a practicable, Python-driven approach to illustrating theories and concepts via computational examples, with each model covered in the book accompanied by its Python code. Originating as a collection of self-contained lectures, Inventory Analytics will be an indispensable resource for practitioners, researchers, teachers, and students alike.

The Multi-Location Transshipment Problem with Positive Replenishment Lead Times

Transshipments, monitored movements of material at the same echelon of a supply chain, represent an effective pooling mechanism. With a single exception, research on transshipments overlooks replenishment lead times. The only approach for two-location inventory systems with non-negligible lead times could not be generalized to a multi-location setting, and the proposed heuristic method cannot guarantee to provide optimal solutions. This paper uses simulation optimization by combining an LP/network flow formulation with infinitesimal perturbation analysis to examine the multi-location transshipment problem with positive replenishment lead times, and demonstrates the computation of the optimal base stock quantities through sample path optimization. From a methodological perspective, this paper deploys an elegant duality-based gradient computation method to improve computational efficiency. In test problems, our algorithm was also able to achieve better objective values than an existing algorithm.Transshipment;Infinitesimal Perturbation Analysis (IPA);Simulation Optimization

Optimal and heuristic repairable stocking and expediting in a fluctuating demand environment

We consider a single stock point for a repairable item. The repairable item is a critical component that is used in a fleet of technical systems such as trains, planes or manufacturing equipment. A number of spare repairables is purchased at the same time as the technical systems they support. Demand for those items is a Markov modulated Poisson process of which the underlying Markov process can be observed. Backorders occur when demand for a ready-for-use item cannot be fulfilled immediately. Since backorders render a system unavailable for use, there is a penalty per backorder per unit time. Upon failure, defective items are sent to a repair shop that offers the possibility of expediting repair. Expedited repairs have shorter lead times than regular repairs but are also more costly. For this system, two important decisions have to be taken: How many spare repairables to purchase initially and when to expedite repairs. We formulate the decision to use regular or expedited repair as a Markov decision process and characterize the optimal repair expediting policy for the infinite horizon average and discounted cost criteria. We find that the optimal policy may take two forms. The first form is to never expedite repair. The second form is a type of threshold policy. We provide necessary and sufficient closed-form conditions that determine what form is optimal. We also propose a heuristic repair expediting policy which we call the world driven threshold (WDT) policy. This policy is optimal in special cases and shares essential characteristics with the optimal policy otherwise. Because of its simpler structure, the WDT policy is fit for use in practice. We show how to compute optimal repairable stocking decisions in combination with either the optimal or a good WDT expediting policy. In a numerical study, we show that the WDT heuristic performs very close to optimal with an optimality gap below 0.76% for all instances in our test bed. We also compare it to more naive heuristics that do not explicitly use information regarding demand fluctuations and find that the WDT heuristic outperforms these naive heuristics by 11.85% on average and as much as 63.67% in some cases. This shows there is great value in leveraging knowledge about demand fluctuations in making repair expediting decisions