Statistical methods for automated generation of service engagement staffing plans

In order to successfully deliver a labor-based professional service, the right people with the right skills must be available to deliver the service when it is needed. Meeting this objective requires a systematic, repeatable approach for determining the staffing requirements that enable informed staffing management decisions. We present a methodology developed for the Global Business Services (GBS) organization of IBM to enable automated generation of staffing plans involving specific job roles, skill sets, and employee experience levels. The staffing plan generation is based on key characteristics of the expected project as well as selection of a project type from a project taxonomy that maps to staffing requirements. The taxonomy is developed using statistical clustering techniques applied to labor records from a large number of historical GBS projects. We describe the steps necessary to process the labor records so that they are in a form suitable for analysis, as well as the clustering methods used for analysis, and the algorithm developed to dynamically generate a staffing plan based on a selected group. We also present results of applying the clustering and staffing plan generation methodologies to a variety of GBS projects.

[1]  D. Aranda.  Service operations strategy, flexibility and performance in engineering consulting firms , 2003 .

[2]  Paul S. Bradley,et al.  Refining Initial Points for K-Means Clustering , 1998, ICML.

[3]  Vipin Kumar,et al.  Multilevel Refinement for Hierarchical Clustering , 1999 .

[4]  Paul Coombs.  IT Project Estimation: A Practical Guide to the Costing of Software , 2003 .

[5]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[6]  Yi Pan,et al.  Novel hybrid hierarchical-K-means clustering method (H-K-means) for microarray analysis , 2005, 2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05).

[7]  Donald E. Brown,et al.  A practical application of simulated annealing to clustering , 1990, Pattern Recognit..

[8]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[9]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[11]  Rudolf Melik,et al.  Professional Services Automation (PSA): Optimizing Project and Service Oriented Organizations , 2002 .

[12]  R. Clarke,et al.  Theory and Applications of Correspondence Analysis , 1985 .

[13]  Adrian E. Raftery,et al.  How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..

[14]  Ashish Nanda,et al.  Professional Services: Text and Cases , 2002 .

[15]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[16]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[17]  Andrew W. Moore,et al.  X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.