TY - JOUR
T1 - Make-to-order policies for a stochastic lot-sizing problem using overtime
AU - Dellaert, N.P.
AU - Melo, M.T.
PY - 1998
Y1 - 1998
N2 - We address a stochastic single item production system in a make-to-order environment where customer orders receive a promised delivery date upon arrival. Capacity is reserved for the production of the item but can be extended by working overtime. The problem consists of determining the optimal size of a production lot, so that delivery promises are met on time at the expense of minimal average costs. These include setup costs, holding costs for orders that are finished before their promised delivery date and penalty costs for orders that are not satisfied on time and are therefore backordered. Also, the use of capacity beyond the regularly available incurs overtime costs. Given that the optimal policy is likely to be too complex in most practical situations, we propose four different strategies for obtaining production lot sizes. Three of the rules are based on the well-known (s, S) and (R, S) policies for make-to-stock problems while the fourth strategy is motivated by a rule originally derived for a similar problem with unlimited production capacity. An extensive numerical study indicates the conditions under which each lot-sizing rule shows the best performance.
AB - We address a stochastic single item production system in a make-to-order environment where customer orders receive a promised delivery date upon arrival. Capacity is reserved for the production of the item but can be extended by working overtime. The problem consists of determining the optimal size of a production lot, so that delivery promises are met on time at the expense of minimal average costs. These include setup costs, holding costs for orders that are finished before their promised delivery date and penalty costs for orders that are not satisfied on time and are therefore backordered. Also, the use of capacity beyond the regularly available incurs overtime costs. Given that the optimal policy is likely to be too complex in most practical situations, we propose four different strategies for obtaining production lot sizes. Three of the rules are based on the well-known (s, S) and (R, S) policies for make-to-stock problems while the fourth strategy is motivated by a rule originally derived for a similar problem with unlimited production capacity. An extensive numerical study indicates the conditions under which each lot-sizing rule shows the best performance.
U2 - 10.1016/S0925-5273(98)00053-X
DO - 10.1016/S0925-5273(98)00053-X
M3 - Article
SN - 0925-5273
VL - 56-57
SP - 79
EP - 97
JO - International Journal of Production Economics
JF - International Journal of Production Economics
ER -