Abstract
Decision making associated with workforce planning results in difficult optimization problems, this is so it involves multiple levels of complexity. In fact, the workforce planning problem that we tackle in this chapter consists of two sets of decisions: selection and assignment. The first step selects a small set of employees from a large number of available workers and the second (decision) assigns this staff to the tasks to be performed. The objective is to minimize the costs associated to the human resources needed to fulfill the work requirements. An effective workforce plan is an essential tool to identify appropriate workload staffing levels and justify budget allocations so that organizations can meet their objectives.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Luque, G., Alba, E. (2011). Parallel Genetic Algorithm for the Workforce Planning Problem. In: Parallel Genetic Algorithms. Studies in Computational Intelligence, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22084-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22084-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22083-8
Online ISBN: 978-3-642-22084-5
eBook Packages: EngineeringEngineering (R0)