SearcharxivSearch

arXiv · 1708.01983

Developing Talent from a Supply-Demand Perspective: An Optimization Model for Managers

Abstract

While executives emphasize that human resources (HR) are a firm's biggest asset, the level of research attention devoted to planning talent pipelines for complex global organizational environments does not reflect this emphasis. Numerous challenges exist in establishing human resource management strategies aligned with strategic operations planning and growth strategies. We generalize the problem of managing talent from a supply-demand standpoint through a resource acquisition lens, to an industrial business case where an organization recruits for multiple roles given a limited pool of potential candidates acquired through a limited number of recruiting channels. In this context, we develop an innovative analytical model in a stochastic environment to assist managers with talent planning in their organizations. We apply supply chain concepts to the problem, whereby individuals with specific competencies are treated as unique products. We first develop a multi-period mixed integer nonlinear programming model and then exploit chance-constrained programming to a linearized instance of the model to handle stochastic parameters, which follow any arbitrary distribution functions. Next, we use an empirical study to validate the model with a large global manufacturing company, and demonstrate how the proposed model can effectively manage talents in a practical context. A stochastic analysis on the implemented case study reveals that a reasonable improvement is derived from incorporating randomness into the problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hadi Moheb-Alizadeh, Robert B. Handfield. 2017-08-07. Developing Talent from a Supply-Demand Perspective: An Optimization Model for Managers. https://doi.org/10.3390/logistics1010005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC