Ant colony optimization algorithm for workforce planning

The workforce planning helps organizations to optimize the production process with aim to minimize the assigning costs. A workforce planning problem is very complex and needs special algorithms to be solved. The problem is to select set of employers from a set of available workers and to assign this staff to the jobs to be performed. Each job requires a time to be completed. For efficiency, a worker must performs a minimum number of hours of any assigned job. There is a maximum number of jobs that can be assigned and a maximum number of workers that can be assigned. There is a set of jobs that shows the jobs on which the worker is qualified. The objective is to minimize the costs associated to the human resources needed to fulfill the work requirements. On this work we propose a variant of Ant Colony Optimization (ACO) algorithm to solve workforce optimization problem. The algorithm is tested on a set of 20 test problems. Achieved solutions are compared with other methods, as scatter search and genetic algorithm. Obtained results show that ACO algorithm performs better than other two algorithms.

[1]  Katarzyna Grzybowska,et al.  Sustainable supply chain - Supporting tools , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[2]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[3]  Mohammed Othman,et al.  Integrating workers' differences into workforce planning , 2012, Comput. Ind. Eng..

[4]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[5]  Colin N. Jones,et al.  A two-stage stochastic programming approach to employee scheduling in retail outlets with uncertain demand , 2015 .

[6]  Hongxun Jiang,et al.  A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem☆ , 2015 .

[7]  Enrique Alba,et al.  Parallel Metaheuristics for Workforce Planning , 2007, J. Math. Model. Algorithms.

[8]  G. M. Campbell,et al.  A two-stage stochastic program for scheduling and allocating cross-trained workers , 2011, J. Oper. Res. Soc..

[9]  Mitsuo Gen,et al.  A new model for single machine scheduling with uncertain processing time , 2017, J. Intell. Manuf..

[10]  Scott E. Grasman,et al.  Integer programming techniques for solving non-linear workforce planning models with learning , 2015, Eur. J. Oper. Res..

[11]  Wansheng Tang,et al.  An uncertain search model for recruitment problem with enterprise performance , 2017, J. Intell. Manuf..

[12]  Frederick Easton,et al.  Service Completion Estimates for Cross‐trained Workforce Schedules under Uncertain Attendance and Demand , 2014 .

[13]  Gang Liu,et al.  An uncertain goal programming model for machine scheduling problem , 2017, J. Intell. Manuf..

[14]  Wansheng Tang,et al.  An uncertain workforce planning problem with job satisfaction , 2017, Int. J. Mach. Learn. Cybern..

[15]  Aziz Moukrim,et al.  A Memetic Algorithm for staff scheduling problem in airport security service , 2013, Expert Syst. Appl..

[16]  Limei Yan,et al.  Uncertain aggregate production planning , 2012, Soft Computing.

[17]  Olympia Roeva,et al.  InterCriteria Analysis of ACO start startegies , 2016, 2016 Federated Conference on Computer Science and Information Systems (FedCSIS).