Skip to main content
SpringerLink
Log in

A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations

  • Conference paper
Principles and Practice of Constraint Programming - CP 2009 (CP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

Abstract

Resource Constrained Project Scheduling Problem is a very important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and variable activity durations. The solving approach is based on Precedence Constraint Posting that adds new precedence constraints to the original project graph so that all resource conflicts are solved and a consistent assignment of start times can be computed for whatever combination of activity durations. We propose a novel method for computing resource conflicts based on the minimum flow on the resource graph and we use it in an efficient complete search strategy. We experiment the approach on instances coming from the scheduling of parallel applications on multi processor systems on chip.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1), 3–41 (1999)

    Article  MATH  Google Scholar 

  2. Stork, F.: Branch-and-bound algorithms for stochastic resource-constrained project scheduling. Technical Report Research Report No. 702/2000, Technische Universität Berlin (2000)

    Google Scholar 

  3. Stork, F.: Stochastic resource-constrained project scheduling. PhD thesis, Technische Universität Berlin (2001)

    Google Scholar 

  4. Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13(1), 29–48 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13(1), 1–28 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Herroelen, W., Leus, R.: Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research 165(2), 289–306 (2005); Project Management and Scheduling

    Article  MATH  Google Scholar 

  7. Beck, J.C., Davenport, A.J.: A survey of techniques for scheduling with uncertainty (2002), http://www.eil.utoronto.ca/profiles/chris/gz/uncertainty-survey.ps

  8. Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: IJCAI, pp. 181–186 (2005)

    Google Scholar 

  9. Benini, L., Lombardi, M., Milano, M.: Robust non-preemptive hard real-time scheduling for clustered multicore platforms. In: Proc. of DATE 2009 (2009)

    Google Scholar 

  10. Golumbic, M.: Algorithmic Graph Theory And Perfect Graphs, 2nd edn. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  11. Morris, P.H., Muscettola, N.: Temporal dynamic controllability revisited. In: AAAI, pp. 1193–1198 (2005)

    Google Scholar 

  12. Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: IJCAI, pp. 494–502 (2001)

    Google Scholar 

  13. Muscettola, N.: Computing the envelope for stepwise-constant resource allocations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 139–154. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From precedence constraint posting to partial order schedules: a csp approach to robust scheduling. AI Commun. 20(3), 163–180 (2007)

    MathSciNet  MATH  Google Scholar 

  15. Policella, N., Oddi, A., Smith, S.F., Cesta, A.: Generating robust partial order schedules. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 496–511. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I - General strategies. Mathematical Methods of Operations Research 28(7), 193–260 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  17. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems II - set strategies. Mathematical Methods of Operations Research 29(3), 65–104 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. De Reyck, B., Herroelen, W.: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111(1), 152–174 (1998)

    Article  MATH  Google Scholar 

  19. Möhring, R.H., Stork, F.: Linear preselective policies for stochastic project scheduling. Mathematical Methods of Operations Research 52(3), 501–515 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Exp. Theor. Artif. Intell. 11(1), 23–45 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Università di Bologna V.le Risorgimento 2, 40136, Bologna, Italy

    Michele Lombardi & Michela Milano

Authors
  1. Michele Lombardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michela Milano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St. Andrews, North Haugh, St Andrews, KY16 9SX, Fife, Scotland, UK

    Ian P. Gent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lombardi, M., Milano, M. (2009). A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation