Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems |
| |
| Authors: | Kai Huang Ton de Kok |
| |
| Affiliation: | 1. Operations Management, DeGroote School of Business, McMaster University, Ontario, Canada;2. Operations, Planning, Accounting, and Control (OPAC), School of Industrial Engineering, Eindhoven University of Technology, The Netherlands |
| |
| Abstract: | In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015 |
| |
| Keywords: | assemble‐to‐order periodic‐review cost minimization mathematical programming stochastic programming |
|
|
