A Swift Heuristic Method for Work Order Scheduling under the Skilled-Workforce Constraint

The considered problem is how to optimally allocate a set of jobs to technicians of different skills such that the number of technicians of each skill does not exceed the number of persons with that skill designation. The key motivation is the quick sensitivity analysis in terms of the workforce size which is quite necessary in many industries in the presence of unexpected work orders. A time-indexed mathematical model is proposed to minimize the total weighted completion time of the jobs. The proposed model is decomposed into a number of single-skill sub-problems so that each one is a combination of a series of nested binary Knapsack problems. A heuristic procedure is proposed to solve the problem. Our experimental results, based on a real-world case study, reveal that the proposed method quickly produces a schedule statistically close to the optimal one while the classical optimal procedure is very time-consuming.

[1]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[2]  Dragan Banjevic,et al.  Multi-threaded simulated annealing for a bi-objective maintenance scheduling problem , 2012 .

[3]  H. Martin Weingartner,et al.  Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.

[4]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[5]  Martin W. P. Savelsbergh,et al.  Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation , 2010, Transp. Sci..

[6]  Arjen K. Lenstra,et al.  Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables , 2000, Math. Oper. Res..

[7]  Charles H. Reilly,et al.  The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance , 2000 .

[8]  Erik Demeulemeester,et al.  A Two-Stage Mixed Integer Programming Approach for Optimizing the Skill Mix and Training Schedules for Aircraft Maintenance , 2015 .

[9]  K. Aardal.  Solving a System of Diophantine Equations with Lower and Upper Bounds on the Variables , 1998 .

[10]  Rainer Kolisch,et al.  Scheduling and staffing multiple projects with a multi-skilled workforce , 2010, OR Spectr..

[11]  Arno Sprecher,et al.  An exact algorithm for project scheduling with multiple modes , 1997 .

[12]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Peter Brucker,et al.  Complex Scheduling , 2006 .

[15]  N. Safaei,et al.  Workforce Planning for Power Restoration: An Integrated Simulation-Optimization Approach , 2012, IEEE Transactions on Power Systems.

[16]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[17]  Nima Safaei,et al.  Bi-objective workforce-constrained maintenance scheduling: a case study , 2011, J. Oper. Res. Soc..

[18]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[19]  Nima Safaei,et al.  Workforce-constrained maintenance scheduling for military aircraft fleet: a case study , 2011, Ann. Oper. Res..

[20]  Sönke Hartmann,et al.  Packing problems and project scheduling models: an integrating perspective , 2000, J. Oper. Res. Soc..

[21]  Arjen K. Lenstra,et al.  Hard Equality Constrained Integer Knapsacks , 2002, Math. Oper. Res..

[22]  Erik Demeulemeester,et al.  Workforce Planning Incorporating Skills: State of the Art , 2014, Eur. J. Oper. Res..

[23]  Milind Dawande,et al.  Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[24]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..