Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules

This paper considers a multiproduct, single-server production system where both setup times and costs are incurred whenever the server changes product. The system is make-to-order with a per unit backlogging cost. The objective is to minimize the long-run average cost per unit time. Using a fluid model, we provide a closed-form lower bound on system performance. This bound is also shown to provide a lower bound for stochastic systems when scheduling is local or static, but is only an approximation when scheduling is global or dynamic. The fluid bound suggests both local and global scheduling heuristics, which are tested for the stochastic system via a simulation study.

[1]  Marc Salomon,et al.  Batching decisions: structure and models , 1994 .

[2]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[3]  Steven Nahmias,et al.  Production and operations analysis , 1992 .

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

[5]  R. D. van der Mei Polling systems with periodic server routing in heavy traffic , 1999 .

[6]  John A. Buzacott,et al.  A two-stage tandem queue attended by a moving server with holding and switching costs , 1997, Queueing Syst. Theory Appl..

[7]  John Hasenbein Tutorial: Scheduling Multiclass Queueing Networks via Fluid Models , 2002 .

[8]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[9]  Diwakar Gupta,et al.  When should a roving server be patient , 1996 .

[10]  DIWAKAR GUPTA,et al.  Workload allocation in multi-product, multi-facility production systems with setup times , 1999 .

[11]  Marc J. Schniederjans,et al.  A Heuristic Scheduling System for Ceramic Industrial Coatings , 2000, Interfaces.

[12]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[13]  Kenneth R. Baker Heuristic procedures for scheduling job families with setups and due dates , 1999 .

[14]  Lawrence M. Wein,et al.  Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem , 2015, Oper. Res..

[15]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[16]  Onno Boxma,et al.  Dynamic server assignment in a two-queue model , 1995 .

[17]  Peter J. Ramadge,et al.  On real-time scheduling policies for flexible manufacturing systems , 1992 .

[18]  T. Olsen LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS , 2001, Probability in the Engineering and Informational Sciences.

[19]  Marco Ajmone Marsan,et al.  Dynamic polling orders in multiserver multiqueue systems , 1995 .

[20]  Mandyam M. Srinivasan,et al.  Descendant set: an efficient approach for the analysis of polling systems , 1994, IEEE Trans. Commun..

[21]  J. Dai On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

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

[23]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[24]  S. Elmaghraby The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[25]  P. R. Kumar,et al.  Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[26]  Hideaki Takagi,et al.  Stochastic Analysis of Computer and Communication Systems , 1990 .

[27]  Lawrence M. Wein,et al.  The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies , 2015, Oper. Res..

[28]  Robert D. van der Mei,et al.  Polling systems in heavy traffic: Exhaustiveness of service policies , 1997, Queueing Syst. Theory Appl..

[29]  Feng Cheng,et al.  A Practical Scheduling Method for Multiclass Production Systems with Setups , 1999 .

[30]  Uday S. Karmarkar,et al.  Multi-item batching heuristics for minimization of queueing delays , 1992 .

[31]  Hanoch Levy,et al.  Efficient Visit Orders for Polling Systems , 1993, Perform. Evaluation.

[32]  R. Agrawal,et al.  Server allocation and routing in homogeneous queues with switching penalties , 1996, IEEE Trans. Autom. Control..

[33]  C. Maglaras Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality , 2000 .

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

[35]  Sean P. Meyn Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation , 2001, SIAM J. Control. Optim..

[36]  Robert D. van der Mei,et al.  Optimization of Polling Systems with Bernoulli Schedules , 1995, Perform. Evaluation.

[37]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[38]  Uri Yechiali,et al.  Dynamic scheduling in single‐server multiclass service systems with unit buffers , 1991 .

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

[40]  Dimitris Bertsimas,et al.  Decomposition results for general polling systems and their applications , 1999, Queueing Syst. Theory Appl..

[41]  J. O. Efficient visit frequencies for polling tables : minimization of waiting cost , .

