Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17515
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVenkateshan, Prahalad
dc.contributor.authorSzmerekovsky, J. V.
dc.date.accessioned2016-02-23T10:45:57Z
dc.date.available2016-02-23T10:45:57Z
dc.date.copyright2015
dc.date.issued2015
dc.identifier.citationVenkateshan, P. & Szmerekovsky, J. V. (2015). The discrete time-cost trade off problem with irregular starting time costs. In C Schwindt & J. Zimmermann (Eds.), Handbook on project management and scheduling (pp. 621-638). London: Springer International Publishing.en_US
dc.identifier.isbn9783319054438
dc.identifier.urihttp://hdl.handle.net/11718/17515
dc.description.abstractIn 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 test 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.en_US
dc.language.isoenen_US
dc.publisherSpringer International Publishing.en_US
dc.subjectDiscrete Time-Cost Tradeoffen_US
dc.subjectInteger Linear Programming Formulationsen_US
dc.subjectProject Schedulingen_US
dc.subjectPayment Schedulesen_US
dc.titleThe discrete time-cost trade off problem with irregular starting time costsen_US
dc.typeBook chapteren_US
Appears in Collections:Book Chapters

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.