Abstract
Abstract Optimization of workforce planning is important for any production area. This leads to an improvement in production process. The aim is minimization of the assignment costs of the workers, who will do the jobs. The problem is to select and assign employers to the jobs to be performed. The constraints are very strong, coming both from the specifics of the production process and from the legislation. Sometimes it is difficult to find feasible solutions. The complexity of the problem is very high and the needed number of calculations is exponential, therefore only specially developed algorithms can be applied. The objective is to minimize the assignment cost, while respecting all requirements. We propose a new hybrid metaheuristic algorithm to solve the workforce-planning problem, which is a combination between Ant Colony Optimization (ACO) and suitable local search procedure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
