Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 649-655

  Hazir, Öncü ^a,b   Haouari, Mohamed ^c,d   Erel, Erdal ^b  

^a CANKAYA UNIVERSITY   (Turkey)

^b BILKENT UNIVERSITY   (Turkey)

^c OZYEGIN UNIVERSITY   (Turkey)

^d KING SAUD UNIVERSITY   (Saudi Arabia)

Author keywords

Benders Decomposition; Project scheduling; Time cost trade off

Indexed keywords

BENDERS DECOMPOSITION; COMPUTATIONAL RESULTS; EXACT ALGORITHMS; MULTIMODES; OPTIMALITY; PRECEDENCE CONSTRAINTS; PROJECT SCHEDULING; PROJECT SCHEDULING PROBLEM; SOLUTION ALGORITHMS; TIME/COST TRADE-OFF; TIME/COST TRADE-OFF PROBLEM; TOTAL COMPLETION TIME;

ALGORITHMS; COMMERCE;

BUDGET CONTROL;

EID: 70350566565     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.009     Document Type: Article

References (21)

1. De P., Dunne E.J., Ghosh J.B., and Wells C.E. Complexity of the discrete time/cost trade-off problem for project networks. Operations Research 45 (1997) 302-306
2. De P., Dunne E.J., Ghosh J.B., and Wells C.E. The discrete time/cost trade-off problem revisited. European Journal of Operational Research 81 (1995) 225-238
3. Robinson D.R. A dynamic programming solution to the cost-time trade off for CPM. Management Science 22 (1975) 158-166
4. Demeulemeester E., Herroelen W., and Elmaghraby S.E. Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research 88 (1996) 50-68
5. Skutella M. Approximation algorithms for the discrete time-cost trade-off problem. Mathematics of Operations Research 23 (1998) 195-203
6. Hindelang T.J., and Muth J.F. Dynamic programming algorithm for decision CPM networks. Operations Research 27 (1979) 225-241
7. 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
8. Akkan C., Drexl A., and Kimms A. Network decomposition-based benchmark results for the discrete time-cost trade-off problem. European Journal of Operational Research 165 (2005) 339-358
9. Vanhoucke M., and Debels D. The discrete time/cost trade-off problem under various assumptions exact and heuristic procedures. Journal of Scheduling 10 (2007) 311-326
10. Benders J.F. Partitioning procedures for solving mixed variables programming problems. Numerische Mathematic 4 (1962) 238-252
11. Costa A.M. A survey on benders decomposition applied to fixed charge network design problems. Computers and Operations Research 32 (2005) 1429-1450
12. Maniezzo V., and Mingozzi A. A Heuriic Ocedure for the multi-mode project scheduling problem based on Bender's decomposition. In: Weglarz J. (Ed). Project scheduling-recent models, algorithms and applications (1999), Kluwer Academic Publishers, Boston 179-196
13. Erenguc 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 Quarterly 40 (1993) 25-50
14. Kuyumcu A., and Garcia-Diaz A. A decomposition approach to project compression with concave activity cost functions. IIE Transactions 26 6 (1994) 63-73
15. Magnanti T.L., and Wong R.T. Accelerating benders decomposition algorithmic enhancement and model selection criteria. Operations Research 29 (1981) 464-484
16. Rei W., Cordeau J.F., Gendreau M., and Soriano P. Accelerating benders decomposition by local branching. INFORMS Journal on Computing 19 (2007) 534-541
17. Yen J.Y. Finding the K shortest loopless paths in a network. Management Science 17 (1971) 712-716
18. McDaniel D., and Devine M. A modified Benders' partitioning algorithm for mixed integer programming. Management Science 24 (1977) 312-379
19. Linderoth J., and Savelsbergh M.W.P. A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing 11 (1999) 173-187
20. Bein W.W., Kamburowski J., and Stallmann M.F.M. Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal on Computing 21 (1992) 1112-1129
21. Pascoe T.L. Allocation of resources-CPM. Revue Française de Recherche Opérationelle 38 (1966) 31-38