Resource constrained project scheduling problem with multiple crashable modes: an exact solution method

Naval Research Logistics

Volumn 48, Issue 2, 2001, Pages 107-127

  Erenguc, S Selcuk ^a   Ahn, Taeho ^b   Conway, Daniel G ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b Soongsil University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING;

BRANCH AND BOUND; MULTIPLE CRASHABLE MODES; PROJECT SCHEDULING;

OPERATIONS RESEARCH;

EID: 0035281212     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6750(200103)48:2<107::AID-NAV1>3.0.CO;2-9     Document Type: Article

References (21)

1. R.K. Ahuja, D.S. Hochbaum, and J.B. Orlin, Solving the convex cost integer dual network problem, Proc IPCO '99 (Integer Programming and Combinatorial Optimization), G. Cornuejols, R.E. Burkard, and G.J. Woeginger (Editors), Lecture Notes in Computer Science, Springer-Verlag, New York, 1999, pp. 31-44.
2. R.K. Ahuja, D.S. Hochbaum, and J.B. Orlin, Solving the convex cost integer dual network problem, Working Paper, University of Florida, Department of Industrial and Systems Engineering, Gainesville, 2000.
3. E.B. Berman, Resource allocation in a PERT network under continuous activity time-cost functions, Manage Sci 10 (1964), 734-745.
4. N. Christofides, R. Alvarez-Valdes, and J.M. Tamarit, Project scheduling with resource constraints: A branch and bound approach, Eur J Oper Res 29 (1987), 262-273.
5. E.L. Demeulemeester and W.S. Herroelen, A branch and bound procedure for the multiple resource-constrained project scheduling problem, Manage Sci 38 (1992), 1803-1818.
6. E.L. Demeulemeester, W.S. Herroelen, and S.E. Elmaghraby, Optimal procedures for the discrete time/cost trade-off problem in project networks, Research Report, Department of Applied Economics, Katholieke Universiteit Leuven, Leuven, Belgium, 1993.
7. J.E. Falk and J.L. Horowitz, Critical path problems with concave cost curves, Manage Sci 19 (1972), 446-455.
8. D.R. Fulkerson, A network flow computation for project cost curves, Manage Sci 7 (1961), 167-178.
9. O. Icmeli and S.S. Erenguc, A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows, Manage Sci 42 (1996), 1395-1408.
10. J.E. Kelly, "Critical path planning and scheduling: Mathematical basis, Oper Res 9 (1961), 296-320.
11. L.R. Lamberson and R.R. Hocking, Optimum time compression in project scheduling, Manage Sci 16 (1970), 597-606.
12. J.H. Patterson, Project scheduling: The effects of problem structure on heuristic performance, Nav Res Logistics Quart 23 (1976), 95-123.
13. J.H. Patterson and W.D. Huber, A horizon-varying, zero-one approach to project scheduling, Manage Sci 20 (1974), 990-998.
14. J.H. Patterson and G. Roth, Scheduling a project under multiple resource constraints: A zero-one approach, AIIE Trans 8 (1976), 449-456.
15. J.H. Patterson, R. Slowinski, F.B. Talbot, and J. Weglarz, "An algorithm for a general class of precedence and resource constrained scheduling problems," Studies in production and engineering economics, volume 9: Advances in project scheduling, R. Slowinski and J. Weglarz (Editors), Elsevier, Amsterdam, 1989, pp. 3-28.
16. J.H. Patterson, R. Slowinski, F.B. Talbot, and J. Weglarz, Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems, Eur J Oper Res 49 (1990), 68-79.
17. A. Sprecher, Resource-constrained project scheduling: Exact methods for the multi-mode case, Lecture Notes in Economics and Mathematical Systems 409, Springer-Verlag, Berlin, 1994.
18. A. Sprecher, S. Hartmann, and A. Drexl, Project scheduling with discrete time-resource and resource resource tradeoffs, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 357, Kiel, Germany, 1994.
19. J.P. Stinson, E.W. Davis, and B.M. Khumawala, Multiple resource-constrained scheduling using branch and bound, AIIE Trans 10 (1978), 252-259.
20. F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case, Manage Sci 28 (1982), 1197-1210.
21. F.B. Talbot and J.H. Patterson, An efficient integer programming algorithm with network cut for solving resource constrained scheduling problems, Manage Sci 24 (1978), 1163-1174.