Experimental Design for Genetic Algorithm Simulated Annealing for Time Cost Trade-off Problems
Abstract
Keywords
References
- [1] Panagiotakopoulos, D., (1977), “A CPM time-cost computational algorithm for arbitrary activity cost functions”, INFOR 15, 183 – 195.
- [2] Schwarze, J., (1980), “An algorithm for hierarchial reduction and decomposition of a direct graph”, Computing 25, 47 – 57.
- [3] Barber T. J., and Boardman J. T. (1988), “Knowledge –Based Project Control Employing Heuristic Optimisation”. IEE Proceedings, 135(8): 529 – 538.
- [4] Chiu Y.S. P. and Chiu S. W., (2005), “Incorporating expedited time and cost of the end product into the product structure diagram”, International Journal of Machine Tools & Manufacture Vol: 45 pp. 987 – 991.
- [5] Vanhoucke M., and Debels D., (2007), “The Discrete Time/Cost Trade off Problem: Extensions and Heuristic Procedures”. J Sched (2007) 10: 311 – 326.
- [6] Vanhoucke M. and Debels D., (2005), “The discrete time/cost trade-off problem under various assumptions exact and heuristic procedures”, working paper, Ghent University, Belgium.
- [7] Vanhoucke M., (2005), “New computational results fort he discrete time/cost trade-off problem with time-switch constraints”, European Journal of Operational Research, vol. 165 pp. 359 – 374.
- [8] Pathak B. K., Srivastava S., and Srivastava K., (2008), “Neural network embedded multiobjective genetic algorithm to solve non-linear time-cost tradeoff problems of Project scheduling”, Journal of Scientific & Industrial Research, vol. 67, pp. 124 – 131.
Details
Primary Language
English
Subjects
-
Journal Section
-
Authors
Ö.h. Bettemir
This is me
Publication Date
March 1, 2011
Submission Date
March 1, 2011
Acceptance Date
-
Published in Issue
Year 2011 Volume: 3 Number: 1