Scheduling Leave with Genetic Algorithm

Yu-Er Chien ； June-Horng Shiesh

《電子工程科技國際期刊》 2期 (2014/01) Pp. 9-12

https://doi.org/10.6331/IJPE.1(2).03

並列摘要

In this paper a genetic algorithm (GA) is employed to scheduling leave. The problem is concerned with the allocation of leave to employees in a public institution. Employers are asked to select from a list of possible leave time in advance and point out their preferences in an employee-leave time table. A scoring system where a one indicates a first choice, two a second and so on up until an allowed maximum number of preferences is employed. Using GA proposed by this paper, solutions with minimum values of fitness function which stand for a maximum satisfaction of employees on leave scheduling can be obtained. Experiments from this study also show that the proposed GA approach can obtain feasible solutions quickly and can help the institution make decisions efficiently.

並列關鍵字

Leave scheduling ； genetic algorithm ； optimization ； GA

參考文獻

P.R. Harper, V. de Senna, I.T. Vieira, and A.K. Shahani, A genetic algorithm for the project assignment problem, Computers and Operations Research, Vol. 32, No.5, pp.1255-1265, 2005.

D. Catrysse and L.N. Van Wassenhove, A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, Vol. 60, pp. 260-272, 1992.

J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan, 1975.

M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, 1996.

M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, Wiley, New York, 1996.