On component commonality for periodic review assemble-to-order systems
From MaRDI portal
Publication:1657397
DOI10.1007/s10479-017-2507-2zbMath1404.90102OpenAlexW2613210738MaRDI QIDQ1657397
Xiao Jiao Wang, Hongfeng Liang, Antoine Deza, Kai Huang
Publication date: 13 August 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2507-2
stochastic programminginventory replenishmentcomponent commonalityassemble-to-ordercomponent allocation
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Unnamed Item
- Efficiency in shortage reduction when using a more expensive common component.
- Benchmarking non-first-come-first-served component allocation in an assemble-to-order system
- Finding and identifying optimal inventory levels for systems with common components
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Introduction to Stochastic Programming
- Component commonality in a multiple-period inventory model with service level constraints
- Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems
This page was built for publication: On component commonality for periodic review assemble-to-order systems