IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v19y2016i1d10.1007_s10951-015-0457-6.html
   My bibliography  Save this article

A genetic algorithm for the robust resource leveling problem

Author

Listed:
  • Hongbo Li

    (Shanghai University
    KU Leuven
    Beihang University)

  • Erik Demeulemeester

    (KU Leuven)

Abstract

The resource leveling problem (RLP) involves the determination of a project baseline schedule that specifies the planned activity starting times while satisfying both the precedence constraints and the project deadline constraint under the objective of minimizing the variation in the resource utilization. However, uncertainty is inevitable during project execution. The baseline schedule generated by the deterministic RLP model tends to fail to achieve the desired objective when durations are uncertain. We study the robust resource leveling problem in which the activity durations are stochastic and the objective is to obtain a robust baseline schedule that minimizes the expected positive deviation of both resource utilizations and activity starting times. We present a genetic algorithm for the robust RLP. In order to demonstrate the effectiveness of our genetic algorithm, we conduct extensive computational experiments on a large number of randomly generated test instances and investigate the impact of different factors (the marginal cost of resource usage deviations, the marginal cost of activity starting time deviations, the activity duration variability, the due date, the order strength, the resource factor and the resource constrainedness).

Suggested Citation

  • Hongbo Li & Erik Demeulemeester, 2016. "A genetic algorithm for the robust resource leveling problem," Journal of Scheduling, Springer, vol. 19(1), pages 43-60, February.
    • Handle: RePEc:spr:jsched:v:19:y:2016:i:1:d:10.1007_s10951-015-0457-6
    DOI: 10.1007/s10951-015-0457-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0457-6
    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/s10951-015-0457-6?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. M Ranjbar, 2013. "A path-relinking metaheuristic for the resource levelling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(7), pages 1071-1078, July.
    2. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy, 2008. "Proactive heuristic procedures for robust project scheduling: An experimental analysis," European Journal of Operational Research, Elsevier, vol. 189(3), pages 723-733, September.
    3. Neumann, K. & Zimmermann, J., 1999. "Resource levelling for projects with schedule-dependent time windows," European Journal of Operational Research, Elsevier, vol. 117(3), pages 591-605, September.
    4. Deblaere, Filip & Demeulemeester, Erik & Herroelen, Willy, 2011. "Proactive policies for the stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 308-316, October.
    5. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy & Leus, Roel, 2005. "The use of buffers in project management: The trade-off between stability and makespan," International Journal of Production Economics, Elsevier, vol. 97(2), pages 227-240, August.
    6. 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.
    7. Bandelloni, M. & Tucci, M. & Rinaldi, R., 1994. "Optimal resource leveling using non-serial dyanamic programming," European Journal of Operational Research, Elsevier, vol. 78(2), pages 162-177, October.
    8. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2008. "A hybrid genetic algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 495-508, March.
    9. D. Debels & M. Vanhoucke, 2005. "A Decomposition-Based Heuristic For The Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/293, Ghent University, Faculty of Economics and Business Administration.
    10. Demeulemeester, Erik & Herroelen, Willy, 2011. "Robust Project Scheduling," Foundations and Trends(R) in Technology, Information and Operations Management, now publishers, vol. 3(3–4), pages 201-376, January.
    11. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    12. Neumann, K. & Zimmermann, J., 2000. "Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints," European Journal of Operational Research, Elsevier, vol. 127(2), pages 425-443, December.
    13. 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.
    14. Rieck, Julia & Zimmermann, Jürgen & Gather, Thorsten, 2012. "Mixed-integer linear programming for resource leveling problems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 27-37.
    15. W Herroelen & B De Reyck, 1999. "Phase transitions in project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 148-156, February.
    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. Hongbo Li & Linwen Zheng & Hanyu Zhu, 2023. "Resource leveling in projects with flexible structures," Annals of Operations Research, Springer, vol. 321(1), pages 311-342, February.
    2. Claudio Szwarcfiter & Yale T. Herer & Avraham Shtub, 2022. "Project scheduling in a lean environment to maximize value and minimize overruns," Journal of Scheduling, Springer, vol. 25(2), pages 177-190, April.
    3. Yanyan Wang & Baiqing Sun, 2022. "Multiperiod optimal emergency material allocation considering road network damage and risk under uncertain conditions," Operational Research, Springer, vol. 22(3), pages 2173-2208, July.
    4. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    5. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.

    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. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    2. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    3. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    4. Yangyang Liang & Nanfang Cui & Tian Wang & Erik Demeulemeester, 2019. "Robust resource-constrained max-NPV project scheduling with stochastic activity duration," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 219-254, March.
    5. Said, Samer S. & Haouari, Mohamed, 2015. "A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 628-636.
    6. Hongbo Li & Linwen Zheng & Hanyu Zhu, 2023. "Resource leveling in projects with flexible structures," Annals of Operations Research, Springer, vol. 321(1), pages 311-342, February.
    7. Balouka, Noemie & Cohen, Izack, 2021. "A robust optimization approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 291(2), pages 457-470.
    8. 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.
    9. Bruni, M.E. & Di Puglia Pugliese, L. & Beraldi, P. & Guerriero, F., 2017. "An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations," Omega, Elsevier, vol. 71(C), pages 66-84.
    10. Zamani, Reza, 2013. "A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 552-559.
    11. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    12. Deblaere, Filip & Demeulemeester, Erik & Herroelen, Willy, 2011. "Proactive policies for the stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 308-316, October.
    13. Majid Askarifard & Hamidreza Abbasianjahromi & Mehran Sepehri & Ehsanollah Zeighami, 2021. "A robust multi-objective optimization model for project scheduling considering risk and sustainable development criteria," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 23(8), pages 11494-11524, August.
    14. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    15. Shichang Xiao & Shudong Sun & Jionghua (Judy) Jin, 2017. "Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems," Energies, MDPI, vol. 10(4), pages 1-26, April.
    16. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    17. Farnaz Torabi Yeganeh & Seyed Hessameddin Zegordi, 2020. "A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration," Annals of Operations Research, Springer, vol. 285(1), pages 161-196, February.
    18. Olivier Lambrechts & Erik Demeulemeester & Willy Herroelen, 2011. "Time slack-based techniques for robust project scheduling subject to resource uncertainty," Annals of Operations Research, Springer, vol. 186(1), pages 443-464, June.
    19. Coelho, José & Vanhoucke, Mario, 2011. "Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers," European Journal of Operational Research, Elsevier, vol. 213(1), pages 73-82, August.
    20. Salim Rostami & Stefan Creemers & Roel Leus, 2018. "New strategies for stochastic resource-constrained project scheduling," Journal of Scheduling, Springer, vol. 21(3), pages 349-365, June.

    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:jsched:v:19:y:2016:i:1:d:10.1007_s10951-015-0457-6. 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.