A cyclic production scheme for multi-item production systems with backlog:part 1

This paper is part 1 of two companion papers dealing with a multi-item production system in which the production is controlled by a fixed cycle scheme. The cycle consists of a production period with a fixed number of production times that can be used for production or idling, followed by a vacation. The duration of the vacation is independent of the production period. Demand arrives according to a (compound) Poisson process and is satisfied from stock or backlogged. The embedded process is modeled in discrete time and analyzed using generating functions. The optimal base stock level is derived from a newsvendor type relation. The model is extended to one with time slot dependent base stock levels. The results are used to construct a presumably optimal fixed cycle policy. In part 2 this fixed cycle policy is used to construct a dynamic production policy.

[1]  Henk Tijms,et al.  A Simple Numerical Approach for Infinite-State Markov Chains , 1991, Probability in the Engineering and Informational Sciences.

[2]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[3]  J Wijngaard,et al.  Decomposition for dynamic programming in production and inventory control , 1979 .

[4]  Johan van Leeuwaarden,et al.  Delay Analysis for the Fixed-Cycle Traffic-Light Queue , 2006, Transp. Sci..

[5]  Sandjai Bhulai.  Dynamic routing policies for multiskill call centers , 2009 .

[6]  A. Federgruen,et al.  The stochastic Economic Lot Scheduling Problem: cyclical base-stock policies with idle times , 1996 .

[7]  Piet Van Mieghem,et al.  The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation , 1996, Queueing Syst. Theory Appl..

[8]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[9]  Johan van Leeuwaarden,et al.  The acquisition queue , 2007, Queueing Syst. Theory Appl..

[10]  Evan L. Porteus.  Foundations of Stochastic Inventory Theory , 2002 .

[11]  Henk Tijms,et al.  A heuristic rule for routing customers to parallel servers , 1997 .

[12]  Ivo J. B. F. Adan,et al.  The stochastic economic lot scheduling problem: A survey , 2011, Eur. J. Oper. Res..

[13]  Jan van der Wal,et al.  AN MDP DECOMPOSITION APPROACH FOR TRAFFIC CONTROL AT ISOLATED SIGNALIZED INTERSECTIONS , 2008, Probability in the Engineering and Informational Sciences.

[14]  van Mja Michel Eenige.  Queueing systems with periodic service , 1996 .

[15]  Johan van Leeuwaarden,et al.  Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue , 2006, Transp. Sci..

[16]  R. Bellman,et al.  Dynamic Programming and Markov Processes , 1960 .

[17]  Johan van Leeuwaarden,et al.  Analytic Computation Schemes for the Discrete-Time Bulk Service Queue , 2005, Queueing Syst. Theory Appl..

[18]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[19]  J. Darroch.  On the Traffic-light Queue , 1964 .

[20]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[21]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[22]  Johan van Leeuwaarden,et al.  On the application of Rouché's theorem in queueing theory , 2006, Oper. Res. Lett..

[23]  J. M. Norman,et al.  Heuristic procedures in dynamic programming , 1972 .

[24]  A. G. Pakes,et al.  Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..