IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v3y2012i2p22-42.html
   My bibliography  Save this article

Harmony Search with Greedy Shuffle for Nurse Rostering

Author

Listed:
  • Mohammed A. Awadallah

    (Universiti Sains Malaysia, Malaysia)

  • Ahamad Tajudin Khader

    (Universiti Sains Malaysia, Malaysia)

  • Mohammed Azmi Al-Betar

    (Universiti Sains Malaysia, Malaysia, & Jadara University, Jordan)

  • Asaju La’aro Bolaji

    (Universiti Sains Malaysia, Malaysia)

Abstract

In this paper, a hybridization of Harmony Search Algorithm (HSA) with a greedy shuffle move is proposed for Nurse Rostering Problem (NRP). NRP is a combinatorial optimization problem that is tackled by assigning a set of nurses with different skills and contracts to different types of shifts, over a pre-determined scheduling period. HSA is a population-based method which mimics the improvisation process that has been successfully applied for a wide range of optimization problems. The performance of HSA is enhanced by hybridizing it with a greedy shuffle move. The proposed method is evaluated using a dataset defined in first International Nurse Rostering Competition (INRC2010). The hybrid HSA obtained the best results of the comparative methods in four datasets.

Suggested Citation

  • Mohammed A. Awadallah & Ahamad Tajudin Khader & Mohammed Azmi Al-Betar & Asaju La’aro Bolaji, 2012. "Harmony Search with Greedy Shuffle for Nurse Rostering," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 3(2), pages 22-42, April.
    • Handle: RePEc:igg:jncr00:v:3:y:2012:i:2:p:22-42
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2012040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:3:y:2012:i:2:p:22-42. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.