An Algorithm for an Optimal Staffing Problem in Open Shop Environment

The paper addresses a problem of optimal staffing in open shop environment. The problem is to determine the optimal number of operators serving a given number of machines to fulfill the number of independent operations while minimizing staff idle. Using a Gantt chart presentation of the problem it is modeled as two- dimensional cutting stock problem. A mixed-integer programming model is used to get minimal job processing time (makespan) for fixed number of machines' operators. An algorithm for optimal open- shop staffing is developed based on iterative solving of the formulated optimization task. The execution of the developed algorithm provides optimal number of machines' operators in the sense of minimum staff idle and optimal makespan for that number of operators. The proposed algorithm is tested numerically for a real life staffing problem. The testing results show the practical applicability for similar open shop staffing problems.

[1]  Günther R. Raidl,et al.  Models and algorithms for three-stage two-dimensional bin packing , 2007, Eur. J. Oper. Res..

[2]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[3]  François Vanderbeck,et al.  A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..

[4]  Edieal J. Pinker,et al.  Capacity Estimation and Optimal Staffing for an email Contact Center , 2008 .

[5]  Hiroshi Nagamochi,et al.  Practical Algorithms for Two-Dimensional Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[6]  Soemon Takakuwa,et al.  Optimization and analysis of staffing problems at a retail store , 2010, Proceedings of the 2010 Winter Simulation Conference.

[7]  Lixin Tang,et al.  Open shop scheduling problem to minimize makespan with release dates , 2013 .

[8]  Hiroshi Nagamochi,et al.  for Two-dimensional Packing , 2006 .

[9]  André Langevin,et al.  An Optimal Constraint Programming Approach to the Open-Shop Problem , 2012, INFORMS J. Comput..

[10]  K. Ambrose,et al.  Principles of management. , 2005, Emergency nurse : the journal of the RCN Accident and Emergency Nursing Association.

[11]  Ivo Blöchliger,et al.  Modeling staff scheduling problems. A tutorial , 2004, Eur. J. Oper. Res..

[12]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[13]  M. Hifi,et al.  A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapes , 2003 .