Skip to main content
SpringerLink
Log in

A Model for Resource Constraint Project Scheduling Problem Using Quantum Inspired PSO

  • Conference paper
  • First Online:
Smart and Innovative Trends in Next Generation Computing Technologies (NGCT 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 827))

Included in the following conference series:

Abstract

Resource Constrained Project Scheduling Problem (RCPSP) is a NP-hard project planning scheduling problem. It has been widely applied in real life industrial scenarios to optimize the project makespan with the limitation of the resources. In order to solve RCPSP, this paper suggests a Quantum inspired Particle Swarm Optimization (Q-PSO) probabilistic optimization technique. A classical PSO is very hard to map to the RCPSP because of its solution lies in continuous values position vector. To overcome this, Sequence Position Vector (SPV) rule is incorporated into PSO. Since, the activities of the project follows dependency constrains, due to updation in position vector, the dependency constrains are violated. To handle this situation, Valid Particle Generator (VPG) is used. With an assembling of these operators, a Q-PSO is introduced to solve RCPSP effectively. The effectiveness of the QPSO is verified on a standard dataset of PSPLIB for J30. Results show that Q-PSO has significant improvement in the performance over number of state of the arts. Since it uses probabilistic particle representation in terms of quantum bits (Q-bits) and thus replaces the inertia weight tuning and velocity update method in classical PSO.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • 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

References

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

    Article  MathSciNet  Google Scholar 

  2. Valls, V., Ballestıń, F., Quintanilla, S.: Justification and RCPSP: a technique that pays. Eur. J. Oper. Res. 165(2), 375–386 (2005)

    Article  Google Scholar 

  3. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Proceedings, vol. 4, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  4. 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 

  5. Zhang, H., Li, H., Tam, C.M.: Particle swarm optimization for resource-constrained project scheduling. Int. J. Proj. Manag. 24(1), 83–92 (2006)

    Article  Google Scholar 

  6. Jarboui, B., Damak, N., Siarry, P., Rebai, A.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195(1), 299–308 (2008)

    MathSciNet  MATH  Google Scholar 

  7. Chen, R.-M., Wu, C.-L., Wang, C.-M., Lo, S.-T.: Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB. Expert Syst. Appl. 37(3), 1899–1910 (2010)

    Article  Google Scholar 

  8. Zhang, H., Li, X., Li, H., Huang, F.: Particle swarm optimization-based schemes for resource-constrained project scheduling. Autom. Constr. 14(3), 393–404 (2005)

    Article  Google Scholar 

  9. Jia, Q., Seo, Y.: Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation. Comput. Oper. Res. 40(8), 2037–2050 (2013)

    Article  MathSciNet  Google Scholar 

  10. Moore, M., Narayanan, A.: Quantum-inspired computing. Department of Computer Science, University of Exeter, Exeter, UK (1995)

    Google Scholar 

  11. Han, K.-H., Kim, J.-H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6(6), 580–593 (2002)

    Article  MathSciNet  Google Scholar 

  12. Jeong, Y.-W., Park, J.-B., Jang, S.-H., Lee, K.Y.: A new quantum-inspired binary PSO: application to unit commitment problems for power systems. IEEE Trans. Power Syst. 25(3), 1486–1495 (2010)

    Article  Google Scholar 

  13. Kolisch, R., Sprecher, A.: 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 

  14. Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. Technical report, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel (1998)

    Google Scholar 

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

    Article  Google Scholar 

  16. Schirmer, A.: Case-based reasoning and improved adaptive search for project scheduling. Technical report, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel (1998)

    Google Scholar 

  17. Christofides, N., Alvarez-Valdés, R., Tamarit, J.M.: Project scheduling with resource constraints: a branch and bound approach. Eur. J. Oper. Res. 29(3), 262–273 (1987)

    Article  MathSciNet  Google Scholar 

  18. Alba, E., Chicano, J.F.: Software project management with gas. Inf. Sci. 177(11), 2380–2401 (2007)

    Article  Google Scholar 

  19. Kumar, N., Vidyarthi, D.P.: A novel hybrid PSO-GA meta-heuristic for scheduling of DAG with communication on multiprocessor systems. Eng. Comput. 32(1), 35–47 (2016)

    Article  Google Scholar 

  20. Şevkli, Z., Sevilgen, F.E., Keleş, Ö.: Particle swarm optimization for the orienteering problem. In: Proceedings of International Symposium on Innovation in Intelligent Systems and Application, Istanbul, Turkey, pp. 185–190, June 2007

    Google Scholar 

  21. Mendes, R., Kennedy, J., Neves, J.: The fully informed particle swarm: simpler, maybe better. IEEE Trans. Evol. Comput. 8(3), 204–210 (2004)

    Article  Google Scholar 

  22. Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Congress on Evolutionary Computation, CEC 2004, vol. 2, pp. 1412–1419. IEEE (2004)

    Google Scholar 

  23. Al Badawi, A., Shatnawi, A.: Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization. Comput. Oper. Res. 40(10), 2322–2328 (2013)

    Article  MathSciNet  Google Scholar 

  24. 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 

  25. Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Logist. 45(7), 733–750 (1988)

    Article  MathSciNet  Google Scholar 

  26. Schirmer, A.: Case-based reasoning and improved adaptive search for project scheduling. Nav. Res. Logist. 47(3), 201–222 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shri Mata Vaishno Devi University, Katra, Jammu and Kashmir, India

    Reya Sharma, Rashika Bangroo & Manoj Kumar

  2. Atal Bihari Vajpayee Indian Institute of Information Technology and Management, Gwalior, Gwalior, Madhya Pradesh, India

    Neetesh Kumar

Authors
  1. Reya Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rashika Bangroo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manoj Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Neetesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reya Sharma .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Patna, Patna, Bihar, India

    Pushpak Bhattacharyya

  2. University of Petroleum and Energy Studies, Dehradun, India

    Hanumat G. Sastry

  3. University of Petroleum and Energy Studies, Dehradun, India

    Venkatadri Marriboyina

  4. University of Petroleum and Energy Studies, Dehradun, India

    Rashmi Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sharma, R., Bangroo, R., Kumar, M., Kumar, N. (2018). A Model for Resource Constraint Project Scheduling Problem Using Quantum Inspired PSO. In: Bhattacharyya, P., Sastry, H., Marriboyina, V., Sharma, R. (eds) Smart and Innovative Trends in Next Generation Computing Technologies. NGCT 2017. Communications in Computer and Information Science, vol 827. Springer, Singapore. https://doi.org/10.1007/978-981-10-8657-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8657-1_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8656-4

  • Online ISBN: 978-981-10-8657-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation