IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_35.html
   My bibliography  Save this book chapter

Personnel Rostering by Means of Variable Neighborhood Search

In: Operations Research Proceedings 2010

Author

Listed:
  • Martin Josef Geiger

    (Helmut-Schmidt-University, University of the Federal Armed Forces Hamburg)

Abstract

The article presents a Variable Neighborhood Search approach for personnel rostering problems, with a particular computer implementation (and results) for the data sets of the very recent First International Nurse Rostering Competition 2010. In this context, our work is motivated by two objectives: (i) The very fast computation of qualitatively good solutions, and (ii) the subsequent provision of decision aid by means of computational intelligence techniques. Starting from initially constructed solutions, we are able to demonstrate a considerable improvement of the quality of the solutions by means of the proposed metaheuristic. Moreover, and due to the rather problem-independent character of the approach, problem formulations with varying characteristics are equally supported by our solution approach.

Suggested Citation

  • Martin Josef Geiger, 2011. "Personnel Rostering by Means of Variable Neighborhood Search," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 219-224, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-20009-0_35
    DOI: 10.1007/978-3-642-20009-0_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Sara Ceschia & Nguyen Dang & Patrick Causmaecker & Stefaan Haspeslagh & Andrea Schaerf, 2019. "The Second International Nurse Rostering Competition," Annals of Operations Research, Springer, vol. 274(1), pages 171-186, March.
    2. Meignan, David & Knust, Sigrid, 2019. "A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization," European Journal of Operational Research, Elsevier, vol. 279(2), pages 320-334.

    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:spr:oprchp:978-3-642-20009-0_35. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.