1. [1] A.A. El Adoly, M. Gheith, and M.N. Fors: A new formulation and solution for the nurse scheduling problem: A case study in Egypt. Alexandria Engineering Journal, 57 (2018), 2289–2298.
2. [2] H. Akita and A. Ikegami: A network representation of feasible solution space for a subproblem of nurse scheduling. Proceedings of the Institute of Statistical Mathematics, 61 (2013), 79–95.
3. [3] P. Brucker, E.K. Burke, T. Curtois, R. Qu, and G.V. Berghe: A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics, 16 (2010), 559–573.
4. [4] G. Baskaran, A. Bargiela, and R. Qu: Using branch and bound to solve the nurse scheduling problem. Proceedings of 2014 International Conference on Artificial Intelligence & Manufacturing Engineering, IIE ICAIME2014, 2014, 203–209.
5. [5] E.K. Burke, P. De Causmaecker, G.V. Berghe, and H. Van Landeghem: The state of the art of nurse rostering. Journal of Scheduling, 7 (2004), 441–499.