In applied probability, an assemble-to-order system is a model of a warehouse operating a build to order policy where products are assembled from components only once an order has been made. The time to assemble a product from components is negligible, but the time to create components is significant (for example, they must be ordered from a supplier).[1]
Research typically focuses on finding good policies for inventory levels and on the impact of different configurations (such as having more shared parts). The special case of only one product is an assembly system, the case of just once component is a distribution system.[1]
Model definition
editSingle period model
editThis case is a generalisation of the newsvendor model (which has only one component and one product). The problem involves three stages and we give one formation of the problem below[2]
- components acquired
- demand realized
- components allocated, products produced
We use the following notation[1]
| Symbol | Meaning |
|---|---|
| m | total number of components |
| n | total number of products |
| aij | units of component i required to make one unit of product j |
| dj | demand for product j |
| yi | supply for component i |
| pj | penalty cost for unit shortage of product j |
| hi | cost for unit excess of component i |
| zj | production level of product j |
| wj | shortage of product j |
| xi | excess of component i |
In the final stage when demands are known the optimization problem faced is to
and we can therefore write the optimization problem at the first stage as
![{\displaystyle {\begin{aligned}{\text{minimize }}&c(\mathbf {y} -\mathbf {x} _{0})+\mathbb {E} _{\mathbf {d} }[G(\mathbf {y} ,\mathbf {d} )]\\{\text{subject to }}&\mathbf {y} \geq \mathbf {x} _{0},\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/4867981d3f6e6394eb64fac6a9ff2aa4e2f8de25)
with x0 representing the starting inventory vector and c the cost function for acquiring the components.
Continuous time
editIn continuous time orders for products arrive according to a Poisson process and the time required to produce components are independent and identically distributed for each component. Two problems typically studied in this system are to minimize the expected backlog of orders subject to a constraint on the component inventory, and to minimize the expected component inventory subject to constraints on the rate at which orders must be completed.[3]
References
edit- ^ a b c Song, J. S.; Zipkin, P. (2003). "Supply Chain Operations: Assemble-to-Order Systems". Supply Chain Management: Design, Coordination and Operation (PDF). Handbooks in Operations Research and Management Science. Vol. 11. pp. 561–596. doi:10.1016/S0927-0507(03)11011-0. ISBN 9780444513281.
- ^ Gerchak, Y.; Henig, M. (1986). "An inventory model with component commonality". Operations Research Letters. 5 (3): 157. doi:10.1016/0167-6377(86)90089-1.
- ^ Song, J. S.; Yao, D. D. (2002). "Performance Analysis and Optimization of Assemble-to-Order Systems with Random Lead Times" (PDF). Operations Research. 50 (5): 889. doi:10.1287/opre.50.5.889.372. JSTOR 3088488.