| dc.contributor.author | Venkateshan, Prahalad | |
| dc.contributor.author | Szmerekovsky, J. V. | |
| dc.date.accessioned | 2016-02-23T10:45:57Z | |
| dc.date.available | 2016-02-23T10:45:57Z | |
| dc.date.copyright | 2015 | |
| dc.date.issued | 2015 | |
| dc.identifier.citation | Venkateshan, 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.isbn | 9783319054438 | |
| dc.identifier.uri | http://hdl.handle.net/11718/17515 | |
| dc.description.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 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.iso | en | en_US |
| dc.publisher | Springer International Publishing. | en_US |
| dc.subject | Discrete Time-Cost Tradeoff | en_US |
| dc.subject | Integer Linear Programming Formulations | en_US |
| dc.subject | Project Scheduling | en_US |
| dc.subject | Payment Schedules | en_US |
| dc.title | The discrete time-cost trade off problem with irregular starting time costs | en_US |
| dc.type | Book chapter | en_US |
