IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v252y2017i2d10.1007_s10479-015-2033-z.html
   My bibliography  Save this article

A resource type analysis of the integrated project scheduling and personnel staffing problem

Author

Listed:
  • Broos Maenhout

    (Ghent University)

  • Mario Vanhoucke

    (Ghent University
    Vlerick Business School
    University College London)

Abstract

In the integrated project scheduling and personnel staffing problem the project activities are scheduled and simultaneously a staffing plan is composed to carry out a single project. In this way, the project schedule that leads to the staffing plan with minimum cost is determined. In this paper, we evaluate different scheduling policies and practices for different personnel resource types. We examine the impact on the staffing cost when the personnel resources are scheduled in a cyclic versus a non-cyclic manner for different (days on, days off)-patterns. Furthermore, the impact of introducing more flexible resource types, such as overtime and temporary help, is explored in relationship with the activity resource demand variability. Computational results show that non-cyclic scheduling leads to a considerable lower staffing cost under all circumstances compared to cyclic scheduling. However, despite the tractability of the resource requirements, flexible temporary resources are essential on top of the regular personnel resources to respond to the variability in demand. The addition of overtime on a strategic staffing level only marginally decreases the personnel cost.

Suggested Citation

  • Broos Maenhout & Mario Vanhoucke, 2017. "A resource type analysis of the integrated project scheduling and personnel staffing problem," Annals of Operations Research, Springer, vol. 252(2), pages 407-433, May.
    • Handle: RePEc:spr:annopr:v:252:y:2017:i:2:d:10.1007_s10479-015-2033-z
    DOI: 10.1007/s10479-015-2033-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2033-z
    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/s10479-015-2033-z?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.

    References listed on IDEAS

    as
    1. John J. Bartholdi & James B. Orlin & H. Donald Ratliff, 1980. "Cyclic Scheduling via Integer Programs with Circular Ones," Operations Research, INFORMS, vol. 28(5), pages 1074-1085, October.
    2. R. N. Burns & M. W. Carter, 1985. "Work Force Size and Single Shift Schedules with Variable Demands," Management Science, INFORMS, vol. 31(5), pages 599-607, May.
    3. R. Tibrewala & D. Philippe & J. Browne, 1972. "Optimal Scheduiing of Two Consecutive Idle Periods," Management Science, INFORMS, vol. 19(1), pages 71-75, September.
    4. Deckro, RF & Hebert, JE, 1989. "Resource constrained project crashing," Omega, Elsevier, vol. 17(1), pages 69-79.
    5. Kenneth R. Baker, 1974. "Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements," Management Science, INFORMS, vol. 20(12), pages 1561-1568, August.
    6. Billionnet, Alain, 1999. "Integer programming to schedule a hierarchical workforce with variable demands," European Journal of Operational Research, Elsevier, vol. 114(1), pages 105-114, April.
    7. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    8. Tiwari, Vikram & Patterson, James H. & Mabert, Vincent A., 2009. "Scheduling projects with heterogeneous resources to meet time and quality objectives," European Journal of Operational Research, Elsevier, vol. 193(3), pages 780-790, March.
    9. John J. Bartholdi, 1981. "A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering," Operations Research, INFORMS, vol. 29(3), pages 501-510, June.
    10. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    11. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    12. James M. Lowerre, 1977. "Work Stretch Properties for the Scheduling of Continuous Operations Under Alternative Labor Policies," Management Science, INFORMS, vol. 23(9), pages 963-971, May.
    13. Hung, Rudy, 1994. "Single-shift off-day scheduling of a hierarchical workforce with variable demands," European Journal of Operational Research, Elsevier, vol. 78(1), pages 49-57, October.
    14. William S. Brownell & James M. Lowerre, 1976. "Scheduling of Work Forces Required in Continuous Operations Under Alternative Labor Policies," Management Science, INFORMS, vol. 22(5), pages 597-605, January.
    15. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    16. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    17. Easton, F. F. & Rossin, D. F., 1997. "Overtime schedules for full-time service workers," Omega, Elsevier, vol. 25(3), pages 285-299, June.
    18. Drezet, L.-E. & Billaut, J.-C., 2008. "A project scheduling problem with labour constraints and time-dependent activities requirements," International Journal of Production Economics, Elsevier, vol. 112(1), pages 217-225, March.
    19. repec:spr:pharme:v:21:y:2003:i:12:p:839-851 is not listed on IDEAS
    20. Vanhoucke, Mario & Coelho, Jose & Debels, Dieter & Maenhout, Broos & Tavares, Luis V., 2008. "An evaluation of the adequacy of project network generators with systematically sampled networks," European Journal of Operational Research, Elsevier, vol. 187(2), pages 511-524, June.
    21. Hung, R, 1991. "Single-shift workforce scheduling under a compressed workweek," Omega, Elsevier, vol. 19(5), pages 494-497.
    22. Techawiboonwong, Atthawit & Yenradee, Pisal & Das, Sanchoy K., 2006. "A master scheduling model with skilled and unskilled temporary workers," International Journal of Production Economics, Elsevier, vol. 103(2), pages 798-809, October.
    23. Kenneth R. Baker & Michael J. Magazine, 1977. "Workforce Scheduling with Cyclic Demands and Day-Off Constraints," Management Science, INFORMS, vol. 24(2), pages 161-167, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Mick Van Den Eeckhout & Broos Maenhout & Mario Vanhoucke, 2020. "Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs," Annals of Operations Research, Springer, vol. 292(1), pages 133-160, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    2. Hung, Rudy, 2006. "Using compressed workweeks to save labour cost," European Journal of Operational Research, Elsevier, vol. 170(1), pages 319-322, April.
    3. Eiji Mizutani & Kevin Alexander Sánchez Galeano, 2023. "A note on a single-shift days-off scheduling problem with sequence-dependent labor costs," Journal of Scheduling, Springer, vol. 26(3), pages 315-329, June.
    4. Smet, Pieter & Brucker, Peter & De Causmaecker, Patrick & Vanden Berghe, Greet, 2016. "Polynomially solvable personnel rostering problems," European Journal of Operational Research, Elsevier, vol. 249(1), pages 67-75.
    5. Lishun Zeng & Mingyu Zhao & Yangfan Liu, 2019. "Airport ground workforce planning with hierarchical skills: a new formulation and branch-and-price approach," Annals of Operations Research, Springer, vol. 275(1), pages 245-258, April.
    6. Hertz, Alain & Lahrichi, Nadia & Widmer, Marino, 2010. "A flexible MILP model for multiple-shift workforce planning under annualized hours," European Journal of Operational Research, Elsevier, vol. 200(3), pages 860-873, February.
    7. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
    8. Volland, Jonas & Fügener, Andreas & Brunner, Jens O., 2017. "A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals," European Journal of Operational Research, Elsevier, vol. 260(1), pages 316-334.
    9. Narasimhan, Rangarajan, 1997. "An algorithm for single shift scheduling of hierarchical workforce," European Journal of Operational Research, Elsevier, vol. 96(1), pages 113-121, January.
    10. Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.
    11. L Wan & J F Bard, 2007. "Weekly staff scheduling with workstation group restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1030-1046, August.
    12. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    13. Andreas Fügener & Jens O. Brunner, 2019. "Planning for Overtime: The Value of Shift Extensions in Physician Scheduling," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 732-744, October.
    14. Jens O. Brunner & Jonathan F. Bard & Jan M. Köhler, 2013. "Bounded flexibility in days‐on and days‐off scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 678-701, December.
    15. Mick Van Den Eeckhout & Broos Maenhout & Mario Vanhoucke, 2020. "Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs," Annals of Operations Research, Springer, vol. 292(1), pages 133-160, September.
    16. Breugem, T. & Dollevoet, T.A.B. & Huisman, D., 2017. "Is Equality always desirable?," Econometric Institute Research Papers EI2017-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Snauwaert, Jakob & Vanhoucke, Mario, 2023. "A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 1-19.
    18. Richard N. Burns & Rangarajan Narasimhan & L. Douglas Smith, 1998. "A set‐processing algorithm for scheduling staff on 4‐day or 3‐day work weeks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 839-853, December.
    19. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.
    20. Kraul, Sebastian & Fügener, Andreas & Brunner, Jens O. & Blobner, Manfred, 2019. "A robust framework for task-related resident scheduling," European Journal of Operational Research, Elsevier, vol. 276(2), pages 656-675.

    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:annopr:v:252:y:2017:i:2:d:10.1007_s10479-015-2033-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.