IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i2d10.1007_s12351-025-00903-7.html
   My bibliography  Save this article

Pareto-optimal workforce scheduling with worker skills and preferences

Author

Listed:
  • Ali İşeri

    (Mudanya University)

  • Hatice Güner

    (Istanbul Rumeli University)

  • Ali Rıza Güner

    (Istanbul Rumeli University)

Abstract

This paper addresses employee scheduling in service operations, considering various skill and skill levels and the fluctuating customer demand throughout the day and week. Employee shift and day-off preferences are also considered to enhance morale. We propose a two-stage integer programming model. In the first stage, the model optimizes the number of employees required for each shift period, ensuring uniform distribution of overstaffing to improve customer service. A Pareto frontier approach is applied between the two stages, offering decision-makers a set of non-dominated solutions that balance overstaffing and understaffing. The second stage uses the selected Pareto-optimal solution to assign shifts and day-offs to employees, incorporating their skills, preferences, and fairness considerations. Our model implicitly includes shifts and breaks, reducing decision variables and computational time. Using real data from a dining restaurant chain, we validate the model’s effectiveness in enhancing customer service and reducing labor costs by 12.3% compared to manual scheduling. Furthermore, productivity and employee satisfaction improve by considering individual skills and preferences.

Suggested Citation

  • Ali İşeri & Hatice Güner & Ali Rıza Güner, 2025. "Pareto-optimal workforce scheduling with worker skills and preferences," Operational Research, Springer, vol. 25(2), pages 1-27, June.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:2:d:10.1007_s12351-025-00903-7
    DOI: 10.1007/s12351-025-00903-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-025-00903-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-025-00903-7?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.

    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:operea:v:25:y:2025:i:2:d:10.1007_s12351-025-00903-7. 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.