The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

European Journal of Operational Research

Volumn 107, Issue 2, 1998, Pages 250-259

  Ahn, Taeho ^a   Erenguc, S Selcuk ^b  

^a Soongsil University   (South Korea)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Activity cost; Crashable modes; Penalty cost; Project cost; Resource constrained project scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COST EFFECTIVENESS; HEURISTIC METHODS; INDUSTRIAL ECONOMICS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

MULTI PASS ALGORITHM; RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMS (RCPSP);

PRODUCTION ENGINEERING;

EID: 0032097042     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00331-7     Document Type: Article

References (25)

1. Ahn, T., 1994. Resource Constrained Project Scheduling Problem with Time/Cost Trade- Offs: The Multimode Case. PhD Dissertation, University of Florida, Gainesville, FL 32611.
2. Ahn, T., Erenguc, S., 1995. Resource constrained project scheduling problem with multiple crashable modes - An exact solution method. Working Paper Series #95-101, Department of Decision and Information Sciences, University of Florida, Gainesville, FL.
3. Herman, E.B., 1964. Resource allocation in a PERT network under continuous activity time-cost functions. Management Science 10, 734-745.
4. Boctor, F.F., 1990. Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research 49, 3-13.
5. Boctor, F.F., 1993. Heuristics for scheduling projects with resource restrictions and several resource-duration modes. International Journal of Production Research 31, 2547-2558.
6. Christofides, N., Alvarez-Valdes, R., Tamarit, J.M., 1987. Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research 29, 262-273.
7. Davis, E.W., Patterson, J.H., 1975. A comparison of heuristic and optimum solutions in resource constrained project scheduling. Management Science 17, 944-955.
8. Demeulemeester, E.L., Herroelen, W.S., 1992. A branch and bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38, 1803-1818.
9. Demeulemeester, E.L., Herroelen, W.S., Elmaghraby, S.E., 1993. Optimal procedures for the discrete time/cost trade-off problem in project networks. Research Report, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium.
10. Drexl, A., Gruenewald, J., 1993. Nonpreemptive multi-mode resource constrained project scheduling. IIE Transactions 25, 74-81.
11. Falk, J.E., Horowitz, J.L., 1972. Critical path problems with concave cost curves. Management Science 19, 446-455.
12. Fulkerson, D.R., 1961. A network flow computation for project cost curves. Management Science 7, 167-178.
13. Kelly, J.E., 1961. Critical path planning and scheduling: Mathematical basis. Operations Research 9, 296-320.
14. Kolisch, R., Sprecher, A., Drexl, A., 1992. Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems: Easy And Hard Instances. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 301.
15. Lamberson, L.R., Hocking, R.R., 1970. Optimum time compression in project scheduling. Management Science 16, 597-606.
16. Patterson, J.H., 1976. Project scheduling: The effects of problem structure on heuristic performance. Naval Research Logistics Quarterly 23, 95-123.
17. Patterson, J.H., Huber, W.D., 1974. A horizon-varying, zero-one approach to project scheduling. Management Science 20, 990-998.
18. Patterson, J.H., Roth, G., 1976. Scheduling a project under multiple resource constraints: A zero-one approach. AIIE Transactions 8, 449-456.
19. Patterson, J.H., Slowinski, R., Talbot, F.B., Weglarz, J., 1989. An algorithm for a general class of precedence and resource constrained scheduling problems. In: Slowinski, R., Weglarz, J. (Ed.), Studies in Production and Engineering Economics, vol. 9: Advances in Project Scheduling. Elsevier, Amsterdam, pp. 3-28.
20. Patterson, J.H., Slowinski, R., Talbot, F.B., 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, 68-79.
21. Sprecher, A., 1994. Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case, Lecture Notes in Economics and Mathematical Systems 409, Springer, Berlin.
22. Sprecher, A., Hartmann, S., Drexl, A., 1994. Project Scheduling with Discrete Time-Resource and Resource-Resource Tradeoffs, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 357, Olshausenstraße 40, 24118 Kiel, Germany.
23. Stinson, J.P., Davis, E.W., Khumawala, B.M., 1978. Multiple resource-constrained scheduling using branch and bound. AIIE Transactions 10, 252-259.
24. Talbot, F.B., 1982. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science 28, 1197-1210.
25. Talbot, F.B., Patterson, J.H., 1978. An efficient integer programming algorithm with network cut for solving resource constrained scheduling problems. Management Science 24, 1163-1174.