Make to Order or Make to Stock: Model and Application

Some firms make all their products to order while others make them to stock. There are a number of firms that maintain a middle ground, where some items are made to stock and others are made to order. This paper was motivated by a consumer product company faced with the decision about which items to make to stock and which ones to make to order, and the inventory and production policy for the make-to-stock items. The production environment is characterized by multiple items, setup times between the production of consecutive items, limited capacity, and congestion effects. In such an environment, making an item to order reduces inventory costs for that item, but might increase the lot size and inventory costs for the items made to stock. Also, lead times increase because of congestion effects, resulting in higher safety stocks for make-to-stock items and lower service levels for make-to-order items, thus leading to a complex trade-off. We develop a nonlinear, integer programming formulation of the problem. We present an efficient heuristic to solve the problem, which was motivated by key results for a special case of the problem without congestion effects that can be solved optimally. We also develop a lower bound to evaluate the performance of the heuristic. A computational study indicates that the heuristic performs well. We discuss the application of the model in a large firm and the resulting insights. We also provide insights into the impact of various problem parameters on the make-to-order versus make-to-stock decisions using a computational study. In particular, we find that the average number of setups of an item selected for make-to-stock production is always less than half the average number of setups of the item if it were to be made to order. Also, factors other than an item's demand, such as its setup time, processing time, and unit holding cost, impact the make-to-order versus make-to-stock decision.

[1]  Lode Li The role of inventory in delivery-time competition , 1992 .

[2]  Gabriel R. Bitran,et al.  Analysis of the ΣPhi/Ph/1 Queue , 1994, Oper. Res..

[3]  Wallace J. Hopp,et al.  Easily Implementable Inventory Control Policies , 1997, Oper. Res..

[4]  U. Karmarkar,et al.  Lotsizing in Multi-Item Multi- Machine Job Shops , 1985 .

[5]  Paul H. Zipkin,et al.  Models for Design and Control of Stochastic, Multi-Item Batch Production Systems , 1986, Oper. Res..

[6]  John O. McClain,et al.  Coordinating production and inventory to improve service , 1997 .

[7]  James E. Hodder,et al.  Simple solution procedures for nonlinear programming problems that are derivative decomposable , 1987 .

[8]  S. Albin On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .

[9]  T. Williams Special products and uncertainty in production/inventory systems☆ , 1984 .

[10]  Uday S. Karmarkar,et al.  Lot Sizes, Lead Times and In-Process Inventories , 1987 .

[11]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[12]  A. Federgruen,et al.  The Impact of Adding a Make-To-Order Item to a Make-To-Stock Production System , 1999 .

[13]  W. Popp Simple And Combined Inventory Policies, Production to Stock or to Order? , 1965 .

[14]  Izak Duenyas,et al.  Optimal Admission Control and Sequencing in a Make-to-Stock/Make-to-Order Production System , 2000, Oper. Res..