Multiproduct production/inventory control under random demands

Studies the optimal production/inventory control policy for a single machine multiproduct production system. The machine produces to fill the end-product inventory stock and the demand is satisfied from the inventory when available; unsatisfied demand is backlogged until the product becomes available as the result of production. For each product, the demand follows a Poisson process and the unit processing time is known. When the machine switches production from one product to another, it incurs a set-up time and a set-up cost. The relevant costs include the set-up cost, a cost per unit time while the machine is running, and linear costs for inventory and backlogging. This problem is modeled as a semi-Markov decision process using the criterion of minimizing expected total cost with discounting over an infinite horizon. Procedures for computing near-optimal policies and their error bounds are developed. The error bound given by the authors' procedure is shown to be much tighter than the one given by the "norm-based" approach. Computational test results are presented to show the structure of the near-optimal policy and how its accuracy is affected by the system characteristics such as capacity utilization and set-up time. >

[1]  Stephen C. Graves,et al.  A Tactical Planning Model for a Job Shop , 1986, Oper. Res..

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

[3]  Mandyam M. Srinivasan,et al.  Random review production/inventory systems with compound Poisson demands and arbitrary processing times , 1991 .

[4]  Christopher S. Tang,et al.  Linear Control of a Markov Production System , 1992, Oper. Res..

[5]  Ward Whitt,et al.  Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..

[6]  Stephen C. Graves,et al.  Safety stocks in manufacturing systems , 1987 .

[7]  Matthew J. Sobel,et al.  Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..

[8]  Stephen C. Graves,et al.  Technical Note - A One-Product Production/Inventory Problem under Continuous Review Policy , 1980, Oper. Res..

[9]  Fabien Chauny,et al.  Dynamic programming solution to the stochastic multiple lot dispatching in an FMS , 1988, [Proceedings] 1988 International Conference on Computer Integrated Manufacturing.

[10]  E. Denardo CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .

[11]  S. Graves The Multi-Product Production Cycling Problem , 1980 .

[12]  Uday S. Karmarkar,et al.  Batching Policy in Kanban Systems , 1989 .

[13]  P. Schweitzer,et al.  Part selection policy for a flexible manufacturing cell feeding several production lines , 1984 .

[14]  J. Wessels Markov programming by successive approximations by respect to weighted supremum norms , 1976, Advances in Applied Probability.

[15]  S. Lippman Semi-Markov Decision Processes with Unbounded Rewards , 1973 .