IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v58y2007i12d10.1057_palgrave.jors.2602304.html
   My bibliography  Save this article

Enhancing case-based reasoning for personnel rostering with selected tabu search concepts

Author

Listed:
  • G Beddoe

    (University of Nottingham)

  • S Petrovic

    (University of Nottingham)

Abstract

In this paper, we investigate the advantages of using case-based reasoning (CBR) to solve personnel rostering problems. Constraints for personnel rostering problems are commonly categorized as either ‘hard’ or ‘soft’. Hard constraints are those that must be satisfied and a roster that violates none of these constraints is considered to be ‘feasible’. Soft constraints are more flexible and are often used to measure roster quality in terms of staff satisfaction. We introduce a method for repairing hard constraint violations using CBR. CBR is an artificial intelligence paradigm whereby new problems are solved by considering the solutions to previous similar problems. A history of hard constraint violations and their corresponding repairs, which is captured from human rostering experts, is stored and used to solve similar violations in new rosters. The soft constraints are not defined explicitly. Their treatment is captured implicitly during the repair of hard constraint violations. The knowledge in the case-base is combined with selected tabu search concepts in a hybrid meta-heuristic algorithm. Experiments on real-world data from a UK hospital are presented. The results show that CBR can guide a meta-heuristic algorithm towards feasible solutions with high staff satisfaction, without the need to explicitly define soft constraint objectives.

Suggested Citation

  • G Beddoe & S Petrovic, 2007. "Enhancing case-based reasoning for personnel rostering with selected tabu search concepts," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1586-1598, December.
  • Handle: RePEc:pal:jorsoc:v:58:y:2007:i:12:d:10.1057_palgrave.jors.2602304
    DOI: 10.1057/palgrave.jors.2602304
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602304
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2602304?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. E K Burke & B L MacCarthy & S Petrovic & R Qu, 2006. "Multiple-retrieval case-based reasoning for course timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 148-162, February.
    2. Schmidt, Gunter, 1998. "Case-based reasoning for production scheduling," International Journal of Production Economics, Elsevier, vol. 56(1), pages 537-546, September.
    3. L Cavique & C Rego & I Themido, 1999. "Subgraph ejection chains and tabu search for the crew scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(6), pages 608-616, June.
    4. Dowsland, Kathryn A., 1998. "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 393-407, April.
    5. R Alvarez-Valdes & E Crespo & J M Tamarit, 1999. "Labour scheduling at an airport refuelling installation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(3), pages 211-218, March.
    6. R. N. Burns & M. W. Carter, 1985. "Work Force Size and Single Shift Schedules with Variable Demands," Management Science, INFORMS, vol. 31(5), pages 599-607, May.
    7. Berrada, Ilham & Ferland, Jacques A. & Michelon, Philippe, 1996. "A multi-objective approach to nurse scheduling with both hard and soft constraints," Socio-Economic Planning Sciences, Elsevier, vol. 30(3), pages 183-193, September.
    8. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    9. D. Michael Warner, 1976. "Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach," Operations Research, INFORMS, vol. 24(5), pages 842-856, October.
    10. Holmes E. Miller & William P. Pierskalla & Gustave J. Rath, 1976. "Nurse Scheduling Using Mathematical Programming," Operations Research, INFORMS, vol. 24(5), pages 857-870, October.
    11. Beaumont, Nicholas, 1997. "Scheduling staff using mixed integer programming," European Journal of Operational Research, Elsevier, vol. 98(3), pages 473-484, May.
    12. K A H Kobbacy, 2004. "On the evolution of an intelligent maintenance optimization system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 139-146, February.
    13. K A H Kobbacy & J Jeon, 2001. "The development of a hybrid intelligent maintenance optimisation system (HIMOS)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(7), pages 762-778, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    2. Burke, Edmund K. & Curtois, Tim, 2014. "New approaches to nurse rostering benchmark instances," European Journal of Operational Research, Elsevier, vol. 237(1), pages 71-81.
    3. Edmund K. Burke & Timothy Curtois & Rong Qu & Greet Vanden Berghe, 2013. "A Time Predefined Variable Depth Search for Nurse Rostering," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 411-419, August.
    4. Sanja Petrovic & Greet Berghe, 2012. "A comparison of two approaches to nurse rostering problems," Annals of Operations Research, Springer, vol. 194(1), pages 365-384, April.
    5. E K Burke & T Curtois & R Qu & G Vanden Berghe, 2010. "A scatter search methodology for the nurse rostering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1667-1679, November.
    6. E K Burke & T Curtois & L F van Draat & J-K van Ommeren & G Post, 2011. "Progress control in iterated local search for nurse rostering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 360-367, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    2. Belií«n, Jeroen & Demeulemeester, Erik, 2008. "A branch-and-price approach for integrating nurse and surgery scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 652-668, September.
    3. Jingpeng Li & Uwe Aickelin & Edmund K. Burke, 2009. "A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 468-479, August.
    4. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    5. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    6. Edmund K. Burke & Timothy Curtois & Rong Qu & Greet Vanden Berghe, 2013. "A Time Predefined Variable Depth Search for Nurse Rostering," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 411-419, August.
    7. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "Preference scheduling for nurses using column generation," European Journal of Operational Research, Elsevier, vol. 164(2), pages 510-534, July.
    8. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    9. Beddoe, Gareth R. & Petrovic, Sanja, 2006. "Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering," European Journal of Operational Research, Elsevier, vol. 175(2), pages 649-671, December.
    10. B Maenhout & M Vanhoucke, 2009. "The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1683-1698, December.
    11. Berrada, Ilham & Ferland, Jacques A. & Michelon, Philippe, 1996. "A multi-objective approach to nurse scheduling with both hard and soft constraints," Socio-Economic Planning Sciences, Elsevier, vol. 30(3), pages 183-193, September.
    12. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    13. D. Parr & J. Thompson, 2007. "Solving the multi-objective nurse scheduling problem with a weighted cost function," Annals of Operations Research, Springer, vol. 155(1), pages 279-288, November.
    14. Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
    15. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    16. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    17. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    18. Bellanti, F. & Carello, G. & Della Croce, F. & Tadei, R., 2004. "A greedy-based neighborhood search approach to a nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 28-40, February.
    19. Hai Wang, 2019. "Routing and Scheduling for a Last-Mile Transportation System," Service Science, INFORMS, vol. 53(1), pages 131-147, February.
    20. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, 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:pal:jorsoc:v:58:y:2007:i:12:d:10.1057_palgrave.jors.2602304. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.