An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

References

• Balakrishnan R., Leon W. J. Quality and adaptability of problem-space based neighborhoods for resource constrained scheduling. (1993) . Working paper, Department of Industrial Engineering, Texas A&M University, College Station, TXGoogle Scholar
• Balas E., Beale E. M. L. Project scheduling with resource constraints. Application of Mathematical Programming Techniques (1971) (English University Press)Google Scholar
• Bell C. E., Han J. A new heuristic solution method in resource-constrained project scheduling. Naval Res. Logist. (1991) 38:315–331Crossref, Google Scholar
• Bell C. E., Park K. Solving resource-constrained project scheduling problems by A* search. Naval Res. Logist (1990) 37:61–84Crossref, Google Scholar
• Blazewicz J., Lenstra J. K., Rinnooy Kan A. H. G. Scheduling projects subject to resource constraints: Classification and complexity. Discrete Appl. Math. (1983) 5:11–24Crossref, Google Scholar
• Boctor F. F. Some efficient multi-heuristic procedures for resource-constrained project scheduling. Eur. J. Oper. Res. (1990) 49:3–13Crossref, Google Scholar
• Carraghan R., Pardalos P. M. An exact algorithm for the maximum clique problem. Oper. Res. Lett. (1990) 9:375–382Crossref, Google Scholar
• Christofides N., Alvarez-Valdes R., Tamarit J. M. Project scheduling with resource constraints: A branch and bound approach. Eur. J. Oper. Res. (1987) 29:262–273Crossref, Google Scholar
• Cooper D. F. Heuristics for scheduling resource-constrained projects: An experimental investigation. Management Sci. (1976) 22:1186–1194Link, Google Scholar
• Davies E. W., Heidorn G. E. An algorithm for optimal project scheduling under multiple resource constraints. Management Sci. (1971) 17:803–816Link, Google Scholar
• Davies E. W., Patterson J. H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Sci. (1975) 21:944–955Link, Google Scholar
• Demeulemeester E., Herroelen W. A branch and bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. (1992) 38:1803–1818Link, Google Scholar
• Elmaghraby S. E.Activity Networks: Project Planning and Control by Network Models (1977) (J. Wiley, New York) Google Scholar
• Fisher M. Optimal solution of scheduling problems using Lagrange multipliers. Part I. Oper. Res. (1973) 21:1114–1127Link, Google Scholar
• Gorenstein S. An algorithm for project sequencing with resource constraints. Oper. Res. (1972) 20:835–850Link, Google Scholar
• Kolisch R., Sprecher A., Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances. Management Sci. (1995) 41:1693–1703Link, Google Scholar
• Marsten R. The design of the xmp linear programming library. ACM Trans. on Math. Software (1981) 9:481–497Crossref, Google Scholar
• Nemhauser G. L., Trotter L. E. Vertex packings: Structural properties and algorithms. Math. Programming (1975) 8:232–248Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley Interscience, New York) Crossref, Google Scholar
• Oguz O., Bala H. A comparative study of computational procedures for the resource constrained project scheduling problem. Eur. J. Oper. Res. (1994) 72:406–416Crossref, Google Scholar
• Pardalos P. M., Xue J. The maximum clique problem. (1992) . Technical report, University of FloridaGoogle Scholar
• Patterson J. H. Alternate methods of project scheduling with limited resources. Naval Res. Logist. Quart. (1973) 20:767–784Crossref, Google Scholar
• Patterson J. H., Huber W. D. A horizon-varying, zero-one approach to project scheduling. Management Sci. (1974) 20:990–998Link, Google Scholar
• Patterson J. H., Roth G. W. Scheduling a project under multiple resource constraints: A zero-one programming approach. AIIE Trans. (1976) 8:449–455Crossref, Google Scholar
• Patterson J. H. A comparison of exact approaches for solving the multiple constrained resource project scheduling problem. Management Sci. (1984) 30:854–867Link, Google Scholar
• Pritsker A. A. B., Watters W. D., Wolfe P. M. Multiproject scheduling with limited resources: A zero-one programming approach. Management Sci. (1969) 16:93–108Link, Google Scholar
• Schrage L. Solving resource-constrained network problems by implicit enumeration—Nonpreemptive case. Oper. Res. (1971) 18:225–235Google Scholar
• Stinson J. P., Davis E. W., Khumawala B. M. Multiple resource-constrained scheduling using branch and bound. AIIE Trans. (1978) 10:252–259Crossref, Google Scholar
• Talbot F. B., Patterson J. H. An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Sci. (1978) 24:1163–1174Link, Google Scholar
• Thesen A. Heuristic scheduling of activities under resource and precedence restrictions. Management Sci. (1976) 23:412–422Link, Google Scholar
• Xue J. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks (1994) 24:109–120Crossref, Google Scholar