Scheduling policies for a repair shop problem

In this paper, we analyze a repair shop serving several fleets of machines that fail from time to time. To reduce downtime costs, a continuous-review spare machine inventory is kept for each fleet. A spare machine, if available on stock, is installed instantaneously in place of a broken machine. When a repaired machine is returned from the repair shop, it is placed in inventory for future use if the fleet has the required number of machines operating. Since the repair shop is shared by different fleets, choosing which type of broken machine to repair is crucial to minimize downtime and holding costs. The optimal policy of this problem is difficult to characterize, and, therefore, is only formulated as a Markov Decision Process to numerically compute the optimal cost and base-stock level for each spare machine inventory. As an alternative, we propose the dynamic Myopic(R) policy, which is easy to implement, yielding costs very close to the optimal. Most of the time it outperforms the static first-come-first-served, and preemptive-resume priority policies. Additionally, via our numerical study, we demonstrate that repair shop pooling is better than reserving a repair shop for each fleet.

[1]  R. Syski,et al.  Fundamentals of Queueing Theory , 1999, Technometrics.

[2]  Paul H. Zipkin,et al.  Dynamic Scheduling Rules for a Multiproduct Make-to-Stock Queue , 1997, Oper. Res..

[3]  Manoj Kumar Tiwari,et al.  An integrated approach for logistic and vendor managed inventory in supply chain , 2010, Expert Syst. Appl..

[4]  J. Sztrik,et al.  FINITE-SOURCE QUEUEING SYSTEMS AND THEIR APPLICATIONS A Bibliography , 2002 .

[5]  Frank Kelly,et al.  Networks of queues with customers of different types , 1975, Journal of Applied Probability.

[6]  Michel Veran.  Exact analysis of a priority queue with finite source , 1984 .

[7]  Manoj Kumar Tiwari,et al.  Performance evaluation of flexible manufacturing systems under uncertain and dynamic situations , 2008 .

[8]  Y. Gerchak,et al.  Capacity Pooling and Cost Sharing among Independent Firms in the Presence of Congestion , 2007 .

[9]  R. P. Sundarraj,et al.  A model for standardizing human decisions concerning service-contracts management , 2006, Ann. Oper. Res..

[10]  C. Waters.  Logistics: An Introduction to Supply Chain Management , 2003 .

[11]  F. Chan,et al.  Inventory management in a lateral collaborative manufacturing supply chain: a simulation study , 2012 .

[12]  S. Benjaafar,et al.  Capacity Sharing and Cost Allocation among Independent Firms in the Presence of Congestion , 2009 .

[13]  Casey A. Volino,et al.  A First Course in Stochastic Models , 2005, Technometrics.

[14]  Paul Zipkin,et al.  A Queueing Model to Analyze the Value of Centralized Inventory Information , 1990, Oper. Res..

[15]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Multiclass Make-to-Stock Queue , 2015, Oper. Res..

[16]  Gary H. Chao,et al.  Optimal server scheduling in nonpreemptive finite-population queueing systems , 2007, Queueing Syst. Theory Appl..

[17]  Manoj Kumar Tiwari,et al.  Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach , 2006 .

[18]  Donald Gross,et al.  The Machine Repair Problem with Heterogeneous Populations , 1981, Oper. Res..

[19]  Yves Dallery,et al.  Dynamic Scheduling in a Make-to-Stock System: A Partial Characterization of Optimal Policies , 2000, Oper. Res..

[20]  José Niño-Mora,et al.  Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues , 2006, Math. Oper. Res..

[21]  Gabriel R. Bitran,et al.  Two-Class Priority Queueing System with State-Dependent Arrivals , 2002, Queueing Syst. Theory Appl..

[22]  Henk C. Tijms,et al.  A First Course in Stochastic Models: Tijms/Stochastic Models , 2003 .

[23]  Lawrence M. Wein,et al.  Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points , 1996, Oper. Res..

[24]  M. Jeya Chandra,et al.  A Study of Multiple Finite-Source Queueing Models , 1986 .

[25]  Pedram Sahba,et al.  The impact of transportation delays on repairshop capacity pooling and spare part inventories , 2011, Eur. J. Oper. Res..

[26]  Felix T.S. Chan,et al.  A genetic algorithm approach for production scheduling with mould maintenance consideration , 2012 .

[27]  Dragan Banjevic,et al.  Optimization models for critical spare parts inventories—a reliability approach , 2011, J. Oper. Res. Soc..

[28]  Subhash Wadhwa,et al.  Inventory performance of some supply chain inventory policies under impulse demands , 2009 .

[29]  J. Taylor,et al.  AN APPLICATION OF THE BIRTH AND DEATH PROCESS TO THE PROVISION OF SPARE MACHINES , 1954 .

[30]  Seyed M. R. Iravani,et al.  When does the cµ rule apply to finite-population queueing systems? , 2005, Oper. Res. Lett..

[31]  Hing Kai Chan,et al.  Analysis of dynamic control strategies of an FMS under different scenarios , 2004 .

[32]  Paul Zipkin.  Performance Analysis of a Multi-Item Production-Inventory System Under Alternative Policies , 1995 .

[33]  Lani Haque,et al.  A survey of the machine interference problem , 2007, Eur. J. Oper. Res..

[34]  Lajos Takács,et al.  Priority queues , 2019, The Art of Multiprocessor Programming.

[35]  F. Chan,et al.  An incorporated inventory transport system with two types of customers for multiple perishable goods , 2012 .

[36]  Hossein Abouee-Mehrizi,et al.  Scheduling policies in the M/G/1 make-to-stock queue , 2010, J. Oper. Res. Soc..

[37]  J. Nio-Mora.  Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues , 2006 .

[38]  Richard F. Deckro,et al.  Modeling diminishing marginal returns in ahierarchical inventory system of reparable spare parts , 1999, Ann. Oper. Res..

[39]  Matthieu van der Heijden,et al.  An approximate approach for the joint problem of level of repair analysis and spare parts stocking , 2015, Ann. Oper. Res..

[40]  Albert Y. Ha.  Optimal Dynamic Scheduling Policy for a Make-To-Stock Production System , 1997, Oper. Res..

[41]  Dragan Banjevic,et al.  Spare parts provisioning for multiple k-out-of-n:G systems , 2013 .

[42]  Douglas R. Miller.  Computation of Steady-State Probabilities for M/M/1 Priority Queues , 1981, Oper. Res..

[43]  Hing Kai Chan,et al.  A modified genetic algorithm approach for scheduling of perfect maintenance in distributed production scheduling , 2009, Eng. Appl. Artif. Intell..