IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v19y2025i3p340-373.html
   My bibliography  Save this article

Shift scheduling and rostering with same shift-type and weekend-off fairness constraints in call centres

Author

Listed:
  • Ruicheng Wang
  • Yue Xu
  • Xiuli Wang

Abstract

Based on the actual operational situation of call centres, this paper incorporates the constraints of the same shift-type within a week and the fairness of weekends-off into scheduling. Utilising the progressive decomposition structure of the same shift-type constraint, this paper constructs an integer programming model for multi-week scheduling optimisation problem of call centre agents. We first analyse the maximum lower bound of the problem and prove the optimality of its relaxation problem. Then we propose a two-stage algorithm which combines a constructive heuristic with neighbourhood search incorporating simulated annealing. Experimental results show that the integer programming model is only suitable for achieving optimal solutions for small-scale problems, while our two-stage algorithm can obtain (sub-)optimal solutions for large-scale problems. The impact of employment policy on labour costs is also discussed. [Received: 21 March 2023; Accepted: 12 November 2023]

Suggested Citation

  • Ruicheng Wang & Yue Xu & Xiuli Wang, 2025. "Shift scheduling and rostering with same shift-type and weekend-off fairness constraints in call centres," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 19(3), pages 340-373.
    • Handle: RePEc:ids:eujine:v:19:y:2025:i:3:p:340-373
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=145292
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:eujine:v:19:y:2025:i:3:p:340-373. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.