Inventory control in multi-item production systems

This thesis focusses on the analysis and construction of control policies in multiitem production systems. In such systems, multiple items can be made to stock, but they have to share the finite capacity of a single machine. This machine can only produce one unit at a time and if it is set-up for one item, a switch-over or set-up time is needed to start the production of another item. Customers arrive to the system according to (compound) Poisson processes and if they see no stock upon arrival, they are either considered as a lost sale or backlogged. In this thesis, we look at production systems with backlog and production systems with lost sales. In production systems with lost sales, all arriving customers are considered lost if no stock is available and penalty costs are paid per lost customer. In production systems with backlog, arriving customers form a queue if they see no stock and backlogging costs are paid for every backlogged customer per time unit. These production systems find many applications in industry, for instance glass and paper production or bulk production of beers, see Anupindi and Tayur [2]. The objective for the production manager is to minimize the sum of the holding and penalty or backlogging costs. At each decision moment, the manager has to decide whether to switch to another product type, to produce another unit of the type that is set-up or to idle the machine. In order to minimize the total costs, a balance must be found between a fast switching scheme that is able to react to sudden changes in demand and a production plan with a little loss of capacity. Unfortunately, a fast switching scheme results in a loss of capacity, because switching from one product type to another requires a switch-over or set-up time. In the optimal production strategy, decisions depend on the complete state of the system. Because the processes at the different product flows depend on these decisions, the processes also depend on the complete state of the system. This means that the processes at the different product flows are not independent, which makes the analysis and construction of the optimal production strategy very complex. In fact, the complexity of the determination of this policy grows exponentially in the number of product types and if this number is too large, the optimal policy becomes intractable. Production strategies in which decisions depend on the complete system are defined as global lot sizing policies and are often difficult to construct or analyse, because of the dependence between the different product flows. However, in this thesis the construction of a global lot sizing policy is presented which also works for production systems with a large number of product types. The key factor that makes the construction possible is the fact that it is based on a fixed cycle policy. In Chapter 2, the fixed cycle policy is analysed for production systems with lost sales and in Chapter 6, the fixed cycle policy is analysed for production systems with backlog. The fixed cycle policy can be analysed per product flow and this decomposition property allows for the determination of the so called relative values. If it is assumed that one continues with a fixed cycle control, the relative values per product type represent the relative expected future costs for each decision. Based on these relative values, an improvement step (see Norman [65]) is performed which results in a ‘one step improvement’ policy. This policy is constructed and analysed in Chapters 2 and 7 for production systems with lost sales and production systems with backlog, respectively. This global lot sizing policy turns out to perform well compared to other, heuristic production strategies, especially in systems with a high load and demand processes with a high variability. A similar approach as for the production system with a single machine is performed in a system with two machines and lost sales in Chapter 3. Results show that in some cases the constructed strategy works well, although in some systems two separate one step improvement policies perform better. Examples of more heuristic production strategies are gated and exhaustive basestock policies. In these ’local lot sizing‘ policies, decisions depend only on the stock level of the product type that is set-up. But even in these policies, the processes at the different product flows are dependent. This makes the analysis difficult, but for production systems with backlog a translation can be made to a queueing system by looking at the number of products short to the base-stock level. So the machine becomes a server and each product flow becomes a queue. In these queueing systems, also known as polling systems, gated and exhaustive base-stock policies become gated and exhaustive visit disciplines. For polling systems, an exact analysis of the queue length or waiting time distribution is often possible via generating functions or Laplace-Stieltjes transforms. In Chapter 5, the determination of the sojourn time distribution of customers in a polling system with a (globally) gated visit discipline is presented, which comes down to the determination of the lead time distribution in the corresponding production system.

[1]  Erik M. M. Winands,et al.  Iterative approximation of k-limited polling systems , 2007, Queueing Syst. Theory Appl..

[2]  Ronald Rietman,et al.  An M/G/1 Queueing Model with Gated Random Order of Service , 2004, Queueing Syst. Theory Appl..

[3]  C. R. Sox,et al.  Optimization-based planning for the stochastic lot-scheduling problem , 1997 .

[4]  B. Fleischmann The discrete lot-sizing and scheduling problem , 1990 .

[5]  J. Baras,et al.  Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal , 1985, Advances in Applied Probability.

[6]  J. Shanthikumar,et al.  Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines , 1987, Journal of Applied Probability.

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

[8]  Adam Wierman,et al.  Scheduling in polling systems , 2007, Perform. Evaluation.

[9]  M Michael Wagner,et al.  A local search algorithm for the optimization of the stochastic economic lot scheduling problem , 2004 .

[10]  Thomas Yew Sing Lee,et al.  Exact analysis of asymmetric random polling systems with single buffers and correlated input process , 1996, Queueing Syst. Theory Appl..

[11]  Awi Federgruen,et al.  Determining Production Schedules Under Base-Stock Policies in Single Facility Multi-Item Production Systems , 1998, Oper. Res..

[12]  Richard Loulou,et al.  Multiproduct production/inventory control under random demands , 1995, IEEE Trans. Autom. Control..

[13]  K. R. Krishnan,et al.  Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic , 1992, Ann. Oper. Res..

[14]  Isi Mitrani,et al.  Polling Models with Threshold Switching , 1995 .

[15]  Ivo J. B. F. Adan,et al.  A Two-Queue Polling Model with Two Priority Levels in the First Queue , 2010, Discret. Event Dyn. Syst..

[16]  Hanoch Levy,et al.  Cyclic reservation schemes for efficient operation of multiple-queue single-server systems , 1992, Ann. Oper. Res..

[17]  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.

[18]  Sridhar R. Tayur,et al.  Managing Stochastic Multiproduct Systems: Model, Measures, and Analysis , 1998, Oper. Res..

