D. , A. , A. Michelon-constraint, ;. , and J. M. Tamarit, Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem References Alvarez-Valdés, R, Eur. J. Oper. Res, vol.67, pp.204-220, 1993.

D. Applegate and W. Cook, A computational study of job-shop scheduling, ORSA J. Comput, vol.3, pp.149-156, 1991.

E. Balas, Project scheduling with resource constraints, Appl. Math. Programming Tech, pp.187-200, 1970.

P. Baptiste and C. L. Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, Constraints, vol.5, pp.119-139, 2000.

P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, Resource-constrained project scheduling problem: Notation, classification, models and methods, Eur. J. Oper. Res, vol.112, pp.3-41, 1999.

P. Brucker and S. Knust, A linear programming and constraint propagation-based lower bound for the RCPSP, Eur. J. Oper. Res, vol.127, pp.355-362, 2000.

P. Brucker, S. Knust, A. Schoo, and O. Thiele, A branch and bound algorithm for the resource-constrained project scheduling problem, Eur. J. Oper. Res, vol.107, pp.272-288, 1998.

J. Carlier and E. Néron, A new LP based lower bound for the cumulative scheduling problem, Eur. J. Oper. Res, vol.127, pp.363-382, 2000.

J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Management Sci, vol.35, pp.164-176, 1989.

J. Carlier and E. Pinson, A practical use of Jackson's preemptive schedule for solving the job-shop problem, Ann. Oper. Res, vol.26, pp.269-287, 1990.

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, Eur. J. Oper. Res, vol.78, pp.146-161, 1994.

Y. Caseau and F. Laburthe, Proc. Joint Internat. Conf. Sympos. Logic Programming, JCPSLP'96, pp.363-377, 1996.

N. Christofides, R. Alvarez-valdés, and J. M. Tamarit, Project scheduling with resource constraints: A branch and bound approach, Eur. J. Oper. Res, vol.29, pp.262-273, 1987.

E. Demeulemeester and W. Herroelen, A branch-and-bound procedure for the multiple-resource constrained single project scheduling problem, Management Sci, vol.38, pp.1803-1818, 1992.

E. Demeulemeester and W. Herroelen, New benchmark results for the resource-constrained project scheduling problem, Management Sci, vol.43, pp.1485-1492, 1997.

U. Dorndorf, E. Pesch, and T. Phan-huy, A branch-and-bound algorithm for the resource constrained project scheduling problem, Math. Methods Oper. Res, vol.52, pp.413-439, 2000.

M. Dyer and L. A. Wolsey, Formulating the single machine sequencing problem with release dates as mixed integer program, Discrete Appl. Math, vol.26, pp.255-270, 1990.

I. Harjunkoski, V. Jain, and I. Grossmann, Hybrid mixed integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems, Comput. Chemical Engrg, vol.24, pp.337-343, 2000.

J. N. Hooker, Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, 2000.

R. Klein and A. Scholl, Computing lower bound by destructive improvement: An application to resource-constrained project scheduling, Eur. J. Oper. Res, vol.112, pp.322-346, 1999.

R. Kolisch, A. Sprecher, and A. Drexl, Characterization and generation of a general class of resource-constrained project scheduling problems, Management Sci, vol.41, pp.1693-1703, 1995.

P. Lopez, J. Erschler, and P. Esquirol, Ordonnancement de tâches sous contraintes: une approche énergétique. Revue Française Automatisme Informatique Rech, Oper. APII, vol.26, pp.453-481, 1992.

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Proc. 5th, 1996.

. Internat and . Conf, Integer Programming Combin. Optim., IPCO'96, pp.389-403

A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco, An exact algorithm for the multiple resource-constrained project scheduling problem based on a new mathematical formulation, Management Sci, vol.44, pp.714-729, 1998.

R. H. Möhring, A. Schultz, F. Stork, and M. Uetz, Solving project scheduling problems by minimum cut computations. Management Sci, vol.49, pp.330-350, 2003.

W. Nuijten, Time and resource constrained scheduling: A constraint satisfaction approach, 1994.

A. Pritsker, L. Watters, and P. Wolfe, Multi-project scheduling with limited resources: A zero-one programming approach, Management Sci, vol.16, pp.93-108, 1969.

F. Radermacher, Scheduling of project networks, Ann. Oper. Res, vol.4, pp.227-252, 1985.

J. K. Sankaran, D. L. Bricker, and S. Juang, A strong fractional cutting-plane algorithm for resource-constrained project scheduling, Internat. J. Indust. Engrg.: Appl. Practice, vol.6, pp.99-111, 1999.

A. Sprecher, Scheduling resource-constrained projects competitively at modest memory requirements, Management Sci, vol.46, pp.710-723, 2000.

J. W. Accepted and . Chinneck, , 2001.