Resource-constrained project scheduling by simulated annealing

International Journal of Production Research

Volumn 34, Issue 8, 1996, Pages 2335-2351

  Boctor, F F ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; PLANT MANAGEMENT; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS;

RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM; TABU SEARCH HEURISTICS;

SCHEDULING;

EID: 0030216966     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207549608905028     Document Type: Article

References (54)

1. Alvarez-Valdes, R. and Tamarit, J. M., 1989, Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis. In Advances in Project Scheduling, chapter 5, R. Slowinski and J. Weglarz (eds) (New York: Elsevier).
2. Bell, C. E. and Park, K., 1990, Solving resource-constrained project scheduling problems by A* search. Naval Research Logistics Quarterly, 37 (1), 61-84.
3. Boctor, F. F., 1990, Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research, 49 (1), 3-13.
4. Boctor, F. F., 1993, Heuristics for scheduling projects with resource restrictions and several resource-duration modes. International Journal of Production Research, 31 (11), 2547-2558.
5. Boctor, F. F., 1994, A new and efficient heuristic for scheduling projects with resource constraints and multiple execution modes, Proceedings of the 4lh international workshop on project management and scheduling, Leuven, Belgium, pp. 63-66.
6. Brand, J. D, Meyer, W. L. and Shaffer, L. R., 1964, The resource scheduling problem in construction. Report 5, Department of Civil Engineering, University of Illinois, Urbana, IL.
7. 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 (2), 262-273.
8. Conover, W. J., 1980, Practical Nonparametric Statistics, 2nd edn (New York: Wiley).
9. Cooper, D. F., 1976, Heuristics for scheduling resource-constrained projects: an experimental investigation. Management Science, 22 (11), 1186-1194.
10. Davis, E. W. and Heidron, G. E., 1971, An algorithm for optimal project scheduling under multiple resource constraints. Management Science, 17 (12), B803-B816.
11. Davis, E. W., 1973, Project scheduling under resource constraints: historical review and categorization of procedures. AIIE Transactions, 5 (4), 297-313
12. Davis, E. W., 1974, Networks: Resource allocation. Industrial Engineering, 6 (4), 22-32
13. Davis, E. W. and Patterson, J. H., 1975, A comparison of heuristic and optimum solutions in resource-constrained project-scheduling. Management Science, 21 (8), 944-955.
14. 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.
15. Doersch, R. H. and Patterson, J. H., 1977, Scheduling a project to maximize its present value: a zero-one programming approach. Management Science, 23 (8), 882-889.
16. Drexel, A. and Gruenewald, J., 1993, Nonpreemptive multi-mode resource-constrained project scheduling. HE Transactions, 25 (5), 74-81.
17. Elmaghraby, S. E., 1977, Activity Networks: Project Planning and Control by Network Models. (New York: Wiley).
18. Fisher, M. L., 1970, Optimal solution of resource constrained network scheduling problems. Technical report 56, Operations Research Center, MIT, Cambridge, MA.
19. Gorenstein, S, 1972, An algorithm for project sequencing with resource constraints. Operations Research, 20 (4), 835-850.
20. Hastings, N. A. J., 1972, On resource allocation in project networks. Operational Research Quarterly, 23 (2), 217-221
21. Herroelen, W. S., 1972, Resource-constrained project scheduling-the state of the art. Operational Research Quarterly, 23 (3), 261-275.
22. Johnson, T, J, R., 1967, An algorithm for the resource-constrained project scheduling problem, PhD thesis, M.l.T.
23. Katsoulas, P. C. and Sadowski, R. P., 1976, A branch and bound algorithm for use in resource allocation. AIIE Transactions, 8 (2), 226-233.
24. Kelley, J. E., Jr., 1963, The critical path method: resource planning and scheduling. In Industrial Scheduling, J. F. Muth and G. L. Thompson (eds) (Englewood Cliffs, NJ: Prentice-Hall), pp. 347-365.
25. Kolisch, R. and Drexel, A., 1994, A heuristic algorithm for the multi-mode resource-constrained project scheduling problem. Proceedings of the 4th international workshop on project management and scheduling, Leuven, Belgium, pp. 58-62.
26. Kurtulus, I. and Davis, E. W., 1982, Multi-project scheduling: categorization of heuristic rules performance. Management Science, 28 (2), 161-172.
27. Lambourn, S., 1963, Resource allocation and multi-project scheduling (RAMPS)-a new tool in planning and control. Computer Journal, 5 (4), 300-304.
28. Lofts, N. R., 1974, Multiple allocation of resources in a network-an optimal scheduling algorithm. INFOR, 12(1), 25-38.
29. Martino, R. L., 1968, Resource Management (New York: McGraw-Hill).
30. Mason, A. T. and Moodie, C. L, 1971, A branch and bound algorithm for minimizing cost in project scheduling. Management Science, 18 (4), B158-B173.
31. Metropolis, N., Rosembluth, A., Rosenbluth, M. and Teller, A., 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087-1092.
32. Patterson, J. H., 1973, Alternative methods for project scheduling with limited resources. Naval Research Logistics Quarterly, 20 (4), 767-784.
33. Patterson, J. H. and Hubber, W, D., 1974, A horizon-varying zero-one approach to project scheduling. Management Science, 20 (6), 990-998.
34. Patterson, J. H., Roth, C. W., 1976, Scheduling a project under multiple resource constraints: a zero-one programming approach. AIIE Transactions, 8 (4), 449-455.
35. Patterson, J. H., 1984, A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Science, 30 (7), 854-867.
36. Patterson, J. H., Slowinski, R., Talbot, F. B. and Weglarz, J., 1989, An algorithm for a general class of precedence and resource constrained scheduling problems. In Advances in Project Scheduling, R. Slowinski and J. Weglarz (eds), Elsevier, Amsterdam, 3-27.
37. Patterson, J. H., Talbot, F. B., Slowinski, R. and Weglarz, J., 1990, Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems. European Journal of Operational Research, 49 (1), 68-79.
38. Pinson, E., Prins, C. and Rullier, F., 1994, Using Tabu search for solving the resource constrained project scheduling problem. Proceedings of the 4th international workshop on project management and scheduling, Leuven, Belgium, pp. 102-106.
39. Pritsker, A. B., Watters, L. J. and Wolfe, P. M., 1969, Multi-project scheduling with limited resources: a zero-one programming approach. Management Science, 16 (1), 93-109
40. Russel, A. H., 1986, A comparison of heuristics for scheduling projects with cash flows and resource restrictions. Management Science, 32 (10), 1291-1300.
41. Schräge, L., 1970, Solving resource-constrained network problems by implicit enumeration-nonpreemptive case. Operations Research, 18 (2), 225-235.
42. Slowinski, R., 1980, Two approaches to problems of resource allocation among project activities: a comparative study. Journal of the Operational Research Society, 31 (8), 711-723.
43. Slowinski, R., 1981, Multiobjective network scheduling with efficient use of renewable and non-renewable resources. European Journal of Operational Research, 7 (3), 265-273.
44. Slowinski, R. and Weglarz, J., 1978, Solving the general project scheduling problem with multiple constrained resources by mathematical programming. Proceedings of the 8th IFIP Conference on Optimization Techniques, Lecture Notes in Control and Information Sciences, 7 (Berlin: Springer-Verlag), pp. 278-289.
45. Stinson, J. P., Davis, E. W. and Khumawala, B. M., 1978, Multiple-resource constrained scheduling using branch and bound. AIIE Transactions, 10 (3), 252-259.
46. Talbot, F. B. and Patterson, J. H., 1978, An efficient integer programming algorithm with network cuts for solving resource-constrained sequencing problems. Management Science, 24 (11), 1163-1174.
47. Talbot, F. B., 1982, Resource-constrained project scheduling with time-resource trade-offs: the non-preemptive case. Management Science, 28 (10), 1197-1210.
48. Thesen, A., 1976, Heuristic scheduling of activities under resource and precedence restrictions. Management Science, 23 (4), 412-422.
49. Weglarz, J., Blazewicz, J., Cellary, W. and Slowinski, R., 1977, Algorithm 520-an automatic revised simplex method for constrained resources network scheduling. ACM Transactions on Mathematical Software, 3 (3), 295-300.
50. Weglarz, J., 1980, Control in resource allocation systems. Foundation of Control Engineering, 5 (3), 159-180.
51. Weglarz, J., 1981, Project scheduling with continuously divisible doubly constrained resources. Management Science, 27 (9), 1040-1053.
52. Weiss, E. N., 1988, An optimization based heuristic for scheduling parallel project networks with constrained renewable resources. IIE Transactions, 20 (2), 137-143.
53. Wiest, J. D., 1963, The scheduling of large projects with limited resources. PhD thesis, Carnegie Institute of Technology.
54. Wiest, J. D., 1967, A heuristic model for scheduling large projects with limited resources. Management Science, 13 (6), B359-B377.