Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

References

• Alvarez-Valdés R., Tamarit J. M. The project scheduling polyhedron: Dimension, facets and lifting theorems. Eur. J. Oper. Res. (1993) 67:204–220Crossref, Google Scholar
• Applegate D., Cook W. A computational study of job-shop scheduling. ORSA J. Comput. (1991) 3:149–156Link, Google Scholar
• Balas E., Beale E. M. L. Project scheduling with resource constraints. Appl. Math. Programming Tech. (1970) (The English Universities Press, London, U.K.) 187–200Google Scholar
• Baptiste P., Le Pape C. Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints (2000) 5:119–139Crossref, Google Scholar
• Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling problem: Notation, classification, models and methods. Eur. J. Oper. Res. (1999) 112:3–41Crossref, Google Scholar
• Brucker P., Knust S. A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. (2000) 127:355–362Crossref, 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
• Carlier J., Néron E. A new LP based lower bound for the cumulative scheduling problem. Eur. J. Oper. Res. (2000) 127:363–382Crossref, Google Scholar
• Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Sci. (1989) 35:164–176Link, Google Scholar
• Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Ann. Oper. Res. (1990) 26:269–287Crossref, Google Scholar
• Carlier J., Pinson E. Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. (1994) 78:146–161Crossref, Google Scholar
• Caseau Y., Laburthe F., Maher M. Cumulative scheduling with task intervals. Proc. Joint Internat. Conf. Sympos. Logic Programming, JCPSLP'96 (1996) (MIT Press, Cambridge, MA) 363–377Google Scholar
• Christofides N., Alvarez-Valdés R., Tamarit J. M. Project scheduling with resource constraints: A branch and bound approach. Eur. J. Oper. Res. (1987) 29:262–273Crossref, Google Scholar
• Demeulemeester E., Herroelen W. A branch-and-bound procedure for the multiple-resource constrained single project scheduling problem. Management Sci. (1992) 38:1803–1818Link, Google Scholar
• Demeulemeester E., Herroelen W. New benchmark results for the resource-constrained project scheduling problem. Management Sci. (1997) 43:1485–1492Link, Google Scholar
• Dorndorf U., Pesch E., Phan-Huy T. A branch-and-bound algorithm for the resource constrained project scheduling problem. Math. Methods Oper. Res. (2000) 52:413–439Crossref, Google Scholar
• Dyer M., Wolsey L. A. Formulating the single machine sequencing problem with release dates as mixed integer program. Discrete Appl. Math. (1990) 26:255–270Crossref, Google Scholar
• Harjunkoski I., Jain V., Grossmann I. Hybrid mixed integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems. Comput. Chemical Engrg. (2000) 24:337–343Crossref, Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (Wiley, New York) Crossref, Google Scholar
• Klein R., Scholl A. Computing lower bound by destructive improvement: An application to resource-constrained project scheduling. Eur. J. Oper. Res. (1999) 112:322–346Crossref, 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
• Lopez P., Erschler J., Esquirol P. Ordonnancement de tâches sous contraintes: une approche énergétique. Revue Française Automatisme Informatique Rech. Oper. APII (1992) 26:453–481Google Scholar
• Martin P., Shmoys D. B., Cunningham W. H., McCormick S. T., Queyranne M. A new approach to computing optimal schedules for the job-shop scheduling problem. Proc. 5th Internat. Conf. Integer Programming Combin. Optim., IPCO'96 (1996) Vancouver, British Columbia, Canada:389–403Crossref, Google Scholar
• Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for the multiple resource-constrained project scheduling problem based on a new mathematical formulation. Management Sci. (1998) 44:714–729Link, Google Scholar
• Möhring R. H., Schultz A., Stork F., Uetz M. Solving project scheduling problems by minimum cut computations. Management Sci. (2003) 49:330–350Link, Google Scholar
• Nuijten W. Time and resource constrained scheduling: A constraint satisfaction approach. (1994) . Ph.D. thesis, University of Technology, Eindhoven, The NetherlandsGoogle Scholar
• Pritsker A., Watters L., Wolfe P. Multi-project scheduling with limited resources: A zero-one programming approach. Management Sci. (1969) 16:93–108Link, Google Scholar
• Radermacher F. Scheduling of project networks. Ann. Oper. Res. (1985) 4:227–252Crossref, Google Scholar
• Sankaran J. K., Bricker D. L., Juang S-H. A strong fractional cutting-plane algorithm for resource-constrained project scheduling. Internat. J. Indust. Engrg.: Appl. Practice (1999) 6:99–111Google Scholar
• Sprecher A. Scheduling resource-constrained projects competitively at modest memory requirements. Management Sci. (2000) 46:710–723Link, Google Scholar