Simulated annealing and tabu search for multi-mode project payment scheduling

European Journal of Operational Research

Volumn 198, Issue 3, 2009, Pages 688-696

  He, Zhengwen ^a   Wang, Nengmin ^a   Jia, Tao ^a   Xu, Yu ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Net present value; Progress payments; Project scheduling; Simulated annealing; Tabu search

Indexed keywords

BASIC MODELS; COMPUTATIONAL EXPERIMENTS; DATA SETS; DISCRETE MODES; DISCRETE TIME-COST TRADEOFF PROBLEMS; EVENT-BASED METHODS; ITERATIVE IMPROVEMENTS; KEY PARAMETERS; MULTI MODES; MULTI STARTS; NET PRESENT VALUE; NP HARDNESS; PAYMENT-SCHEDULING PROBLEMS; PROGRESS PAYMENTS; PROJECT SCHEDULING; RANDOM SAMPLINGS;

ANNEALING; CONTRACTORS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PORTALS; SCHEDULING; SCHEDULING ALGORITHMS; TABU SEARCH;

SIMULATED ANNEALING;

EID: 64049109482     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.10.005     Document Type: Article

References (73)

1. Akkan C., Drexl A., and Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165 2 (2005) 339-358
2. Baroum S.M., and Patterson J.H. The development of cash flow weight procedures for maximizing the net present value of a project. Journal of Operations Management 14 (1996) 209-227
3. Bey R., Doersch R., and Patterson J. The present value criterion: Its impact on project scheduling. Project Management Quarterly 12 2 (1981) 35-45
4. Billstein N., and Radermacher F.J. Time-cost optimization. Methods of Operations Research 27 (1977) 274-294
5. Boctor F.F. Resource-constrained project scheduling by simulated annealing. International Journal of Production Research 34 8 (1996) 2335-2351
6. Bouleimen K., and Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149 2 (2003) 268-281
7. Burak K., and Canan S. Project scheduling with discounted cash flows and progress payments. Journal of the Operational Research Society 47 10 (1996) 1262-1272
8. Cho J.H., and Kim Y.D. Simulated annealing algorithm for resource constrained project scheduling problems. Journal of the Operational Research Society 48 7 (1997) 736-744
9. Crowston W. Network reduction and solution. Operations Research Quarterly 21 (1970) 435-450
10. Crowston W., and Thompson G.L. Decision CPM: A method for simultaneous planning, scheduling and control of projects. Operations Research 15 (1967) 407-426
11. Dayanand N., and Padman R. On modeling progress payments in project networks. Journal of the Operational Research Society 48 9 (1997) 906-918
12. Dayanand N., and Padman R. A two stage search heuristic for scheduling payments in projects. Annals of Operation Research 102 1 (2001) 197-220
13. Dayanand N., and Padman R. Project contracts and payments schedules: The client's problem. Management Science 47 12 (2001) 1654-1667
14. De P., Dunne E.J., Ghosh J.B., and Wells C.E. The discrete time-cost tradeoff problem revisited. European Journal of Operational Research 81 (1995) 225-238
15. De P., Dunne E.J., Ghosh J.B., and Wells C.E. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45 2 (1997) 302-306
16. Demeulemeester E., Elmaghraby S.E., and Herroelen W. Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research 88 (1996) 50-68
17. Demeulemeester E., De Reyck B., Foubert B., Herroelen W., and Vanhoucke M. New computational results for the discrete time/cost trade-off problem in project networks. Journal of the Operational Research Society 49 (1998) 1153-1163
18. De Reyck B., and Herroelen W. An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research 25 (1998) 1-17
19. Doersch R.H., and Patterson J.H. Scheduling a project to maximize its present value: A zero-one programming approach. Management Science 23 (1977) 882-889
20. Elmaghraby S.E., and Herroelen W.S. The scheduling of activities to maximize the net present value of projects. European Journal of Operational Research 49 (1990) 35-49
21. Elmaghraby S.E., and Kamburowski J. The analysis of activity networks under generalized precedence relations. Management Science 38 (1992) 1245-1263
22. Erengüc S.S., Tufekci S., and Zappe C.J. Solving time/cost trade-off problems with discounted cash flows using generalized Benders decomposition. Naval Research Logistics 40 (1993) 25-50
23. Etgar R. Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows. International Journal of Production Research 37 2 (1999) 329-339
24. Grinold R.C. The payment scheduling problem. Naval Research Logistics Quarterly 19 1 (1972) 123-136
25. He Z., and Xu Y. Multi-mode project payment scheduling problems with bonus-penalty structure. European Journal of Operational Research 189 3 (2008) 1191-1207
26. Herroelen W., and Gallens E. Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects. European Journal of Operational Research 65 (1993) 274-277
27. Herroelen W.S., Dommelen P., and Demeulemeester E.L. Project network models with discounted cash flows: A guided tour through recent developments. European Journal of Operational Research 100 (1997) 97-121
28. Hindelang T.J., and Muth J.F. A dynamic programming algorithm for decision CPM networks. Operations Research 27 (1979) 225-241
29. Icmeli O., and Erengüc S.S. A tabu search procedure for resource constrained project schedule to improve project scheduling problems with discounted cash flows. Computers and Operations Research 21 (1994) 841-853
30. Icmeli O., and Erengüc S.S. A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Science 42 (1996) 1395-1408
31. Kimms A. Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds. Annals of Operations Research 102 (2001) 221-236
32. Kolisch R., and Sprecher A. PSPLIB - a project scheduling problem library. European Journal of Operational Research 96 (1996) 205-216
33. Kolisch R., Sprecher A., and Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41 (1995) 1693-1703
34. Lambrechts O., Demeulemeester E., and Herroelen W. A tabu search procedure for developing robust predictive project schedules. International Journal of Production Economics 111 2 (2008) 493-508
35. Mika M., Waligóra G., and We{ogonek}glarz 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 (2005) 639-668
36. Mika M., Waligóra G., and We{ogonek}glarz J. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research 187 3 (2008) 1238-1250
37. Neumann K., and Zimmermann J. Procedures for resource levelling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research 127 (2000) 425-443
38. Neumann K., Schwindt C., and Zimmermann J. Order-based neighborhoods for project scheduling with nonregular objective functions. European Journal of Operational Research 149 (2003) 325-343
39. Özdamar L., Ulusoy G., and Bayyigit M. A heuristic treatment of tardiness and net present value criteria in resource constrained project scheduling. International Journal of Physical Distribution & Logistics Management 28 9 (1998) 805-824
40. Padman R., and Smith-Daniels D. Early tardy cost trade offs in resource constrained projects with cash flows: An optimization-guided heuristic approach. European Journal of Operational Research 64 2 (1993) 295-311
41. Padman R., Smith-Daniels D.E., and Smith-Daniels V.L. Heuristic scheduling of resource-constrained projects with cash flows. Naval Research Logistics 44 (1997) 365-381
42. Pan N.H., Hsaio P.W., and Chen K.Y. A study of project scheduling optimization using Tabu Search algorithm. Engineering Applications of Artificial Intelligence 21 7 (2008) 1101-1112
43. Patterson J.H., and Harvey R.T. An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Foundations of Control Engineering 6 (1979) 107-117
44. Patterson J.H., Talbot F.B., Slowinski R., and Weglarz J. Computation experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems. European Journal of Operational Research 49 (1990) 68-79
45. Pinder J.P., and Marucheck A.S. Using discounted cash flow heuristics to improve project net present value. Journal of Operations Management 14 (1996) 229-240
46. Ranjbar M., De Reyck B., and Kianfar F. A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research 193 (2009) 35-48
47. Robinson D.R. A dynamic programming solution to cost/time trade-off for CPM. Management Science 22 (1975) 158-166
48. Russell A.H. Cash flows in networks. Management Science 16 5 (1970) 357-373
49. Russell R.A. A comparison of heuristics for scheduling projects with cash flows and resource restrictions. Management Science 32 (1986) 291-300
50. Schwindt C., and Zimmermann J. A steepest ascent approach to maximizing the net present value of projects. Mathematical Methods of Operations Research 53 (2001) 435-450
51. Shtub A., and Etgar R. 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 (1997) 3367-3378
52. Shtub A., LeBlanc L.J., and Cai Z. Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm. European Journal of Operational Research 88 1 (1996) 124-138
53. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA Journal of Computing 2 (1990) 33-45
54. Skutella M. Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23 (1998) 909-929
55. Smith-Daniels D.E., and Aquilano N.J. Using a late-start resource-constrained project schedule to improve project net present value. Decision Sciences 18 (1987) 617-630
56. Smith-Daniels D.E., and Smith-Daniels V.L. Maximizing the net present value of a project subject to materials and capital constraints. Journal of Operations Management 7 (1987) 33-45
57. Smith-Daniels D.E., Padman R., and Smith-Daniels V.L. Heuristic scheduling of capital constrained projects. Journal of Operations Management 14 (1996) 241-254
58. Szmereskovsky J.G. The impact of contractor behaviour on the client's payment scheduling problem. Management Science 51 (2005) 629-640
59. Tareghian H.R., and Taheri S.H. On the discrete time, cost and quality trade-off problem. Applied Mathematics and Computation 181 2 (2006) 1305-1312
60. Tsai Y.W., and Gemmill D.D. Using tabu search to schedule activities of stochastic resource-constrained projects. European Journal of Operational Research 111 1 (1998) 129-141
61. Ulusoy G., and Cebelli S. An equitable approach to the payment scheduling problem in project management. European Journal of Operational Research 127 (2000) 262-278
62. Ulusoy G., and Özdamar L. A heuristic scheduling algorithm for improving the duration and net present value of a project. International Journal of Operations and Production Management 15 (1995) 89-98
63. Ulusoy G., Funda S., and Sahin S. Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Annals of Operation Research 102 1 (2001) 237-261
64. Vanhoucke, M., 2004. Exact and heuristic procedures for the discrete time/cost trade-off problem under various assumptions. EURO/INFORMS Rhodes Meeting. Greece, 4-7 July.
65. Vanhoucke M. New computational results for the discrete time/cost trade-off problem with time-switch constraints. European Journal of Operational Research 165 2 (2005) 359-374
66. Vanhoucke M., Demeulemeester E., and Herroelen W. Maximizing the net present value of a project with linear time-dependent cash flows. International Journal of Production Research 39 (2001) 3159-3181
67. Vanhoucke M., Demeulemeester E., and Herroelen W. On maximizing the net present value of a project under renewable resource constraints. Management Science 47 (2001) 1113-1121
68. Vanhoucke M., Demeulemeester E., and Herroelen W. Progress payments in project scheduling problems. European Journal of Operational Research 148 (2003) 604-620
69. Waligóra G. Discrete-continuous project scheduling with discounted cash flows - a tabu search approach. Computers and Operations Research 35 (2008) 2141-2153
70. Yang K.K., Talbot F.B., and Patterson J.H. Scheduling a project to maximize its net present value: An integer programming approach. European Journal of Operational Research 64 (1992) 188-198
71. Yang K.K., Tay L.C., and Sum C.C. A comparison of stochastic scheduling rules for maximizing project net present value. European Journal of Operational Research 85 (1995) 327-339
72. Zhu D., and Padman R. Connectionist approaches for solver selection in constrained project scheduling. Annals of Operations Research 72 (1997) 265-298
73. Zhu D., and Padman R. A metaheuristic scheduling procedure for resource-constrained projects with cash flows. Naval Research Logistics 46 (1999) 912-927