IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaor/8876990.html
   My bibliography  Save this article

A Successful Three-Phase Metaheuristic for the Shift Minimization Personal Task Scheduling Problem

Author

Listed:
  • Kimmo Nurmi
  • Nico Kyngäs

Abstract

Workforce scheduling process consists of three major phases: workload prediction, shift generation, and staff rostering. Shift generation is the process of transforming the determined workload into shifts as accurately as possible. The Shift Minimization Personnel Task Scheduling Problem (SMPTSP) is a problem in which a set of tasks with fixed start and finish times must be allocated to a heterogeneous workforce. We show that the presented three-phase metaheuristic can successfully solve the most challenging SMPTSP benchmark instances. The metaheuristic was able to solve 44 of the 47 instances to optimality. The metaheuristic produced the best overall results compared to the previously published methods. The results were generated as a by-product when solving a more complicated General Task-based Shift Generation Problem. The metaheuristic generated comparable results to the methods using commercial MILP solvers as part of the solution process. The presented method is suitable for application in large real-world scenarios. Application areas include cleaning, home care, guarding, manufacturing, and delivery of goods.

Suggested Citation

  • Kimmo Nurmi & Nico Kyngäs, 2021. "A Successful Three-Phase Metaheuristic for the Shift Minimization Personal Task Scheduling Problem," Advances in Operations Research, Hindawi, vol. 2021, pages 1-12, January.
    • Handle: RePEc:hin:jnlaor:8876990
    DOI: 10.1155/2021/8876990
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AOR/2021/8876990.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AOR/2021/8876990.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/8876990?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
    ---><---

    More about this item

    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:hin:jnlaor:8876990. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.