[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

A Novel Metaheuristic Approach for Resource Constrained Project Scheduling Problem

  • Conference paper
  • First Online:
Soft Computing: Theories and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1154))

  • 1072 Accesses

Abstract

The Resource Constrained Project Scheduling Problem (RCPSP) is a prominent and a noteworthy NP-hard Combinatorial Optimization problem in the field of Operations Research and Management. It is a proven complex problem which involves constrained availability of resources, within which activities in a project should be optimally organized, keeping in mind the activity precedences, so that the project schedule is minimized. To efficiently solve the problem, many Evolutionary and Swarm Intelligence metaheuristics have been proposed, which have attempted to solve the problem optimally. This paper presents a novel Swarm Intelligence algorithm based on the Firefly Algorithm (FA). Applying the FA to solve the RCPSP problem, however, involved discretizing the FA as RCPSP is a discrete problem and FA by nature is continuous. The presented algorithm has been checked on standard benchmark test problems available in the literature and also compared with existing contemporary Swarm Intelligence and Evolutionary Algorithms available. The results of the experiments also justify the effectiveness of the proposed algorithm.

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
£29.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
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 143.50
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 179.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Artigues, C.: The Resource-Constrained Project Scheduling Problem. http://www.iste.co.uk/data/doc_dtalmanhopmh.pdf

  2. Sprecher, A., Kolisch, R.: PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205–216 (1997)

    Article  Google Scholar 

  3. Merkle, D., Schmeck, H., Middendorf, M.: Ant colony ofor resource-constrained project scheduling. IEEE Trans. Evol. Comp. 6(4), (2002)

    Google Scholar 

  4. Brucker, P., Knust S., Schoo A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem, Eur. J. Oper. Res. 107, 272–288 (1998)

    Google Scholar 

  5. Blazewicz, J., Lenstra, J.K., Rinnooy, K.A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1), 11–24 (1983)

    Article  MathSciNet  Google Scholar 

  6. Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394–407 (2000)

    Article  Google Scholar 

  7. Zhou, Y., Guo, Q., Gan, R.: Improved ACO algorithm for Resource-Constrained Project Scheduling Problem. In: International Conference on Artificial Intelligence and Computational Intelligence, AICI ‘09, IEEE, vol. 3, pp. 358–365 (2009)

    Google Scholar 

  8. Yang, X.S.: Nature-inspired Metaheuristic Algorithm. Luniver Press (2008)

    Google Scholar 

  9. Vanhoucke, M.: Project management with dynamic scheduling. Springer, Berlin (2012). https://doi.org/10.1007/978-3-642-40438-2

  10. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174, 23–37 (2006)

    Article  Google Scholar 

  11. Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz, J. (ed.) Project Scheduling: Recent Models Algorithms and Applications, pp. 147–178. Kluwer Academic Publishers, Berlin (1999)

    Chapter  Google Scholar 

  12. Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 29, 249–272 (2001)

    Article  Google Scholar 

  13. Koulinas, G., Kotsikas, L., Anagnostopoulos, K.: A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inf. Sci. 277, 680–693 (2014)

    Article  Google Scholar 

  14. Kumar, N., Vidyarthi, D.P.: A model for resource-constrained project scheduling using adaptive PSO. Soft. Comput. 20(4), 1565–1580 (2016)

    Article  Google Scholar 

  15. Ziarati, K., Akbari, R., Zeighami, V.: On the performance of bee algorithms for resource-constrained project scheduling problem. Appl. Soft Comput. 11(4), 3720–3733 (2011)

    Article  Google Scholar 

  16. Bibiks K., Hu F., Li J., Smith, A.: Discrete Cuckoo Search for Resource Constrained Project Scheduling Problem. In: International Conference on Computational Science and Engineering, IEEE, pp. 240–245 (2015)

    Google Scholar 

  17. Marichelvam, M.K., Prabahkaran, T., Yang, X.S.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans. Evol. Comput. 18(2), 301–305 (2014)

    Google Scholar 

  18. Karthikeyan, S., Asokan, P., Nickolas, S., Page, T.: A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int. J. Bio-Inspired Comput. 7(6), 386–401 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Francis Institute of Technology, University of Mumbai, Mumbai, India

    Bidisha Roy

  2. Faculty, OERC Academy, Turbhe, Navi Mumbai, India

    Asim Kumar Sen

Authors
  1. Bidisha Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asim Kumar Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bidisha Roy .

Editor information

Editors and Affiliations

  1. Department of Paper Technology, IIT Roorkee, Roorkee, India

    Millie Pant

  2. Graphic Era Hill University, Dehradun, Uttarakhand, India

    Tarun Kumar Sharma

  3. NIT Patna, Patna, India

    Rajeev Arya

  4. NIT Patna, Patna, India

    B.C. Sahana

  5. Ryerson University, Toronto, ON, Canada

    Hossein Zolfagharinia

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Roy, B., Sen, A.K. (2020). A Novel Metaheuristic Approach for Resource Constrained Project Scheduling Problem. In: Pant, M., Kumar Sharma, T., Arya, R., Sahana, B., Zolfagharinia, H. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 1154. Springer, Singapore. https://doi.org/10.1007/978-981-15-4032-5_49

Download citation

Publish with us

Policies and ethics