A successive convex approximation method for multistage workforce capacity planning problem with turnover
From MaRDI portal
Publication:2469579
DOI10.1016/j.ejor.2007.04.018zbMath1135.90009OpenAlexW2030464168MaRDI QIDQ2469579
Haiqing Song, Huei-Chuen Huang
Publication date: 6 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.018
Related Items (12)
An arc-exchange decomposition method for multistage dynamic networks with random arc capacities ⋮ Workforce planning incorporating skills: state of the art ⋮ Strategic Workforce Planning Under Uncertainty ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ Determining personnel promotion policies in HEI ⋮ Toward an integrated workforce planning framework using structured equations ⋮ Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic ⋮ The informational value of employee online reviews ⋮ A three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenance ⋮ Balancing desirability and promotion steadiness in partially stochastic manpower planning systems ⋮ SimMan -- A simulation model for workforce capacity planning ⋮ The roster quality staffing problem -- a methodology for improving the roster quality by modifying the personnel structure
Cites Work
- Unnamed Item
- Staffing decisions for heterogeneous workers with turnover
- Restricted recourse strategies for bounding the expected network recourse function
- Linear Programming under Uncertainty
- The Nonstationary Staff-Planning Problem with Business Cycle and Learning Effects
- An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
- A Stochastic Convergence Model for Portfolio Selection
- Managing Learning and Turnover in Employee Staffing
- A piecewise linear upper bound on the network recourse function
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Stochastic Programming Applied to Human Resource Planning
- A Noniterative Algorithm for the Multiproduct Production and Work Force Planning Problem
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Introduction to Stochastic Programming
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- LP Modeling for Asset-Liability Management: A Survey of Choices and Simplifications
This page was built for publication: A successive convex approximation method for multistage workforce capacity planning problem with turnover
