Cost Optimal Project Scheduling

• Authors: Uroš Klanšek , Mirko Pšunder
• Languages of publication: EN

Abstracts

EN

This paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP. The nonlinear total project cost objective function is subjected to the rigorous system of the activity precedence relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.

Keywords

EN

project management; scheduling; optimization; nonlinear programming; NLP

• Publisher: Sciendo
• Journal: Organizacija
• Year: 2008
• Volume: 41
• Issue: 4
• Pages: 153-158

Dates

published

2008-07-01

online

2008-12-12

Contributors

author

Uroš Klanšek

• Faculty of Civil Engineering, University of Maribor, Smetanova 17, 2000 Maribor

author

Mirko Pšunder

• Faculty of Civil Engineering, University of Maribor, Smetanova 17, 2000 Maribor

References

• Achuthan, N. R. & Hardjawidjaja, A. (2001). Project scheduling under time dependent costs - a branch and bound algorithm, Annals of Operations Research, 108: 55-74.[Crossref]
• Brooke, A., Kendrick, D. & Meeraus, A., (1988). GAMS - A User's Guide, Scientific Press, Redwood City.
• Deckro, R. F., Herbert, J. E., Verdini, W. A., Grimsrud, P. E. & Venkateshwar, S. (1995). Nonlinear time/cost trade-off models in project management, Computers & Industrial Engineering, 28(2): 219-229.[Crossref]
• Demeulemeester, E., De Reyck, B., Foubert, B., Herroelen, W. & Vanhoucke, M., (1998). New computational results on the discrete time/cost trade-off problem in project networks, Journal of the Operational Research Society, 49(11): 1153-1163.[WoS]
• Drud, A. S. (1994). CONOPT - A Large-Scale GRG Code, ORSA Journal on Computing, 6(2): 207-216.[Crossref]
• Möhring, R. H., Schulz, A. S., Stork, F. & Uetz, M. (2001). On project scheduling with irregular starting time costs, Operations Research Letters, 28(4): 149-154.[Crossref]
• Pšunder, M. & Rebolj, D. (1991). Prozesssynchrone kostenund terminplanung von baupojekten, Wirtschaftsingenieur, 23(3): 22-25.
• Vanhoucke, M., Demeulemeester, E., Herroelen & W. (2002). Discrete time/cost trade-offs in project scheduling with time-switch constraints, Journal of the Operational Research Society, 53(7): 741-751.[Crossref]
• AMPL. Available from:
• CONOPT. Available from:
• GAMS. Available from:
• KNITRO. Available from:
• LANCELOT. Available from:
• LINGO. Available from:
• MINOS. Available from:
• MPL. Available from:
• MS Excel Sover. Available from:
• NPSOL. Available from:
• What'sBest. Available from:

Identifiers

DOI

10.2478/v10051-008-0017-3