The Discrete Time-Cost Tradeoff Problem with Irregular Starting Time Costs
Joseph G. Szmerekovsky () and
Prahalad Venkateshan ()
Additional contact information
Joseph G. Szmerekovsky: College of Business, North Dakota State University Fargo
Prahalad Venkateshan: Indian Institute of Management
Chapter Chapter 29 in Handbook on Project Management and Scheduling Vol.1, 2015, pp 621-638 from Springer
Abstract:
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.
Keywords: Discrete time-cost tradeoff; Integer linear programming formulations; Payment schedules; Project scheduling (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-319-05443-8_29
Ordering information: This item can be ordered from
http://www.springer.com/9783319054438
DOI: 10.1007/978-3-319-05443-8_29
Access Statistics for this chapter
More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().