Skip to main content
Springer Nature Link
Log in

Resource Constrained Multi-project Scheduling: A Priority Rule Based Evolutionary Local Search Approach

  • Conference paper
  • First Online:
Intelligent and Evolutionary Systems

Part of the book series: Proceedings in Adaptation, Learning and Optimization ((PALO,volume 8))

  • 1385 Accesses

Abstract

This paper considers a static resource constrained multi-project scheduling problem (RCMPSP) with two lateness objectives: project lateness and portfolio lateness. To solve the RCMPSP, we have proposed an evolutionary local search heuristic that uses a variable neighborhood (ELSH-VN) approach. The heuristic is further analyzed by incorporating different priority-rules. To judge the performance of these priority rule based heuristics, an extensive simulation-based analysis has been conducted with different scenario-based schedules. For the experimental study, we have considered a standard set of 77 generated RCMPSP test instances of 20 activities. The experimental analysis indicates that the proposed heuristic is able to solve multiple projects with reasonable computational burden. The influence of the variation of resource distribution and resource contention on the algorithm’s performance for different priority rules is also analyzed and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Payne, J.H., Management of multiple simultaneous projects: a state-of-the-art review. International journal of project management, 1995. 13(3): p. 163–168.

    Google Scholar 

  2. Browning, T.R. and A.A. Yassine, Resource-constrained multi-project scheduling: Priority rule performance revisited. International Journal of Production Economics, 2010. 126(2): p. 212–228.

    Google Scholar 

  3. Blazewicz, J., J.K. Lenstra, and A. Kan, Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 1983. 5(1): p. 11–24.

    Google Scholar 

  4. Drexl, A., Scheduling of project networks by job assignment. Management Science, 1991. 37(12): p. 1590–1602.

    Google Scholar 

  5. Gonçalves, J.F., J.J. Mendes, and M.G. Resende, A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research, 2008. 189(3): p. 1171–1190.

    Google Scholar 

  6. Mouthuy, S., et al., A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, 2015. 49(2): p. 223–238.

    Google Scholar 

  7. Mladenovic, N., R. Todosijevic, and D. Urosevic, An efficient general variable neighborhood search for large travelling salesman problem with time windows. Yugoslav Journal of Operations Research ISSN: 0354–0243 EISSN: 2334-6043, 2012. 23(1).

    Google Scholar 

  8. Talbot, F.B., Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 1982. 28(10): p. 1197–1210.

    Google Scholar 

  9. Kolisch, R., Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 1996. 90(2): p. 320–333.

    Google Scholar 

  10. Kolisch, R., Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 1996. 14(3): p. 179–192.

    Google Scholar 

  11. Kolisch, R. and S. Hartmann, Experimental investigation of heuristics for resource-constrained project scheduling: An update. European journal of operational research, 2006. 174(1): p. 23–37.

    Google Scholar 

  12. Patterson, J.H., Alternate methods of project scheduling with limited resources. Naval Research Logistics Quarterly, 1973. 20(4): p. 767–784.

    Google Scholar 

  13. Alvarez-Valdes, R. and J.M. Tamarit, Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis, in Advances in project scheduling. 1989, Elsevier Amsterdam. p. 113–134.

    Google Scholar 

  14. Kurtulus, I.S. and S.C. Narula, Multi-project scheduling: Analysis of project performance. IIE transactions, 1985. 17(1): p. 58–66.

    Google Scholar 

  15. Davis, E.W. and J.H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management science, 1975. 21(8): p. 944–955.

    Google Scholar 

  16. Browning, T.R. and A.A. Yassine, A random generator of resource-constrained multi-project network problems. Journal of scheduling, 2010. 13(2): p. 143–161.

    Google Scholar 

  17. Kurtulus, I. and E. Davis, Multi-project scheduling: Categorization of heuristic rules performance. Management Science, 1982. 28(2): p. 161–172.

    Google Scholar 

  18. Zimmerman, D.W. and B.D. Zumbo, Relative power of the Wilcoxon test, the Friedman test, and repeated-measures ANOVA on ranks. The Journal of Experimental Education, 1993. 62(1): p. 75–86.

    Google Scholar 

  19. Gehan, E.A., A generalized Wilcoxon test for comparing arbitrarily singly-censored samples. Biometrika, 1965. 52(1–2): p. 203-223.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Information Technology, University of New South Wales, Canberra, 2600, Australia

    Ripon K. Chakrabortty, Ruhul A. Sarker & Daryl L. Essam

Authors
  1. Ripon K. Chakrabortty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruhul A. Sarker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daryl L. Essam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ripon K. Chakrabortty .

Editor information

Editors and Affiliations

  1. School of Engineering and Information Technology, Australian Defence Force Academy, The University of New South Wales, Canberra, Australian Capital Territory, Australia

    George Leu

  2. School of Engineering and Information Technology, Australian Defence Force Academy, The University of New South Wales, Canberra, Australian Capital Territory, Australia

    Hemant Kumar Singh

  3. School of Engineering and Information Technology, Australian Defence Force Academy, The University of New South Wales, Canberra, Australian Capital Territory, Australia

    Saber Elsayed

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chakrabortty, R.K., Sarker, R.A., Essam, D.L. (2017). Resource Constrained Multi-project Scheduling: A Priority Rule Based Evolutionary Local Search Approach. In: Leu, G., Singh, H., Elsayed, S. (eds) Intelligent and Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-49049-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49049-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49048-9

  • Online ISBN: 978-3-319-49049-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics