Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem

INFORMS Journal on Computing

Volumn 17, Issue 1, 2005, Pages 52-65

  Demassey, Sophie ^a   Artigues, Christian ^a   Michelon, Philippe ^a  

^a UNIVERSITY OF AVIGNON   (France)

Author keywords

Constraint propagation; Cutting plane; Resource constrained project scheduling problem; Shaving

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; SCHEDULING;

CONSTRAINT PROPAGATION; CUTTING PLANE; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SHAVING;

PROBLEM SOLVING;

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

References (30)

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