An optimal control approach to manpower planning problem

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/6577

Title:	An optimal control approach to manpower planning problem
Authors:	Lee, HWJ Cai, XQ Teo, KL
Issue Date:	2001
Source:	Mathematical problems in engineering, 2001, v. 7, no. 2, p.155-175
Abstract:	A manpower planning problem is studied in this paper. The model includes scheduling different types of workers over different tasks, employing and terminating different types of workers, and assigning different types of workers to various trainning programmes. The aim is to find an optimal way to do all these while keeping the time-varying demand for minimum number of workers working on each different tasks satisfied. The problem is posed as an optimal discrete-valued control problem in discrete time. A novel numerical scheme is proposed to solve the problem, and an illustrative example is provided.
Keywords:	Optimal control Manpower planning CPET DMISER
Publisher:	Hindawi Publishing Corporation
Journal:	Mathematical problems in engineering
ISSN:	1024-123X
EISSN:	1563-5147
DOI:	10.1155/S1024123X01001594
Rights:	Copyright © 2001 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Appears in Collections:	Journal/Magazine Article

File	Description	Size	Format
Lee_Manpower_Planning_Problem.pdf		1.04 MB	Adobe PDF	View/Open

Status	open access
File Version	Version of Record

View full-text via PolyU eLinks

79

Last Week
3

Last month

Citations as of May 28, 2023

92

Citations as of May 28, 2023

13

Last Week
0

Last month
0

Citations as of May 25, 2023

11

Last Week
0

Last month
0

Citations as of May 25, 2023

Check