Skip to main content
SpringerLink
Log in

Flow Models for Project Scheduling with Transfer Delays and Financial Constraints

  • Chapter
Recent Advances in Computational Optimization

Part of the book series: Studies in Computational Intelligence ((SCI,volume 470))

  • 1025 Accesses

Abstract

This paper deals with two extensions of the Resource Constrained Project Scheduling Problem (RCPSP), which involve resource transfer delays and ”Financial” resources. Flow models are used in order to formalize those extended RCPSP, which contain the standard RCPSP and lead us to the Timed Flow Polyhedron and to several structural results. This framework gives rise to generic Insertion operators, as well as greedy/local search algorithms. We end with numerical tests.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Kolisch, R., Padman, R.: Deterministic project scheduling. Omega 48, 249–272 (1999)

    Google Scholar 

  2. Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: RCPSP: notation, classification, models and methods. EJOR 112, 3–41 (1999)

    Article  MATH  Google Scholar 

  3. Baptiste, P., Laborie, P., Lepape, C., Nuijten, W.: Constraint-based scheduling/planning. In: Rossi, F., Van Beek, P. (eds.) Handbook Constraint Prog., ch. 22, pp. 759–98. Elsevier (2006)

    Google Scholar 

  4. Sauer, N., Stone, M.G.: Rational preemptive scheduling. Order 4, 195–206 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blazewiecz, J., Ecker, K.H., Schmlidt, G., Weglarcz, J.: Scheduling in computer and manufacturing systems, 2nd edn. Springer, Berlin (1993)

    Book  Google Scholar 

  6. Herroelen, W.: Project Scheduling-Th./Pract. Prod./Op. Manag. 14(4), 413–432 (2006)

    Google Scholar 

  7. Liu, S.S., Wang, C.J.: RCPSP profit max with cash flow. Aut. Const. 17, 966–974 (2008)

    Article  Google Scholar 

  8. Damay, J., Quilliot, A., Sanlaville, E.: Linear programming based algorithms for preemptive and non preemptive RCPSP. EJOR 182(3), 1012–1022 (2007)

    Article  MATH  Google Scholar 

  9. Moukrim, A., Quilliot, A.: Preemptive scheduling on parallel machines. O.R Let. 33, 143–151 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. De Reyck, B., Herroelen, W.: Branch/bound for the RCPSP with generalized precedence relations. EJOR 111, 152–174 (1998)

    Article  MATH  Google Scholar 

  11. Mohring, R.H., Rademacher, F.J.: Scheduling problems with resource duration interactions. Methods of Operat. Research 48, 423–452 (1984)

    Google Scholar 

  12. Kimms, A.: Mathematical programming and financial objectives for scheduling projects, OR and Management Sciences. Kluwer Academic Publisher (2001)

    Google Scholar 

  13. Chtourou, H., Haouari, M.: A two-stage-priority rule based algorithm for robust resource-constrained project scheduling. Computers and Ind. Eng., 12 pages (2008)

    Google Scholar 

  14. Haouari, M., Gharbi, A.: A improved max-flow based lower bound for minimizing maximum lateness on identical parallel machines. OR Letters 31, 49–52 (2003)

    MathSciNet  MATH  Google Scholar 

  15. Carlier, J., Neron, E.: Computing redundant resources for the resource constrained project scheduling problem. EJOR 176, 1452–1463 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hartmann, S., Briskorn, D.: A survey of variants of RCPSP. EJOR 207, 1–14 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kolisch, R., Hartmann, S.: Heuristic for RCPSP: computational analysis. In: Weglarcz, J. (ed.) Project Scheduling: Models and Applications. Kluwer Press (1999)

    Google Scholar 

  18. Demeulemeester, E., Herroelen, W.: New benchmark for mult. RCPSP. Management Sciences 43, 1485–1492 (1997)

    Article  MATH  Google Scholar 

  19. Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource constrained project scheduling problem. EJOR 107, 272–288 (1998)

    Article  MATH  Google Scholar 

  20. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for RCPSP based on a new math. formulation. Manag. Sc. 44, 714–729 (1998)

    Article  MATH  Google Scholar 

  21. Baptiste, P., Demassey, S.: Tight LP-bounds for RCPSP. OR Spect. 2, 251–262 (2004)

    Article  Google Scholar 

  22. Brucker, P., Knust, S.: A linear programming and constraint propagation based lower bound for the RCPSP. EJOR 127, 355–362 (2000)

    Article  MATH  Google Scholar 

  23. Artigues, C., Roubellat, F.: A polynomial activity insertion algorithm in a multiresource schedule with cumulative constraints. EJOR 127(2), 297–316 (2000)

    Article  MATH  Google Scholar 

  24. Artigues, C., Michelon, P., Reusser, S.: Insertion for static/dyn. RCPSP. EJOR 149, 249–267 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  25. Palpant, M., Artigues, C., Michelon, P.: LSSPER: solving RCPSP with large neighbourhood search. Annals of O.R 131(1-4), 237–257 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for the resource con-strained scheduling problem: an update. EJOR 174, 23–37 (2006)

    Article  MATH  Google Scholar 

  27. Ahuja, R.V., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory/Appl., Prentice, N.J (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMOS, UMR CNRS 6158, Bat. ISIMA, Universit BLAISE PASCAL, Campus des Czeaux, BP 125, 63173, Aubiere, France

    Alain Quilliot & Hélène Toussaint

Authors
  1. Alain Quilliot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hélène Toussaint
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alain Quilliot .

Editor information

Editors and Affiliations

  1. , Institute of Information and, Bulgarian Academy of Sciences, Acad. G. Bonchev str. Bl. 25A, Sofia, 1113, Bulgaria

    Stefka Fidanova

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Quilliot, A., Toussaint, H. (2013). Flow Models for Project Scheduling with Transfer Delays and Financial Constraints. In: Fidanova, S. (eds) Recent Advances in Computational Optimization. Studies in Computational Intelligence, vol 470. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00410-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-00410-5_8

  • Publisher Name: Springer, Heidelberg

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

  • Online ISBN: 978-3-319-00410-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation