IEEJ Transactions on Electronics, Information and Systems
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
Application of Genetic Algorithm to the Manpower Scheduling Problem
Bertrand Simon HuppeIwao Okutani
Author information
JOURNAL FREE ACCESS

1994 Volume 114 Issue 4 Pages 450-455

Details
Abstract
The purpose of this study is to construct a new algorithm using Genetic Algorithm (GA) which can assist decision makers concerned with resource allocation and manpower scheduling problems.
There are many methods for solving a variety of manpower scheduling problems. Depending upon the requirements involved in a problem, they can be classified into two basic types; one deals with the minimization of the project duration time with a constraint on the total availability of certain key resources, while the other deals with the minimization of the peak of used resources or “leveling” resource demand with a constraint on the total project duration time. In practice, the requirements are becoming so complicated and marginal that it is sometimes practically impossible to solve the problem by traditional methods. In this paper, we developed a systematic scheduling procedure by use of GA, which is very general in that the procedure can take multiple constrains as well as various forms of goal into account. It is demonstrated in the model testings that the proposed procedure can improve the disadvantages of the existing methods compared.
Content from these authors
© The Institute of Electrical Engineers of Japan
Previous article Next article
feedback
Top