A multiple-tree search procedure for the resource-constrained project scheduling problem

European Journal of Operational Research

Volumn 89, Issue 3, 1996, Pages 525-542

  Simpson III, Wendell P ^a,c   Patterson, James H ^b  

^a AIR FORCE INSTITUTE OF TECHNOLOGY   (United States)

^b INDIANA UNIVERSITY   (United States)

^c TOC Center   (United States)

Author keywords

Parallel algorithms; Project management; Project scheduling

Indexed keywords

OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROJECT MANAGEMENT; TREES (MATHEMATICS);

MODULAR MULTIPLE TREE SEARCH PROCEDURE; PROJECT SCHEDULING;

SCHEDULING;

EID: 0030105481     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00247-9     Document Type: Article

References (17)

1. Alvarez-Valdes, R., and Tamarit, J.M. (1989), "Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis", in: R. Slowinski and J. Weglarz (eds.), Advances in Project Scheduling, Studies in Production and Engineering Economics 9, Elsevier, Amsterdam, 113-134.
2. Christofides, N., Alvarez-Valdes, R., and Tamarit, J.M. (1987), "Project scheduling with resource constraints: A branch and bound approach", European Journal of Operational Research 29, 262-273.
3. Davis, E.W., and Heidorn, G.E. (1971), "Optimal project scheduling under multiple resource constraints", Management Science 17/12, B803-B816.
4. Demeulemeester, E., and Herroelen, W. (1992), "A branch-and-bound procedure for the multiple resource-constrained project scheduling problem", Management Science 38/12, 1803-1818.
5. Geoffrion, A., and Marsten, R.E. (1972), "Integer programming algorithms: A framework and state-of-the-art survey", Management Science 18/9, 465-491.
6. Johnson, R.J. (1988), "Efficient modular implementation of branch-and-bound algorithms", Decision Sciences 19/1, 19-38.
7. Lai, T., and Sahni, S. (1984), "Anomalies in parallel branch and bound algorithms", Communications of the ACM 27/6, 594-602.
8. Moodie, C.L., and Mandeville, D.E. (1965), "Project resource balancing by assembly line balancing techniques", Journal of Industrial Engineering 17/7, 377-383.
9. Patterson, J.H. (1984), "A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem", Management Science 30/7, 854-867.
10. Patterson, J.H., and Huber, W.D. (1974), "A horizon-varying zero-one approach to project scheduling, Management Science 20/6, 990-998.
11. Saltzman, M.J., and Baybars, I. (1987), "A two-process implicit enumeration algorithm for the simple assembly line balancing problem", European Journal of Operational Research 32, 118-129.
12. Simpson, III, W.P. (1991), "A parallel exact solution procedure for the resource-constrained project scheduling problem", Unpublished Ph.D. Dissertation, Indiana University.
13. Simpson, III, W.P., and Patterson, J.H., "Modeling the performance of and exact solution procedure for the resource-constrained project scheduling problem", in: 1992 Decision Sciences Institute Proceedings 3, 1430-1433.
14. Stinson, J.P. (1976), "A branch-and-bound algorithm for a general class of multiple resource scheduling problems", Unpublished Ph.D. Dissertation, University of North Carolina.
15. Stinson, J.P., Davis, E.W., and Khumawala, B. (1978), "Multiple resource-constrained scheduling using branch and bound", AIIE Transactions 10/3, 252-259.
16. Talbot, F.B. (1976), "An integer programming algorithm for the resource-constrained project scheduling problem", Unpublished Ph.D. Dissertation, The Pennsylvania State University.
17. Talbot, F.B., and Patterson, J.H. (1978), "An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems", Management Science 24/11, 1163-1174.