This paper presents a genetic algorithmic approach to the solution of the problem of personnel timetabling in laboratories in which the objective is to assign tasks to employees and nurse scheduling in medical centre where the objectives are to assign staff to particular day in planning period and minimization of personnel cost by avoiding overtime pay. The personnel scheduling and timetabling problems are multi-constrained and having huge search space which makes them NP hard. Genetic algorithmic approach is applied to both the problems. Canonical genetic algorithm demonstrates very slow convergence to optimal solution. Hence, in laboratory personnel timetabling problem a knowledge augmented operator is introduced in genetic algorithm framework. This hybridization helps to get the near-optimal solution quickly. For nurse scheduling problem, proposed hybrid genetic algorithms with partial feasible chromosome representation, initialization and operators have shown fast convergence towards optimal solution with comparatively small population size. The probability of getting near optimal solution using proposed hybrid genetic algorithm in less than 20 seconds (the average time) is more than 0.6. Timetabling and scheduling problems under consideration are quite different from each other. Hence choice of genetic operators and parameters for both the problems are different. Finding a general framework for timetabling and scheduling problems is still a challenge.

1. Causmaecker, P.D., Demeester, P., Berghe, G.V., and Verbeke, B. 2004. Analysis of Real-world Personnel Scheduling Problems. 2004. In Proc. of 5th Practice and Theory of Automated Timetabling.
2. Ernst, A. T., Jiang, H., Krishnamoorthy, M., and Sier, D. 2004. Staff Scheduling and Rostering: A review applications, methods and models. European Journal of Operational Research. 153, 3-27.
3. Burke, E.K., Cowling, P., Causmaecker, P.D., and Berghe, G.V. 2001. A Memetic Approach to the Nurse Rostering Problem. J. Applied Intelligence. 15, 199-214.
4. Aickelin, U., and White, P. 2004. Building Better Nurse Scheduling Algorithms. J. Annals of Operations Research. 128, 159-177.
5. Burke, E.K., Curtois, T., Post, G., Qu, R., and Veltman, B. 2005. A Hybrid Heuristic Ordering and Variable Neighbourhood Search for the Nurse Rostering Problem. Technical Report. Nottingham University.
6. Ozcan, E. 2005. Memetic Algorithms for Nurse Rostering. In Proc. of 20th International Symposium on Computer and Information Sciences, 482-492.
7. Maenhout, B., and Vanhoucke, M. 2006. A Comparison and Hybridization of Crossover Operators for the Nurse Scheduling Problem. Working Papers of Faculty of Economics and Business Administration, Ghent University.
8. White, C.A., and White, G.M. 2002. Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization. In Proc. of 4th Practice and Theory of Automated Timetabling, 120-128.
9. Franses, P., and Post, G. 2002. Personnel Scheduling in Laboratories. In Proc. of 4th Practice and Theory of Automated Timetabling, 113-119.
10. Adamuthe, A. C., and Bichkar, R. S. 2011. Genetic algorithmic approach for personnel timetabling. In Proc. of International Conference on Technology Systems and Management 2011, 69-76, Springer- Verlag.
11. Schmidt, M. 1999. Solving Real-Life Time-Tabling Problems. In Proc. of 11th International Symposium ISMIS '99, 648-656.
12. Wren, A. 1996. Scheduling, Timetabling and Rostering - A Special Relationship? In Proc. of 1st Practice and Theory of Automated Timetabling, 46-75.
13. Li, J., and Kwan, R.S.K. 2003. A Fuzzy Genetic Algorithm for Driver Scheduling. J. European Journal of Operational Research. 147, 334-344.
14. Li J., Kwan, R.S.K. 2005. A Self-Adjusting Algorithm for Driver Scheduling. J. Journal of Heuristics. 11, 351-367 .
15. Miyashita, T. 2003. An Application of Immune Algorithms for Job-Shop Scheduling Problems. In Proc. of the 5th IEEE International Symposium on Assembly and Task Planning.
16. Jensen, M.T. 2003. Generating Robust and Flexible Job Shop Schedules Using Genetic Algorithms. J. IEEE Transactions on Evolutionary Computation. 7, 275-288.
17. Ombuki B.M., and Ventresca, M. 2004. Local Search Genetic Algorithms for the Job Shop Scheduling Problem. J. Applied Intelligence. 21, 99-109.
18. Wilke, P., Grobner, M., and Oster, N. 2002. A Hybrid Genetic Algorithm for School Timetabling.
19. Karova, M. 2004. Solving Timetabling Problems Using Genetic Algorithms. Proc. of 27th Int’l Spring Seminar on Electronic Technology.
20. Qu R., and Burke, E.K. 2005. Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems. In Proc. of 6th Metaheuristics International Conference.
21. Adamuthe, A. C., and Bichkar, R., S. 2011. Minimizing Job completion time in grid scheduling with resource and timing constraints. In Proc. of International Conference and Workshop on Emerging Trends in Technology 2011, 338-343.
22. Dean, J. 2008. Staff Scheduling by a Genetic Algorithm with a Two-Dimensional Chromosome Structure. In Proc. of Practice and Theory of Automated Timetabling 2008.
23. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, Mass. Addison-Wesley.
24. Wall, M. 1996. GAlib: A C++ Library of Genetic Algorithm Components. Massachusetts Institute of Technology.

Personnel Scheduling Nurse Scheduling Scheduling Timetabling Genetic Algorithm Hybrid Genetic Algorithms