A Heuristic for Scheduling Payments in project: Two Different Approaches for Contractor and Client

Document Type : Research Article

Authors

Abstract

In this paper, we consider the problem of simultaneously determining the amount, timing and location of progress payments in projects to maximize NPV of the cash flows. Due to the combinatorial nature of the problem, for the first time, we propose an iterative two-stage heuristics where payment scheduling is determined in the first stage ones activities are fixed, and in the second stage activities are rescheduled to improve contractor NPV by fixing the amount and location of payment scheduling. The two stages iterate up to achieve ideal solutions. In the first stage, two objects are considered; maximization of contractor NPV and maximization of client NPV. Two Meta heuristics; genetic algorithm and simulated annealing are designed and the results are compared. By standard test problems with 120 activities, whole performances of the algorithm is considered and effect of model parameters on NPV and completion time for both objective functions is measured. In addition, effect of the second stage on project feasibility and contractor improvement is considered. The result shows that the proposed algorithm is able to achieve non-dominated solutions in consequential iterations.

Keywords

References

[1] Dayanand, N.; Padman, R.; “Payments in projects: a contractor’s model”, Technical Report, The Heinz School, Carnegie Mellon University, Pittsburgh, (1993).
[2] Dayanand, N.; Padman, R.; “On modeling payments in project networks”, Journal of the Operational Research Society, 48, 906–918, 1997.
[3] Dayanand, N.; Padman, R.; “A two stage search heuristic for scheduling payments in projects”, Annals of Operations Research, 102, 197–220, 2001.
[4] Dayanand, N.; Padman, R.; “Project contracts and payment schedules: the client’s problem”, Management Science, 47(12), 1654-1667, 2001.
[5] Grinold, RC.; “The payment scheduling problem”, Naval Research Logistics Quarterly, 19(1) , 123–36, 1972.
[6] Goldberg, D.E.; “Genetic algorithms in search, optimization and machine learning”, Addison-Wesley Publishing Co, 1989.
[7] He, Z.; Xu, Y.; “Multi-mode project payment scheduling problems with bonus–penalty structure”, European Journal of Operational Research (2007), doi:10.1016/j.ejor.2006.07.053.
[8] Holland, J.H.; “Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence”, MIT Press, Cambridge, (2nd edition in 1992) 1975.
[9] Kirkpatrick, S.; Gelatt, Jr.; C.D., Vecchi, M.P.; “Optimizatioin by simulated annealing”, Science 220, 671-680, 1983.
[10] Kolisch, R.; Sprecher, A.; Drexl, A.; “Characterization and generation of a general class of resource-constrained project scheduling problems”, Management Science 41, 1693-1703, 1995.
[11] Mika M.; Waligora G.; Weglarz J.; “Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models”, European Journal of Operational Research 164, 639–668, 2005.
[12] Pollack-Johnson, B.; Liberatore, M.; “Project management software usage and patterns and suggested research directions for future development”, Project Management Journal 29(2), 19–28, 1998.
[13] Russell, AH.; “Cash Flows in networks”, Management Science, 16(5), 357–373,1970.
[14] Talbot, FB.; “Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case”. Management Science, 28(10), 1197–1210, 1982.
[15] Vanhoucke M.; Demeulemeester E.; Herroelen W.; “Progress payments in project scheduling problems”, European Journal of Operational Research, Volume 148, 604-620, 2003.

Files

Share

How to cite

Statistics