Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows

In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. Applications of two local search metaheuristics - simulated annealing and tabu search are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.

[1]  Grzegorz Waligóra,et al.  Discrete-continuous project scheduling - models and algorithms , 2008 .

[2]  Salah E. Elmaghraby.  Mathematical Programming and Financial Objectives for Scheduling Projects , 2005, J. Sched..

[3]  Jan Węglarz,et al.  On a methodology for discrete-continuous scheduling , 1998, Eur. J. Oper. Res..

[4]  Grzegorz Waligóra,et al.  Project scheduling with finite or infinite number of activity processing modes - A survey , 2011, Eur. J. Oper. Res..

[5]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[6]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[7]  Grzegorz Waligóra,et al.  Discrete-continuous project scheduling with discounted cash flows - A tabu search approach , 2008, Comput. Oper. Res..

[8]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[9]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[10]  Erik Demeulemeester,et al.  Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..

[11]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[12]  Laure‐Emmanuelle Drezet,et al.  RCPSP with financial costs , 2010 .

[13]  Grzegorz Waligóra,et al.  Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models , 2005, Eur. J. Oper. Res..