IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v27y2017i1p83-101.html
   My bibliography  Save this article

A two-step multi-objective mathematical model for nurse scheduling problem considering nurse preferences and consecutive shifts

Author

Listed:
  • Mohammad Mahdi Nasiri
  • Meysam Rahvar

Abstract

The nurse scheduling problem (NSP) has received special attention during the recent decades. The difficulty of generating tables manually alongside the shortage of nurses and prohibition of outsourcing nurses has led to hectic schedules in which assigning three consecutive shifts (i.e., 24 hour shift) to a nurse could be seen. Furthermore, nurses' preferences are usually neglected because the concentration is on meeting the nursing requirements. In this paper, we propose a multi-objective mathematical model in which we tackle the main inefficiency of the system (i.e., three consecutive shifts). We also try to maximise nurses' preferences. In addition to the presentation of a new mathematical model, we use the novel method of augmented epsilon constraint to generate several tables. To deal with the complexity of NSP, we use a two-step approach. We find the efficient solutions over the Pareto set, among which we select the best table.

Suggested Citation

  • Mohammad Mahdi Nasiri & Meysam Rahvar, 2017. "A two-step multi-objective mathematical model for nurse scheduling problem considering nurse preferences and consecutive shifts," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 27(1), pages 83-101.
    • Handle: RePEc:ids:ijsoma:v:27:y:2017:i:1:p:83-101
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=83338
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohammad Mahdi Nasiri & Farzaneh Shakouhi & Fariborz Jolai, 2019. "A fuzzy robust stochastic mathematical programming approach for multi-objective scheduling of the surgical cases," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 890-910, September.
    2. Zhaohui Li & Haiyue Yu & Zhaowei Zhou, 2024. "Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.

    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:ids:ijsoma:v:27:y:2017:i:1:p:83-101. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    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.