Cost Optimal Project Scheduling 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.
[1]
W. Verdini,et al.
Nonlinear time/cost tradeoff models in project management
,
1995
.
[2]
Erik Demeulemeester,et al.
Discrete time/cost trade-offs in project scheduling with time-switch constraints
,
2002,
J. Oper. Res. Soc..
[3]
Arne Stolbjerg Drud,et al.
CONOPT - A Large-Scale GRG Code
,
1994,
INFORMS J. Comput..
[4]
N. R. Achuthan,et al.
Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm
,
2001,
Ann. Oper. Res..
[5]
Rolf H. Möhring,et al.
On project scheduling with irregular starting time costs
,
2001,
Oper. Res. Lett..
[6]
Erik Demeulemeester,et al.
New computational results on the discrete time/cost trade-off problem in project networks
,
1998,
J. Oper. Res. Soc..