Dynamic load balancing with flexible workers

We study the problem of dynamically allocating flexible workers to stations in tandem or serial manufacturing systems. Workers are trained to do a subset of consecutive tasks. We show that the optimal policy is often LBFS (last buffer first-served) or FBFS (first buffer first-served). These results generalize earlier results on the optimality of the pick-and-run, expedite, and bucket brigade-type policies. We also show that, for exponential processing times and general manufacturing networks, the optimal policy will tend to have several workers assigned to the same station.

[1]  Wallace J. Hopp,et al.  Factors affecting opportunity of worksharing as a dynamic line balancing mechanism , 2002 .

[2]  Ronald G. Askin,et al.  Dynamic task assignment for throughput maximization with worksharing , 2006, Eur. J. Oper. Res..

[3]  Sigrún Andradóttir,et al.  Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems , 2001, Manag. Sci..

[4]  Avishai Mandelbaum,et al.  On Pooling in Queueing Networks , 1998 .

[5]  Wallace J. Hopp,et al.  Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers , 2004, Manag. Sci..

[6]  Dimitrios G. Pandelis.  Optimal use of excess capacity in two interconnected queues , 2007, Math. Methods Oper. Res..

[7]  Rhonda Righter,et al.  Multi-actor Markov decision processes , 2005 .

[8]  Ronald G. Askin,et al.  Throughput maximization in serial production lines with worksharing , 2006 .

[9]  John O. McClain,et al.  “On-the-fly” line balancing with very little WIP , 1992 .

[10]  Seyed M. R. Iravani,et al.  Optimal dynamic assignment of a flexible worker on an open production line with specialists , 2006, Eur. J. Oper. Res..

[11]  T. M. Farrar.  Optimal use of an extra server in a two station tandem queueing network , 1993 .

[12]  Izak Duenyas,et al.  Optimal stochastic scheduling of a two-stage tandem queue with parallel servers , 1999, Advances in Applied Probability.

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

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

[15]  Mark E. Lewis,et al.  OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS , 2002 .

[16]  Dimitrios G. Pandelis.  OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS , 2007, Probability in the Engineering and Informational Sciences.

[17]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

[18]  Ta R A Ja.  EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES , 2001 .

[19]  WINFRIED K. GRASSMANN,et al.  A Tandem Queuewith a Movable Server: An Eigenvalue Approach , 2002, SIAM J. Matrix Anal. Appl..

[20]  Ger Koole,et al.  Optimal control of tandem reentrant queues , 1998, Queueing Syst. Theory Appl..

[21]  Sigrún Andradóttir,et al.  Dynamic Server Allocation for Queueing Networks with Flexible Servers , 2003, Oper. Res..

[22]  Wallace J. Hopp,et al.  Performance Opportunity for Workforce Agility in Collaborative and Noncollaborative Work Systems , 2001 .

[23]  Donald D. Eisenstein,et al.  A Production Line that Balances Itself , 1996, Oper. Res..

[24]  Donald D. Eisenstein,et al.  Performance of Bucket Brigades When Work Is Stochastic , 2001, Oper. Res..

[25]  Diane P. Bischak.  Performance of a manufacturing module with moving workers , 1996 .

[26]  Demosthenis Teneketzis,et al.  Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues , 1994, Advances in Applied Probability.