Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

Yugoslav Journal of Operations Research

Volumn 19, Issue 2, 2009, Pages 281-298

  Stanimirović, Ivan ^a   Petković, Marko ^a   Stanimirović, Predrag ^a   Ćirić, Miroslav ^a  

^a UNIVERSITY OF NI   (Serbia)

Author keywords

DELPHI; Dynamic programming; Knapsack problem; Resource scheduling

Indexed keywords

EID: 84880812581     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/yjor0902281s     Document Type: Article

References (15)

1. Bellman, R., Dynamic Programming, Princeton University Press, 1957.
2. Borgwardt, K.H., and Brzank, J., "Average saving effects in enumerative methods for solving kκnapsack problems", Journal of Complexity, 10 (1994) 129-141.
3. Cormen, T. H., Leiserson, C. E., and Rivest, R. L., Introduction to Algorithms, MIT Press & McGraw-Hill, 1990.
4. Osgood, N., Simulation and Resource Simulation and Resource- Based Scheduling, Presentation, 2004.
5. Petrić, J., Operations Research, Savremena Administracija, Beograd, 1983. (In Serbian)
6. Patterson, J.H., "A comparison of exact approaches for solving the multiple constrained resource project scheduling problem", Management Science, 30 (7) (1984) 854-867.
7. Davies, E.M., "An experimental investigation of resource allocation in multiactivity projects", Operational Research Quarterly, 24 (11) (1976) 1186-1194.
8. Feo, T., and Resende, M.G.C., "Greedy randomized adaptive search procedures", Journal of Global Optimization, 6 (1995) 109-134.
9. Kochetov, Y., and Stolyar, A., "Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem", in: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies, Russia, 2003.
10. Lawrence, S.R., "A computational comparison of heuristic scheduling techniques", Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, 1985.
11. Pitsoulis, L.S., and Resende, M.G.C., "Greedy randomized adaptive search procedures", AT&T Labs Research Technical Report, January 18, 2001.
12. Sedgewick, R., Algorithms, Addison-Wesley publishing company, Massachusetts, Menlo Park, California, London, Amsterdam, Don Mills, Ontario, Sydney, 1984.
13. Valls, V., Balletin, F., and Quintanilla, S., "A population-based approach to the resourceconstrained project scheduling problem", Technical report 10-2001, University of Valencia, 2001.
14. Valls, V., Balletin, F., and Quintanilla, S., "A population-based approach to the resourceconstrained project scheduling problem", Annals of Operations Research, 131 (2004) 305-324.
15. Verma, S., "An optimal breadth-first algorithm for the preemptive resource-constrained project scheduling problem", Second World Conference on POM and 15th Annual POM Conference, Cancun, Mexico, April 30 - May 3, 2004.