[42]  Izak Duenyas,et al.  Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups , 1996 .

[43]  J. R. Perkins,et al.  Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systems , 1989 .

[44]  Robert D. van der Mei,et al.  Distribution of the Delay in Polling Systems in Heavy Traffic , 1999, Perform. Evaluation.

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

[46]  Thom J. Hodgson,et al.  Dynamic lot size/sequencing policies in a multi-product, single-machine system , 1997 .

[47]  J. G. Dai,et al.  Stabilizing Queueing Networks with Setups , 2004, Math. Oper. Res..

[48]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[49]  J. Michael Harrison,et al.  Brownian models of multiclass queueing networks: Current status and open problems , 1993, Queueing Syst. Theory Appl..

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

[51]  Gideon Weiss,et al.  A Fluid Heuristic for Minimizing Makespan in Job Shops , 2002, Oper. Res..

[52]  Sean P. Meyn Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations , 2003, SIAM J. Control. Optim..

[53]  Sherman X. Bai,et al.  The Common Cycle Economic Lot Scheduling Problem with Backorders: Benefits of Controllable Production Rates , 1997, J. Glob. Optim..

[54]  R. Nadarajan,et al.  Optimal control for two queues with one switching server , 2001 .

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

[56]  Sem C. Borst,et al.  Optimization of fixed time polling schemes , 1994, Telecommun. Syst..

[57]  Mark P. Van Oyen,et al.  Properties of Optimal-Weighted Flowtime Policies with a Makespan Constraint and Set-up Times , 2000, Manuf. Serv. Oper. Manag..

[58]  Dimitris Bertsimas,et al.  Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, the Single-Station Case , 1999 .

[59]  Christos G. Cassandras,et al.  Optimal control of polling models for transportation applications , 1996 .

[60]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[61]  L.-C. Hwang,et al.  Optimal design of a finite-buffer polling network with mixed service discipline and general service order sequence , 1995 .

[62]  R. D. van der Mei,et al.  Delay in polling systems with large switch-over times , 1999 .

[63]  Wei-Min Lan Dynamic scheduling of multi -product systems with setups: Bounds and heuristics. , 2000 .

[64]  M. V. Oyen,et al.  General dynamic programming algorithms applied to polling systems , 1998 .

[65]  Edward G. Coffman,et al.  Polling Systems in Heavy Traffic: A Bessel Process Limit , 1998, Math. Oper. Res..

[66]  Diwakar Gupta,et al.  Control of a Single-Server Tandem Queueing System with Setups , 1998, Oper. Res..

[67]  Izak Duenyas,et al.  Stochastic scheduling of parallel queues with set-up costs , 1995, Queueing Syst. Theory Appl..

[68]  Yavuz A. Bozer,et al.  Tandem AGV systems: A partitioning algorithm and performance comparison with conventional AGV systems , 1992 .

[69]  Dimitris Bertsimas,et al.  Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks , 1993 .

[70]  Rein D. Nobel,et al.  Optimal control for an MX/G/1 queue with two service modes , 1999, Eur. J. Oper. Res..

[71]  Peter L. Jackson,et al.  A review of the stochastic lot scheduling problem 1 This paper is based upon work supported in part , 1999 .

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

[73]  Hanoch Levy Binomial-gated service: a method for effective operation and optimization of polling systems , 1991, IEEE Trans. Commun..

[74]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[75]  Robert D. van der Mei,et al.  Polling systems with periodic server routing in heavy traffic: renewal arrivals , 2005, Oper. Res. Lett..

[76]  David Gamarnik,et al.  From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective , 2003, Oper. Res..

[77]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[78]  D. Teneketzis,et al.  Optimality of index policies for stochastic scheduling with switching penalties , 1992, Journal of Applied Probability.

[79]  Sridhar R. Tayur,et al.  Improving Operations and Quoting Accurate Lead Times in a Laminate Plant , 2000, Interfaces.