Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/6577
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematics-
dc.creatorLee, HWJ-
dc.creatorCai, XQ-
dc.creatorTeo, KL-
dc.date.accessioned2014-12-11T08:23:51Z-
dc.date.available2014-12-11T08:23:51Z-
dc.identifier.issn1024-123X-
dc.identifier.urihttp://hdl.handle.net/10397/6577-
dc.language.isoenen_US
dc.publisherHindawi Publishing Corporationen_US
dc.rightsCopyright © 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.en_US
dc.subjectOptimal controlen_US
dc.subjectManpower planningen_US
dc.subjectCPETen_US
dc.subjectDMISERen_US
dc.titleAn optimal control approach to manpower planning problemen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: H. W. J. Leeen_US
dc.description.otherinformationAuthor name used in this publication: K. L. Teoen_US
dc.identifier.spage155-
dc.identifier.epage175-
dc.identifier.volume7-
dc.identifier.issue2-
dc.identifier.doi10.1155/S1024123X01001594-
dcterms.abstractA 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationMathematical problems in engineering, 2001, v. 7, no. 2, p.155-175-
dcterms.isPartOfMathematical problems in engineering-
dcterms.issued2001-
dc.identifier.isiWOS:000169402000004-
dc.identifier.scopus2-s2.0-0346485718-
dc.identifier.eissn1563-5147-
dc.identifier.rosgroupidr00757-
dc.description.ros2000-2001 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Lee_Manpower_Planning_Problem.pdf1.04 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

162
Last Week
3
Last month
Citations as of May 11, 2025

Downloads

289
Citations as of May 11, 2025

SCOPUSTM   
Citations

13
Last Week
0
Last month
0
Citations as of May 8, 2025

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of May 8, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.