Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

255
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

138
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

MAXIMIZING THE NURSES’ PREFERENCES IN NURSE SCHEDULING PROBLEM: MATHEMATICAL MODELING AND A META-HEURISTIC ALGORITHM

Pages

  439-458

Abstract

 The NURSE SCHEDULING PROBLEM (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important factors such as hospital’s policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a MATHEMATICAL PROGRAMMING model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel NEIGHBORHOOD STRUCTUREs are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49% compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.

Cites

  • No record.

    • References

    Cite

    APA: Copy

    JAFARI, HAMED, & SALMASI, NASSER. (2015). MAXIMIZING THE NURSES’ PREFERENCES IN NURSE SCHEDULING PROBLEM: MATHEMATICAL MODELING AND A META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 11(3), 439-458. SID. https://sid.ir/paper/310014/en

    Vancouver: Copy

    JAFARI HAMED, SALMASI NASSER. MAXIMIZING THE NURSES’ PREFERENCES IN NURSE SCHEDULING PROBLEM: MATHEMATICAL MODELING AND A META-HEURISTIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2015;11(3):439-458. Available from: https://sid.ir/paper/310014/en

    IEEE: Copy

    HAMED JAFARI, and NASSER SALMASI, “MAXIMIZING THE NURSES’ PREFERENCES IN NURSE SCHEDULING PROBLEM: MATHEMATICAL MODELING AND A META-HEURISTIC ALGORITHM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 11, no. 3, pp. 439–458, 2015, [Online]. Available: https://sid.ir/paper/310014/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top