A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem

INFORMS Journal on Computing

Volumn 18, Issue 3, 2006, Pages 377-390

  Zhu, Guidong ^a   Bard, Jonathan F ^b   Yu, Gang ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Branch and cut; Integer linear programming; Multimodes; Multiple resources; Project scheduling

Indexed keywords

EID: 33748521972     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0121     Document Type: Article

References (25)

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