[19]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[20]  R. D. van der Mei,et al.  Analysis of multiple-server polling systems by means of the power-series algorithm , 1994 .

[21]  J Walvander,et al.  A cyclic production scheme for multi-item production systems with backlog:part 1 , 2010 .

[22]  H. Thorisson Coupling, stationarity, and regeneration , 2000 .

[23]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[24]  Ahmad Al Hanbali,et al.  A transient analysis of polling systems operating under exponential time-limited service disciplines , 2009 .

[25]  M. Khouja The single-period (news-vendor) problem: literature review and suggestions for future research , 1999 .

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

[27]  Gideon Weiss,et al.  Dynamic priority rules when polling with multiple parallel servers , 1992, Oper. Res. Lett..

[28]  Scott E. Grasman,et al.  Finite buffer polling models with routing , 2005, Eur. J. Oper. Res..

[29]  Victor C. M. Leung,et al.  Polling-based protocols for packet voice transport over IEEE 802.11 wireless local area networks , 2006, IEEE Wireless Communications.

[30]  Hanoch Levy,et al.  Efficient visit frequencies for polling tables: minimization of waiting cost , 1991, Queueing Syst. Theory Appl..

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

[32]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.

[33]  Ger Koole,et al.  Asigning a Single Server to Inhomogeneous Queues with Switching Costs , 1997, Theor. Comput. Sci..

[34]  Ag Ton de Kok,et al.  Determination of an order-up-to policy in the stochastic economic lot scheduling model , 2004 .

[35]  Onno J. Boxma,et al.  A pseudoconservation law for service systems with a polling table , 1990, IEEE Trans. Commun..

[36]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[37]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[38]  Tetsuya Takine,et al.  An analysis for interdeparture process of a polling system with single message buffer at each station , 1989 .

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

[40]  Ward Whitt,et al.  An operational calculus for probability distributions via Laplace transforms , 1996, Advances in Applied Probability.

[41]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

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

[43]  J. Snyder Coupling , 1998, Critical Inquiry.

[44]  Andrea Zanella,et al.  Performance Evaluation of Bluetooth Polling Schemes: An Analytical Approach , 2004, Mob. Networks Appl..

[45]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

[46]  Keith G. Lockyer Heuristic Procedures in Dynamic Programming , 1973 .

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

[48]  Benjamin Avi-Itzhak,et al.  Response times in gated M/G/1 queues: The processor-sharing case , 1989, Queueing Syst. Theory Appl..

[49]  Marco Ajmone Marsan,et al.  GSPN Models of Markovian Multiserver Multiqueue Systems , 1990, Perform. Evaluation.

[50]  F. Baccelli,et al.  Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences , 2010 .

[51]  O. Boxma Polling Systems , 2010 .

[52]  Uri Yechiali,et al.  Polling under the Randomly Timed Gated Regime , 1998 .

[53]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[54]  Scott E. Grasman,et al.  Setting basestock levels in multi-product systems with setups and random yield , 2008 .

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

[56]  Chong Kwan Un,et al.  Performance Analysis of Markovian Polling Systems with Single Buffers , 1994, Perform. Evaluation.

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

[58]  de Ag Ton Kok A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue , 1989 .

[59]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[60]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[61]  Ivo J. B. F. Adan,et al.  Mean value analysis for polling systems , 2006, Queueing Syst. Theory Appl..

[62]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[63]  R. Serfozo Introduction to Stochastic Networks , 1999 .

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

[65]  Nico Dellaert Production to Order: Models and Rules for Production Planning , 1989 .

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

[67]  Jacobus E. Rooda,et al.  Controller design for flow networks of switched servers with setup times: the Kumar-Seidman Case as an illustrative example , 2008 .

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

[69]  高木 英明,et al.  Analysis of polling systems , 1986 .

[70]  Awi Federgruen,et al.  Approximating queue size and waiting time distributions in general polling systems , 1994, Queueing Syst. Theory Appl..

[71]  Tayfur Altiok,et al.  Single‐stage, multi‐product production/inventory systems with lost sales , 1995 .

[72]  Ivo J. B. F. Adan,et al.  A polling model with multiple priority levels , 2010, Perform. Evaluation.

[73]  Onno Boxma,et al.  Waiting times in polling systems with various service disciplines , 2008 .

[74]  Preston Lerner,et al.  Single stage to...where , 1994 .

[75]  John Bruin,et al.  A dynamic control strategy formulti-item production systems with backlog:part 2 , 2010 .

[76]  Ward Whitt,et al.  The renewal-process stationary-excess operator , 1985, Journal of Applied Probability.

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

[78]  Ajmone MarsanMarco,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984 .

[79]  Kiran M. Rege,et al.  A single server queue with gated processor-sharing discipline , 1989, Queueing Syst. Theory Appl..

[80]  Armand M. Makowski,et al.  K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal☆ , 1985 .

[81]  Ilias Iliadis,et al.  A comparison of three random disciplines , 1994, Queueing Syst. Theory Appl..

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

[83]  Awi Federgruen,et al.  Customer waiting‐time distributions under base‐stock policies in single‐facility multi‐item production systems , 1996 .

[84]  Alan Scheller-Wolf,et al.  Analysis of cycle stealing with switching times and thresholds , 2005, Perform. Evaluation.

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

[86]  V. Sridharan,et al.  A hierarchical approach for capacity coordination in multiple products single-machine production systems with stationary stochastic demands , 1995 .

[87]  P. Schweitzer Iterative solution of the functional equations of undiscounted Markov renewal programming , 1971 .

[88]  Georg N. Krieg,et al.  A decomposition method for multi-product kanban systems with setup times and lost sales , 2002 .