Abstract
Project schedules, which are the basic components of project plans, specify when activities are to be performed and constitute the basis for allocating the resources to activities. In this chapter we use mathematical modeling to formulate and solve scheduling problems for single and multiple project settings. In this framework, we relax the resource constraints, and assume all problem parameters are known with certainty. To introduce the basic deterministic scheduling models we discuss the critical path method, defining the different types of slacks presenting algorithms to calculate them. Mathematical models to optimize financial objectives are presented. Finally, a case study is given where a work breakdown structure is created, and a baseline schedule is constructed for a real-life problem.
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
Bellman, R. E. (1952). On the theory of dynamic programming. Proceedings of the National Academy of Sciences, 38, 716–719.
Denardo, E. V. (1982). Dynamic programming models and applications. New Jersey: Prentice Hall, Inc.
Elmaghraby, S. (2000). On criticality and sensitivity in activity network. European Journal of Operational Research, 127(2), 220–238.
Etgar, R. & Shtub, A. (1999). Scheduling projects to maximize net present value — the case of linear time-dependent cash flows. International Journal of Production Research, 37(2), 329–339.
Etgar, R., Shtub, A., & LeBlanc, L.J. (1996). Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows. European Journal of Operational Research, 96(1), 90–96.
Garfinkel, R. S. & Nemhauser, G. L. (1972). Integer programming. New York: John Wiley and Sons, Inc.
Goldratt, E. M. (1997). The critical chain, Mass: The North River Press.
Habibi, F., Barzinpour, F., & Sadjadi, S. J. (2019). A mathematical model for project scheduling and material ordering problem with sustainability considerations: A case study in Iran. Computers & Industrial Engineering, 128, 690–710.
Hall, N. G. (2016). Research and teaching opportunities in project management. In Optimization Challenges in Complex, Networked, and Risky Systems, INFORMS, 329–388.
Hazır, Ö., Kilic, O. A., Tunc, H. (2016). A dynamic programming model for project scheduling under financial risks. 15th International Conference on Project Management and Scheduling (PMS2016), Valencia, Spain, 239–242.
Kelley, J. E., Jr (1961). Critical path planning and scheduling: Mathematical basis. Operations Research, 9, 296–321.
Kelley, J. E. Jr. (1963). The critical-path method: Resources planning and scheduling. In: Muth, J. F. & G. L. Thompson (Eds.), Industrial scheduling (pp. 347–365). New Jersey: Prentice Hall, Inc.
Kelley, E. J. Jr & Walker, M. R. (1959). Critical-path planning and scheduling. In Proceedings Eastern Joint Computer Conference, Boston, 1–3 December, 160–173.
Nahmias, S. (2009). Production and operations analysis (6th ed.). New York: McGraw Hill Education.
Park, C. S. (2007). Contemporary engineering economics (4th ed.). Pearson Prentice Hall: Pearson Education.
Shtub, A., Etgar, R., & LeBlanc, L. J. (1996). Scheduling projects to maximize net present value- the case of time dependent, contingent cash flows. European Journal of Operational Research, 96, 90–96.
Shtub, A. & Etgar, R. (1997). A branch-and-bound algorithm for scheduling projects to maximize net present value: the case of time dependent, contingent cash flows. International Journal of Production Research, 35(12), 3367–3378.
Smith-Daniels, D. E. (1986). Summary measures for predicting the net present value of a project. Minnesota: Working Paper, College of St. Thomas, St Paul.
Vanhoucke (2000). Exact algorithms for various types of project scheduling problems: Non-regular objectives and time/cost trade-offs. PhD Dissertation, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium.
Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2001). Maximizing the net present value of a project with linear time-dependent cash flows. International Journal of Production Research, 39(14), 3159–3181.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ulusoy, G., Hazır, Ö. (2021). Deterministic Project Scheduling with No Resource Constraints. In: An Introduction to Project Modeling and Planning. Springer Texts in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-030-61423-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-61423-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61422-5
Online ISBN: 978-3-030-61423-2
eBook Packages: Business and ManagementBusiness and Management (R0)