Skip to main content
SpringerLink
Log in

Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances

  • Conference paper
  • First Online:
Analysis of Images, Social Networks and Texts (AIST 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12602))

  • 812 Accesses

Abstract

We consider the Resource-Constrained Project Scheduling Problem (RCPSP) with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. No activity preemption is allowed. We consider relaxation of RCPSP with special types of non-renewable resources to get a lower bound of the problem. We present new lower bound algorithm for the RCPSP with time complexity depending on the number of activities n as \(O(n\log n)\), and we test it on PSPLIB instances. Numerical experiments demonstrate that the proposed algorithm produces on some series of instances lower bounds very close to the best existing lower bounds published in the PSPLIB, while their calculation time is a fraction of a second. We get especially good marks for large-sized instances.

Supported by the program of fundamental scientific researches of the SB RAS No. I.5.1., project No. 0314-2019-0014, and by the Russian Foundation for Basic Research, project No. 20-31-90091.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Baptiste, P., Pape, C.L.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5, 119–139 (2000)

    Article  MathSciNet  Google Scholar 

  2. Bottcher, J., Drexl, A., Salewski, F.: Project scheduling under partially renewable resource constraints. Manage. Sci. 45(4), 543–559 (1999)

    Article  Google Scholar 

  3. Brucker, P., Drexl, A., Möhring, R., et al.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3–41 (1999)

    Article  Google Scholar 

  4. Gafarov, E., Lazarev, A., Werner, F.: On Lower and Upper Bounds for the Resource-Constrained Project Scheduling Problem. Technical report. Otto-von-Guericke Universitaet (2010)

    Google Scholar 

  5. Gimadi, E.Kh.: On Some Mathematical Models and Methods for Planning Large-Scale Projects. Models and Optimization Methods. In: Proceedings of AN USSR Sib. Branch, Mathematics Institution, Novosibirsk: Nauka, vol. 10, pp. 89–115 (1988) (in Russian)

    Google Scholar 

  6. Gimadi, E., Sevastianov, S.V.: On solvability of the project scheduling problem with accumulative resources of an arbitrary sign. In: Leopold-Wildburger U., Rendl F., Wäscher G. (eds.) Operations Research Proceedings, pp. 241–246. Springer, Berlin (2003) https://doi.org/10.1007/978-3-642-55537-4_39

  7. Gimadi, E.K., Sevastianov, S.V., Zalyubovsky, V.V.: On the Project Scheduling Problem under Stored Resource Constraints. In: Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, Antibes - Juan les Pins, France, pp. 703–706 (2001)

    Google Scholar 

  8. Gimadi, E.K., Zalyubovskii, V.V., Sevastyanov, S.V.: Polynomial solvability of scheduling problems with storable resources and deadlines. Diskretnyi Analiz i Issledovanie Operazii, Ser. 2, 7(1), 9–34 (2000) (in Russian)

    Google Scholar 

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

  10. Herroelen, W, Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling. In: Weglarz J. (ed.). Project Scheduling-Recent Models, Algorithms and Applications, International Series in Operations Research and Management Science, Kluwer Academy Publish., Dordrecht, vol. 14, pp. 77–106 (1998)

    Google Scholar 

  11. Knust, S.: Lower bounds on the minimum project duration. In: Schwindt, C., Zimmermann, J. (eds.) Handbook on Project Management and Scheduling Vol.1. IHIS, pp. 43–55. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-05443-8_3

    Chapter  Google Scholar 

  12. Kolisch, R., Sprecher, A.: PSPLIB - a Project Scheduling Problem Library. Eur. J. Oper. Res. 96 205–216 (1996) http://www.om-db.wi.tum.de/psplib/

  13. Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manage. Sci. 41, 1693–1703 (1995)

    Article  Google Scholar 

  14. Kozlov, M.K., Shafranskii, V.V.: Scheduling the implementation of work packages for a given dynamics of the receipt of stored resources. Izv. USSR Acad. Sci. Tech. Cybern. 4, 75–81 (1977) (in Russian)

    Google Scholar 

  15. Laborie, P.: Algorithms for propagation of resource constraints in AI planning and scheduling: existing approaches and new results. Artif. Intell. 143, 151–188 (2003)

    Article  MathSciNet  Google Scholar 

  16. Neron, E., et al.: Lower bounds for resource constrained project scheduling problem. In: Jozefowska, J., Weglarz, J. (eds.), Perspectives in Modern Project Scheduling, Chap. 7, pp. 167–204. Springer, Boston (2006)

    Google Scholar 

  17. Neumann, K., Schwindt, C.: Project scheduling with inventory constraints. Math. Methods Oper. Res. 56, 513–533 (2002)

    Article  MathSciNet  Google Scholar 

  18. Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Explaining the cumulative propagator. Constraints 16(3), 250–282 (2011)

    Article  MathSciNet  Google Scholar 

  19. Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-consrtained project scheduling problem. Eur. J. Oper. Res. 185(2), 495–508 (2008)

    Article  Google Scholar 

  20. Weglarz, J.: Project Scheduling. Recent Models, Algorithms and Applications. Kluwer Academy Publication, Boston(1999)

    Google Scholar 

  21. Zukhovickii, S.I., Radchik, I.A.: Mathematical Network Planning Methods. Nauka, Moscow (in Russian) (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Prosp. Akad. Koptyuga, 4, Novosibirsk, Russia

    E. Kh. Gimadi & E. N. Goncharov

  2. Novosibirsk State University, Pirogova, 1, Novosibirsk, Russia

    E. Kh. Gimadi & A. A. Shtepa

Authors
  1. E. Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. N. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Shtepa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen University, Aachen, Germany

    Wil M. P. van der Aalst

  2. University of Ljubljana, Ljubljana, Slovenia

    Vladimir Batagelj

  3. National Research University Higher School of Economics, Moscow, Russia

    Dmitry I. Ignatov

  4. Krasovskii Institute of Mathematics and Mechanics, Yekaterinburg, Russia

    Michael Khachay

  5. National Research University Higher School of Economics, St. Petersburg, Russia

    Olessia Koltsova

  6. University of Oslo, Oslo, Norway

    Andrey Kutuzov

  7. National Research University Higher School of Economics, Moscow, Russia

    Sergei O. Kuznetsov

  8. National Research University Higher School of Economics, Moscow, Russia

    Irina A. Lomazova

  9. Moscow State University, Moscow, Russia

    Natalia Loukachevitch

  10. LORIA, Vandœuvre lès Nancy, France

    Amedeo Napoli

  11. Skolkovo Institute of Science and Technology, Moscow, Russia

    Alexander Panchenko

  12. University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  13. Università Ca' Foscari Venezia, Venice, Italy

    Marcello Pelillo

  14. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Andrey V. Savchenko

  15. Kazan Federal University, Kazan, Russia

    Elena Tutubalina

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gimadi, E.K., Goncharov, E.N., Shtepa, A.A. (2021). Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances. In: van der Aalst, W.M.P., et al. Analysis of Images, Social Networks and Texts. AIST 2020. Lecture Notes in Computer Science(), vol 12602. Springer, Cham. https://doi.org/10.1007/978-3-030-72610-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-72610-2_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-72609-6

  • Online ISBN: 978-3-030-72610-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation