en>TakuyaMurata at 17:17, 19 February 2014

2014-02-19T17:17:12Z

← Older revision		Revision as of 19:17, 19 February 2014
Line 1:		Line 1:
	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.		Transport Engineer Anton Kull from Flamborough, enjoys caravaning, property developers in singapore and antiques. Was especially motivated after making a vacation to Puerto-Princesa Subterranean River National Park.<br><br>Also visit my web-site: [http://meckanimal.com/?option=com_k2&view=itemlist&task=user&id=47869 commercial real estate for sale]
	~~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).<ref name="song">{{cite doi\|10.1016/S0927-0507(03)11011-0}}</ref>~~

	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.<ref name="song" />

	~~==Model definition==~~

	~~===Single period model===~~

	~~This 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<ref>{{cite doi\|10.1016/0167-6377(86)90089-1}}</ref>~~

	~~# components acquired~~
	~~# demand realized~~
	~~# components allocated, products produced~~

	~~We use the following notation<ref name="song" />~~
	~~{\| class="wikitable"~~
	\|-
	~~! Symbol~~
	~~! Meaning~~
	\|-
	~~\| ''m''~~
	~~\| total number of components~~
	\|-
	~~\| ''n''~~
	~~\| total number of products~~
	\|-
	~~\| ''~~a~~''<sub>''i''</sub><sup>''j''</sup>~~
	~~\| units of component ''i'' required~~ to ~~make one unit of product ''j''~~
	\|-
	~~\| ''d''~~<~~sub~~>~~''j''~~<~~/sub~~>
	~~\| demand for product ''j''~~
	\|-
	~~\| ''y''<sub>''i''<~~/~~sub>~~
	~~\| supply for component ''i''~~
	\|-
	~~\| ''p''<sub>''j''<~~/~~sub>~~
	~~\| penalty cost for unit shortage of product ''j''~~
	\|-
	~~\| ''h''<sub>''i''</sub>~~
	~~\| cost for unit excess of component ''i''~~
	\|-
	~~\| ''z''<sub>''j''</sub>~~
	~~\| production level of product ''j''~~
	\|-
	~~\| ''w''<sub>''j''<~~/~~sub>~~
	~~\| shortage of product ''j''~~
	\|-
	~~\| ''x''<sub>''i''</sub>~~
	~~\| excess of component ''i''~~
	\|}

	~~In the final stage when demands are known the optimization problem faced is to~~

	~~:<math>\begin{align}~~
	~~\text{minimize } G(\mathbf y, \mathbf d) &~~= ~~\mathbf h' \mathbf x+ \mathbf p' \mathbf w\\~~
	~~\text{subject to }~~
	~~A \mathbf z + \mathbf x~~ &= ~~\mathbf y\\~~
	~~\mathbf z + \mathbf w~~ &= ~~\mathbf d\\~~
	~~\mathbf w, \mathbf x, \mathbf z &\geq 0,\end{align}</math>~~

	~~and we can therefore write the optimization problem at the first stage as~~

	~~:<math>\begin{align}~~
	~~\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{align}</math>~~

	~~with '''x'''<sub>0</sub> representing the starting inventory vector and ''c'' the cost function for acquiring the components.~~

	=~~==Continuous time===~~

	~~In 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.<ref>{{cite doi\|10.1287/opre.50.5.889.372}}</ref>

	~~==References==~~

	~~{{Reflist}}~~

	~~[[Category:Operations research]]~~
	~~[[Category:Mathematical optimization]~~]

en>TakuyaMurata: homotopy class (of course)

2013-12-27T00:32:17Z

homotopy class (of course)

New page

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).<ref name="song">{{cite doi|10.1016/S0927-0507(03)11011-0}}</ref>

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.<ref name="song" />

==Model definition==

===Single period model===

This 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<ref>{{cite doi|10.1016/0167-6377(86)90089-1}}</ref>

# components acquired
# demand realized
# components allocated, products produced

We use the following notation<ref name="song" />
{| class="wikitable"
|-
! Symbol
! Meaning
|-
| ''m''
| total number of components
|-
| ''n''
| total number of products
|-
| ''a''''i''''j''
| units of component ''i'' required to make one unit of product ''j''
|-
| ''d''''j''
| demand for product ''j''
|-
| ''y''''i''
| supply for component ''i''
|-
| ''p''''j''
| penalty cost for unit shortage of product ''j''
|-
| ''h''''i''
| cost for unit excess of component ''i''
|-
| ''z''''j''
| production level of product ''j''
|-
| ''w''''j''
| shortage of product ''j''
|-
| ''x''''i''
| excess of component ''i''
|}

In the final stage when demands are known the optimization problem faced is to

:<math>\begin{align}
\text{minimize } G(\mathbf y, \mathbf d) &= \mathbf h' \mathbf x+ \mathbf p' \mathbf w\\
\text{subject to }
A \mathbf z + \mathbf x &= \mathbf y\\
\mathbf z + \mathbf w &= \mathbf d\\
\mathbf w, \mathbf x, \mathbf z &\geq 0,\end{align}</math>

and we can therefore write the optimization problem at the first stage as

:<math>\begin{align}
\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{align}</math>

with '''x'''0 representing the starting inventory vector and ''c'' the cost function for acquiring the components.

===Continuous time===

In 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.<ref>{{cite doi|10.1287/opre.50.5.889.372}}</ref>

==References==

{{Reflist}}

[[Category:Operations research]]
[[Category:Mathematical optimization]]

Homotopy group with coefficients - Revision history

en>TakuyaMurata at 17:17, 19 February 2014

en>TakuyaMurata: homotopy class (of course)