IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0157104.html
   My bibliography  Save this article

Dynamic Staffing and Rescheduling in Software Project Management: A Hybrid Approach

Author

Listed:
  • Yujia Ge
  • Bin Xu

Abstract

Resource allocation could be influenced by various dynamic elements, such as the skills of engineers and the growth of skills, which requires managers to find an effective and efficient tool to support their staffing decision-making processes. Rescheduling happens commonly and frequently during the project execution. Control options have to be made when new resources are added or tasks are changed. In this paper we propose a software project staffing model considering dynamic elements of staff productivity with a Genetic Algorithm (GA) and Hill Climbing (HC) based optimizer. Since a newly generated reschedule dramatically different from the initial schedule could cause an obvious shifting cost increase, our rescheduling strategies consider both efficiency and stability. The results of real world case studies and extensive simulation experiments show that our proposed method is effective and could achieve comparable performance to other heuristic algorithms in most cases.

Suggested Citation

  • Yujia Ge & Bin Xu, 2016. "Dynamic Staffing and Rescheduling in Software Project Management: A Hybrid Approach," PLOS ONE, Public Library of Science, vol. 11(6), pages 1-28, June.
    • Handle: RePEc:plo:pone00:0157104
    DOI: 10.1371/journal.pone.0157104
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0157104
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0157104&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0157104?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
    ---><---

    References listed on IDEAS

    as
    1. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    2. Cowling, Peter & Johansson, Marcus, 2002. "Using real time information for effective dynamic scheduling," European Journal of Operational Research, Elsevier, vol. 139(2), pages 230-244, June.
    3. Kouskouras, Konstantinos G. & Georgiou, Andreas C., 2007. "A discrete event simulation model in the case of managing a software project," European Journal of Operational Research, Elsevier, vol. 181(1), pages 374-389, August.
    4. Arturo Chavoya & Cuauhtemoc Lopez-Martin & Irma R Andalon-Garcia & M E Meda-Campaña, 2012. "Genetic Programming as Alternative for Predicting Development Effort of Individual Software Projects," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-10, November.
    5. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    6. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    7. Carlos Contreras-Bolton & Victor Parada, 2015. "Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-25, September.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Zhu, Xia & Ruiz, Rubén & Li, Shiyu & Li, Xiaoping, 2017. "An effective heuristic for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 257(3), pages 746-762.
    3. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    4. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
    5. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    6. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    7. Vega-Velázquez, Miguel Ángel & García-Nájera, Abel & Cervantes, Humberto, 2018. "A survey on the Software Project Scheduling Problem," International Journal of Production Economics, Elsevier, vol. 202(C), pages 145-161.
    8. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    9. Yamashita, Denise Sato & Armentano, Vinicius Amaral & Laguna, Manuel, 2006. "Scatter search for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 169(2), pages 623-637, March.
    10. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    11. Changjiu Li & Yong Zhang & Xichao Su & Xinwei Wang, 2022. "An Improved Optimization Algorithm for Aeronautical Maintenance and Repair Task Scheduling Problem," Mathematics, MDPI, vol. 10(20), pages 1-25, October.
    12. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    13. F. Perez & T. Gomez, 2016. "Multiobjective project portfolio selection with fuzzy constraints," Annals of Operations Research, Springer, vol. 245(1), pages 7-29, October.
    14. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    15. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    16. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    17. Junguang Zhang & Dan Wan, 2021. "Determination of early warning time window for bottleneck resource buffer," Annals of Operations Research, Springer, vol. 300(1), pages 289-305, May.
    18. Bhaskar, Tarun & Pal, Manabendra N. & Pal, Asim K., 2011. "A heuristic method for RCPSP with fuzzy activity times," European Journal of Operational Research, Elsevier, vol. 208(1), pages 57-66, January.
    19. Anıl Can & Gündüz Ulusoy, 2014. "Multi-project scheduling with two-stage decomposition," Annals of Operations Research, Springer, vol. 217(1), pages 95-116, June.
    20. Artigues, Christian & Michelon, Philippe & Reusser, Stephane, 2003. "Insertion techniques for static and dynamic resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 149(2), pages 249-267, September.

    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:plo:pone00:0157104. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.