Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access

    ARTICLE

    Annealing Harmony Search Algorithm to Solve the Nurse Rostering Problem

    Mohammed Hadwan1,2,3,*

    CMC-Computers, Materials & Continua, Vol.71, No.3, pp. 5545-5559, 2022, DOI:10.32604/cmc.2022.024512

    Abstract A real-life problem is the rostering of nurses at hospitals. It is a famous nondeterministic, polynomial time (NP) -hard combinatorial optimization problem. Handling the real-world nurse rostering problem (NRP) constraints in distributing workload equally between available nurses is still a difficult task to achieve. The international shortage of nurses, in addition to the spread of COVID-19, has made it more difficult to provide convenient rosters for nurses. Based on the literature, heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity, especially for large rosters. Heuristic-based algorithms in general have problems striking the… More >

Displaying 1-10 on page 1 of 1. Per Page