Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling

  • Stephen Remde
  • Peter Cowling
  • Keshav Dahal
  • Nic Colledge
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)


In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive search. These smaller parts comprise a combination of choosing a method to select a task to be scheduled and a method to allocate resources, including time, to the selected task. We use reduced Variable Neighbourhood Search (rVNS) and hyperheuristic approaches to decide which sub problems to tackle. The resulting methods are compared to local search and Genetic Algorithm approaches. Parallelisation is used to perform nearly one CPU-year of experiments. The results show that the new methods can produce results fitter than the Genetic Algorithm in less time and that they are far superior to any of their component techniques. The method used to split up the problem is generalisable and could be applied to a wide range of optimisation problems.


Genetic Algorithm Schedule Problem Local Search Variable Neighbourhood Variable Neighbourhood Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hartmann, S.: Project Scheduling under Limited Resources: Model, methods and applications. Springer, Heidelberg (1999)Google Scholar
  2. 2.
    Pinedo, M., Chao, X.: Operations scheduling with applications in manufacturing and services. McGraw-Hill, New York (1999)zbMATHGoogle Scholar
  3. 3.
    Cowling, P., Colledge, N., Dahal, K., Remde, S.: The Trade Off between Diversity and Quality for Multi-objective Workforce Scheduling. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 13–24. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Oper. Res. 90(2), 320–333 (1996)zbMATHCrossRefGoogle Scholar
  5. 5.
    Alcraz, J., Marotom, R., Ruiz, R.: Solving the Multi-mode Resource-Constrained Project Scheduling Problems with genetic algorithms. Journal of Operational Research Society 54, 614–626 (2004)Google Scholar
  6. 6.
    Kolisch, R., Hartmann, S.: Experimental Investigations of Heuristics for RCPSP: An Update. European Journal of Oper. Res. 174(1), 23–37 (2006)zbMATHCrossRefGoogle Scholar
  7. 7.
    Bremermann, H.: The evolution of Intelligence. The Nervous System as a Model of it’s environment. Technical Report No 1, contract No 477(17), Dept. of Math. Univ. of Washington, Seattle (1958)Google Scholar
  8. 8.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  9. 9.
    Whitley, D., Starkweather, T., Shaner, D.: The travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
  10. 10.
    Falkenauer, E.: A Hybrid Grouping Genetic Algorithm for Bin Packing. Journal of Heuristics 2(1), 5–30 (1996)CrossRefGoogle Scholar
  11. 11.
    Ross, P., Hart, E., Corne, D.: Some observations about GA-based exam timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 115–129. Springer, Berlin Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operational Research 24(11), 1097–1100 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Oper. Res. 130(3), 449–467 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Fleszar, K., Hindi, K.S.: Solving the resource-constrained project problem by a variable neighbourhood scheduling search. European Journal of Oper. Res. 155(2), 402–413 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Garcia, C.G., Perez-Brito, D., Campos, V., Marti, R.: Variable neighborhood search for the linear ordering problem. Comp. & Oper. Research 33(12), 3549–3565 (2006)zbMATHCrossRefGoogle Scholar
  16. 16.
    Sevkli, M., Aydin, M.E.: A variable neighbourhood search algorithm for job shop scheduling problems. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 261–271. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176–190. Springer, Heidelberg (2001)Google Scholar
  18. 18.
    Fang, H., Ross, P., Corne, D.: A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems. In: 11th European Conference on Artificial Intelligence (1994)Google Scholar
  19. 19.
    Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)CrossRefGoogle Scholar
  20. 20.
    Bai, R., Kendall, G.: An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-heuristics. In: Proc. of The Fifth Metaheuristics Int. Conf. (2003)Google Scholar
  21. 21.
    Kendal, G., Han, L., Cowling, P.: An Investigation of a Hyperheuristic Genetic Algorithm Applied to a Trainer Scheduling Problem, pp. 1185–1190. IEEE Press, Orlando (2002)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Stephen Remde
    • 1
  • Peter Cowling
    • 1
  • Keshav Dahal
    • 1
  • Nic Colledge
    • 1
  1. 1.MOSAIC Research Group, University of Bradford, Great Horton Road, Bradford, BD7 1DPUnited Kingdom

Personalised recommendations