Personnel Scheduling Problem under Hierarchical Management Based on Intelligent Algorithm

Complexity 2021:1-14 (2021)


This paper studies a special scheduling problem under hierarchical management in nurse staff. This is a more complex rostering problem than traditional nurse scheduling. The first is that the rostering requirements of charge nurses and general nurses are different under hierarchical management. The second is that nurses are preferable for relative fair rather than absolute fair under hierarchical management. The model aims at allocating the required workload to meet the operational requirements, weekend rostering preferences, and relative fairness preferences. Two hybrid heuristic algorithms based on multiobjective grey wolf optimizer and three corresponding single heuristic algorithms are employed to solve this problem. The experimental results based on real cases from the Third People’s Hospital, Panzhihua, China, show that MOGWO does not as good as it does on other engineering optimization. However, the hybrid algorithms based on MOGWO are better than corresponding single algorithms on generational distance and spacing of Pareto solutions. Furthermore, for relative fair rostering objective, NSGAII-MOGWO has more power to find the optimal solution in the dimension of relative fairness.

Download options


    Upload a copy of this work     Papers currently archived: 72,743

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

10 (#907,144)

6 months
1 (#387,390)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Similar books and articles

Energy Management in Microgrids.Pedro P. Vergara, Juan C. López, Juan M. Rey, Luiz C. P. da Silva & Marcos J. Rider - 2019 - In Antonio Carlos Zambroni de Souza & Miguel Castilla (eds.), Microgrids Design and Implementation. Springer Verlag. pp. 195-216.