TY - JOUR
T1 - Optimal and heuristic policies for assemble-to-order systems with different review periods
AU - Karaarslan, Gönül A.
AU - Atan, Zümbül
AU - de Kok, Ton
AU - Kiesmüller, Gudrun P.
N1 - Publisher Copyright:
© 2018 Elsevier B.V.
PY - 2018/11/16
Y1 - 2018/11/16
N2 - We study an assemble-to-order (ATO) system with a single end product assembled from two components. The inventory levels of the components are reviewed periodically. One component is expensive and has a long lead time and short review period, whereas the other component is relatively cheap with a shorter lead time and longer review period. The lead times are deterministic and review periods are determined exogenously. Stochastic customer demand occurs for the end product only and unsatisfied customer demands are backordered. The system incurs holding costs for component inventories and penalty costs for backorders. Assuming an infinite planning horizon, our objective is to identify the optimal component ordering policy to minimize the long-run average cost. Under specific demand distributions we identify the properties of the optimal component ordering policy and observe that the optimal policy has a complex state-dependent structure. Motivated by the complexity of the optimal policy, we introduce a heuristic component ordering policy for more general demand distributions. Given that the heuristic performs well, we use it to measure the effects of various system parameters on the total cost.
AB - We study an assemble-to-order (ATO) system with a single end product assembled from two components. The inventory levels of the components are reviewed periodically. One component is expensive and has a long lead time and short review period, whereas the other component is relatively cheap with a shorter lead time and longer review period. The lead times are deterministic and review periods are determined exogenously. Stochastic customer demand occurs for the end product only and unsatisfied customer demands are backordered. The system incurs holding costs for component inventories and penalty costs for backorders. Assuming an infinite planning horizon, our objective is to identify the optimal component ordering policy to minimize the long-run average cost. Under specific demand distributions we identify the properties of the optimal component ordering policy and observe that the optimal policy has a complex state-dependent structure. Motivated by the complexity of the optimal policy, we introduce a heuristic component ordering policy for more general demand distributions. Given that the heuristic performs well, we use it to measure the effects of various system parameters on the total cost.
KW - Assemble-to-order systems
KW - Heuristic
KW - Optimal solution
KW - Ordering policy
KW - Supply chain management
UR - http://www.scopus.com/inward/record.url?scp=85047807066&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2018.05.013
DO - 10.1016/j.ejor.2018.05.013
M3 - Article
AN - SCOPUS:85047807066
SN - 0377-2217
VL - 271
SP - 80
EP - 96
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -