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

An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling

In: Operations Research Proceedings 2008

Author

Listed:
  • Volker Nissen

    (Technical University of Ilmenau, Chair of Information Systems in Service)

  • René Birnstiel

    (Technical University of Ilmenau, Chair of Information Systems in Service)

Abstract

Summary Staff scheduling involves the assignment of a qualified employee to the appropriate workstation at the right time while considering various constraints. According to current research employees spend 27 to 36% of their working time unproductively, depending on the branch [10]. Major reasons include a lack of planning and controlling. Most often staff scheduling takes place based on prior experience or with the aid of spreadsheets [1]. Even with popular staff planning software employees are regularly scheduled for one workstation per day. However, in many branches, such as trade and logistics, the one-employee-onestation concept does not correspond to the actual requirements and sacrifices potential resources. Therefore, sub-daily (including sub-shift) planning should be an integral component of demand-oriented staff scheduling.

Suggested Citation

  • Volker Nissen & René Birnstiel, 2009. "An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 23, pages 141-146, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-00142-0_23
    DOI: 10.1007/978-3-642-00142-0_23
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-642-00142-0_23. 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.