Skip to main content
SpringerLink
Log in
Book cover

Handbook on Project Management and Scheduling Vol.1 pp 621–638Cite as

The Discrete Time-Cost Tradeoff Problem with Irregular Starting Time Costs

  • Chapter
  • First Online:

Part of the book series: International Handbooks on Information Systems ((INFOSYS))

Abstract

In this chapter we review the literature on the discrete time-cost tradeoff problem (DTCTP). We then present the four integer programming formulations of a version of DTCTP with irregular starting time costs from Szmerekovsky and Venkateshan (Comp and Oper Res 39(7):1402–1410, 2012). Specifically, the problem is an irregular costs project scheduling problem with time-cost tradeoffs. The empirical tests performed in Szmerekovsky and Venkateshan (Comp and Oper Res 39(7):1402–1410, 2012) are updated using the current version of CPLEX and similar results are found being driven by a reduced number of binary variables, a tighter linear programming relaxation, and the sparsity and embedded network structure of the constraint matrix.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

References

  • Akkan C, Drexl A, Kimms A (2005) Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Oper Res 165(2):339–358

    Article  Google Scholar 

  • Bey RB, Doersch RH, Patterson JH (1981) The net present value criterion: its impact on project scheduling. Proj Manag Q 12(2):35–45

    Google Scholar 

  • Brucker P, Drexl X, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models and methods. Eur J Oper Res 112(1):3–41

    Article  Google Scholar 

  • Crowston WB (1970) Decision CPM: network reduction and solution. Oper Res Q 21:435–452

    Article  Google Scholar 

  • Crowston WB, Thompson GL (1967) Decision CPM: a method for simultaneous planning, scheduling, and control of projects. Oper Res 15:407–426

    Article  Google Scholar 

  • Dayanand N, Padman R (1998) On payment schedules in client-contractor negotiations in projects: an overview of the problem and research issues. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer Academic, Boston

    Google Scholar 

  • Dayanand N, Padman R (2001) Project contracts and payment schedules: the client’s problem. Manag Sci 47(12):1654–1667

    Article  Google Scholar 

  • De P, Dunne EJ, Ghosh JB, Wells CE (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81(2):225–238

    Article  Google Scholar 

  • De P, Dunne EJ, Ghosh JB, Wells CE (1997) Complexity of the discrete time-cost tradeoff problem for project networks. Oper Res 45(2):302–306

    Article  Google Scholar 

  • Deinko VG, Woeginger GJ (2001) Hardness of the approximation of the discrete time-cost tradeoff problem. Oper Res Lett 29:207–210

    Article  Google Scholar 

  • Demeulemeester EL, Herroelen W (2002) Project scheduling: a research handbook. Kluwer Academic, Boston

    Google Scholar 

  • Demeulemeester EL, Herroelen WS, Elmaghraby SE (1996) New computational results on the discrete time/cost tradeoff problem in project networks. Eur J Oper Res 88(1):50–68

    Article  Google Scholar 

  • Demeulemeester EL, De Reyck B, Foubert B, Herroelen WS, Vanhoucke M (1998) Optimal procedures for the discrete time/cost tradeoff problem in project networks. J Oper Res Soc 49(11):1153–1163

    Article  Google Scholar 

  • Drezet L-E (2008) RCPSP with financial costs. In: Artigues C, Demassey S, Néron E (eds) Resource-constrained project scheduling: models, algorithms, extensions and applications, Chap. 14 Wiley, Hoboken

    Google Scholar 

  • Goldratt EM (1997) Critical chain. North River Press, Great Barrington

    Google Scholar 

  • Grigoriev A, Woeginger GJ (2004) Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Inform 41(2/3):83–97

    Article  Google Scholar 

  • Hadjiconstantinou E, Klerides E (2010) A new path-based cutting plane approach for the discrete time-cost tradeoff problem. Comput Manag Sci 7:313–336

    Article  Google Scholar 

  • Hafizoğlu AB, Azizoğlu M (2010) Linear programming based approaches for the discrete time/cost trade-off problem in project networks. J Oper Res Soc 61(4):676–685

    Article  Google Scholar 

  • Harvey RT, Patterson JH (1979) An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Found Contr Eng 4:107–117

    Google Scholar 

  • Hindelang TJ, Muth JF (1979) A dynamic programming algorithm for decision CPM networks. Oper Res 27:225–241

    Article  Google Scholar 

  • Hochbaum DS (2004) Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today. Manag Sci 50(6):709–723

    Article  Google Scholar 

  • Icmeli O, Erenguc SS, Zappe CJ (1993) Project scheduling problem: a survey. Int J Oper Prod Man 13(11):80–91

    Article  Google Scholar 

  • Kolisch R, Sprecher A (1996) PSPLIB: a project scheduling problem library. Eur J Oper Res 96(1):205–216

    Article  Google Scholar 

  • Meyer WL, Shaffer LR (1965) Extending CPM for multiform project time-cost curves. J Constr Div-ASCE 91:45–65

    Google Scholar 

  • Möhring RH, Schulz AS, Stork F, Uetz M (2001) On project scheduling with irregular starting time costs. Oper Res Lett 28(4):149–154

    Article  Google Scholar 

  • Möhring RH, Schulz AS, Stork F, Uetz M (2003) Solving project scheduling problems by minimum cut computations. Manag Sci 49(3):330–350

    Article  Google Scholar 

  • Panagiotakopoulos D (1977) A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15:183–195

    Google Scholar 

  • Russell AH (1970) Cash flows in networks. Manag Sci 16(5):357–373

    Article  Google Scholar 

  • Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23:992–1020

    Article  Google Scholar 

  • Szmerekovsky JG (2005) The impact of contractor behavior on the client’s payment scheduling problem. Manag Sci 51(4):629–640

    Article  Google Scholar 

  • Szmerekovsky JG, Vairaktarakis G (2006) Maximizing project cash availability. Nav Res Log 53(4):272–284

    Article  Google Scholar 

  • Szmerekovsky JG, Venkateshan P (2012) An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs. Comp and Oper Res 39(7):1402–1410

    Article  Google Scholar 

  • Ulusoy G, Cebelli S (2000) An equitable approach to the payment scheduling problem in project management. Eur J Oper Res 127(2):262–278

    Article  Google Scholar 

  • Vanhoucke M, Debels D (2007) The discrete time-cost tradeoff problem: extensions and heuristic procedures. J Sched 10:311–326

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business, North Dakota State University Fargo, Fargo, ND, USA

    Joseph G. Szmerekovsky

  2. Indian Institute of Management, Ahmedabad, India

    Prahalad Venkateshan

Authors
  1. Joseph G. Szmerekovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prahalad Venkateshan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph G. Szmerekovsky .

Editor information

Editors and Affiliations

  1. Institute of Management and Economics, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Christoph Schwindt

  2. Institute of Management and Economics, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Jürgen Zimmermann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Szmerekovsky, J.G., Venkateshan, P. (2015). The Discrete Time-Cost Tradeoff Problem with Irregular Starting Time Costs. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_29

Download citation

Publish with us

Policies and ethics

Search

Navigation