A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

References

• Balas E., Lenstra J. K., Vazacopoulos A. The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Sci. (1995) 41:94–109Link, Google Scholar
• Bard J. F., Kontoravdis G., Yu G. A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Sci. (2002) 36:250–269Link, Google Scholar
• Bartusch M., Möhring R. H., Radermacher E. J. Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. (1988) 16:201–240Crossref, Google Scholar
• Böttcher J., Drexl A., Kolisch R., Salewski F. Project scheduling under partially renewable resource constraints. Management Sci. (1999) 45:543–559Link, Google Scholar
• Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. (1998) 107:272–288Crossref, Google Scholar
• De Reyck B., Herroelen W. On the use of the complexity index as a measure of complexity in activity networks. Eur. J. Oper. Res. (1996) 91:347–366Crossref, Google Scholar
• De Reyck B., Herroelen W. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. (1998) 111:152–174Crossref, Google Scholar
• Dorndorf U., Pesch E., Phan-Huy T. A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Sci. (2000) 46:1365–1384Link, Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming (2003) 98:23–47Crossref, Google Scholar
• Gu Z., Nemhauser G. L., Savelsbergh M. W. Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS J. Comput. (1998) 10:427–437Link, Google Scholar
• Gu Z., Nemhauser G. L., Savelsbergh M. W. Lifted cover inequalities for 0-1 integer programs: Complexity. INFORMS J. Comput. (1999) 11:117–123Link, Google Scholar
• Hartmann S. Project scheduling under limited resources. Lecture Notes in Economics and Mathematical Systems (1999) Vol. 478(Springer, Berlin, Germany) Crossref, Google Scholar
• Herroelen W., De Reyck B., Demeulemeester E. Resource-constrained project scheduling: A survey of recent developments. Comput. Oper. Res. (1998) 25:279–302Crossref, Google Scholar
• Icmeli O., Rom W. O. Solving the resource constrained project scheduling problem with optimization subroutine library. Comput. Oper. Res. (1996) 23:801–817Crossref, Google Scholar
• ILOGILOG CPLEX 7.5, Reference Manual (2002) (ILOG, Inc., Mountain View, CA) Google Scholar
• Kilby P., Prosser P., Shaw P. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints (1998) 5:389–414Crossref, Google Scholar
• Klein R., Scholl A. Progress: Optimally solving the generalized resource-constrained project scheduling problem. Math. Methods Oper. Res. (2000) 52:467–488Crossref, Google Scholar
• Kolisch R., Padman R. An integrated survey of deterministic project scheduling. OMEGA (2001) 29:249–272Crossref, Google Scholar
• Kolisch R., Sprecher A., Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Sci. (1995) 41:1693–1703Link, Google Scholar
• Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Sci. (1998) 44:714–729Link, Google Scholar
• Neumann K., Schwindt C., Zimmermann J. Project scheduling with time windows and scarce resources: Temporal and resource constrained project scheduling with regular and non-regular objective functions. Lecture Notes in Economics and Mathematical Systems (2002) Vol. 508(Springer, Berlin, Germany) Google Scholar
• Nonobe K., Ibaraki T., Ribeiro C. C., Hansen P. Formulation and tabu search algorithm for the resource constrained project scheduling problem. Essays and Surveys in Metaheuristics (2002) (Kluwer Academic Publishers, Boston, MA) 557–588Crossref, Google Scholar
• Özdamar L., Ulusoy G. A survey on resource-constrained project scheduling problem. IIE Trans. (1995) 27:574–586Crossref, Google Scholar
• Pritsker A. A. B., Watters L. J., Wolfe P. M. Multiproject scheduling with limited resources: A zero-one programming approach. Management Sci. (1969) 16:93–108Link, Google Scholar
• Sprecher A., Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res. (1998) 107:431–450Crossref, Google Scholar