Name
Abstract | ||
|---|---|---|
In this paper, we investigate a manpower planning problem with single job type over a long planning horizon. Dynamic demands of jobs must be fulfilled by allocating enough number of regular and temporal workers and each regular worker has a minimal employment contract period. A cost objective is concerned where costs for workforce include salaries of regular and temporal workers, and recruitment and dismissal costs of regular workers. We first formulate the problem as a multi-period decision model. Then we derive several properties of the optimal solution and develop an improved dynamic programming algorithm with polynomial computational complexity. Finally, numerical results are presented to illustrate several managerial insights. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11496199_38 | AAIM |
Keywords | Field | DocType |
managerial insight,regular worker,improved dynamic programming algorithm,temporal worker,enough number,cost objective,optimal manpower planning,manpower planning problem,temporal labor,contract period constraint,long planning horizon,dismissal cost,dynamic demand,computational complexity,decision models,dynamic programming algorithm | Dynamic programming,Algorithmics,Time horizon,Computer science,Workforce,Dismissal,Operations research,Decision model,Employment contract,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
3521 | 0302-9743 | 3-540-26224-5 |
Citations | PageRank | References |
1 | 0.41 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongjian Li | 1 | 256 | 22.28 |
| Jian Chen | 2 | 1726 | 103.59 |
| Xiaoqiang Cai | 3 | 530 | 31.22 |
| Fengsheng Tu | 4 | 17 | 3.00 |