Abstract
In project management, the duration of the job is determined by the man-hour and resources inputted to the job. The duration can be shortened by increasing the amount of additional resources input. The cost increases according to the input of the resource. This problem is referred to as the Time/Cost Trade-off Problem (TCTP). In this study, the relation between time and cost is represented by an inverse proportional curve. We present a solution to the Stochastic Discrete TCTP-Curve (SDTCTP-C) in which the duration of the job is defined as a random variable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brooks Jr, F.P.: The Mythical Man-Month: Essays on Software Engineering, Anniversary Edition, 2nd edn. Addison-Wesley Professional, Boston (1995)
Deǧirmenci, G., Azizoǧlu, M.: Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem. J. Oper. Res. Soc. 64, 1474–1484 (2013)
Hazir, Ö., Haouari, M., Erel, E.: Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version. Comput. Oper. Res. 37, 649–655 (2010)
Hazir, Ö., Erel, E., Günalay, Y.: Robust optimization models for the discrete time/cost trade-off problem. Int. J. Prod. Econ 130, 87–95 (2011)
Jeang, A.: Project management for uncertainty with multiple objectives optimisation of time,cost and reliability. Int. J. Prod. Res. 53(5), 1503–1526 (2015)
Zhu, G., Bard, J.F., Yu, G.: A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Sched. 10, 167–180 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kitamura, T., Shiina, T. (2019). Solution Algorithm for Time/Cost Trade-off Stochastic Project Scheduling Problem. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_58
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_58
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)