Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

1999 Hartmann, 2000, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, European Journal of Operational Research, 127, 394, 10.1016/S0377-2217(99)00485-3 Demeulemeester, 2002 Valls, 2003, Resource-constrained project scheduling: A critical activity reordering heuristic, European Journal of Operational Research, 149, 282, 10.1016/S0377-2217(02)00768-3 Fleszar, 2004, Solving the resource-constrained project scheduling problem by a variable neighbourhood search, European Journal of Operational Research, 155, 402, 10.1016/S0377-2217(02)00884-6 Zhang, 2006, Particle swarm optimization for resource-constrained project scheduling, International Journal of Project Management, 24, 83, 10.1016/j.ijproman.2005.06.006 Remy, 2004, Resource constrained scheduling on multiple machines, Information Processing Letters, 91, 177, 10.1016/j.ipl.2004.04.009 Demeulemeester, 1992, A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management Science, 38, 1803, 10.1287/mnsc.38.12.1803 Brücker, 2000, A linear programming and constraint propagation-based lower vound for the RCPSP, European Journal of Operational Research, 127, 355, 10.1016/S0377-2217(99)00489-0 Zamani, 2001, A high-performance exact method for the resource-constrained project scheduling problem, Computers & Operations Research, 28, 1387, 10.1016/S0305-0548(00)00048-4 Mingozzi, 1998, An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation, Management Science, 44, 714, 10.1287/mnsc.44.5.714 Möhring, 2003, Solving project scheduling problems by minimum cut computations, Management Science, 49, 330, 10.1287/mnsc.49.3.330.12737 Herroelen, 1998, Resource-constrained project scheduling: A survey of recent developments, Computers & Operations Research, 25, 279, 10.1016/S0305-0548(97)00055-5 Alvarez-Valdés, 1993, The project scheduling polyhedron: Dimension, facets, and lifting theorems, European Journal of Operational Research, 67, 204, 10.1016/0377-2217(93)90062-R Christofides, 1987, Project scheduling with resource constraints: A branch and bound approach, European Journal of Operational Research, 29, 262, 10.1016/0377-2217(87)90240-2 P. Coll, C. Ribeiro, C. de Souza, Multiprocessor scheduling under precedence constraints: Polyhedral results, Optimization Online: http://www.optimization-online.org/DB_HTML/2003/10/752.html, 2003 Kis, 2005, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, Mathematical Programming, Series A, 103, 515, 10.1007/s10107-004-0551-6 Dorndorf, 2000, A branch-and-bound algorithm for the resource-constrained project scheduling problem, Mathematical Methods of Operations Research, 52, 413, 10.1007/s001860000091 Dorndorf, 2000, A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints, Management Science, 46, 1365, 10.1287/mnsc.46.10.1365.12272 Demassey, 2005, Constraint propagation based cutting planes: An application to the resource-constrained project scheduling problem, INFORMS Journal on Computing, 17, 52, 10.1287/ijoc.1030.0043 C. Cavalcante, C. DeSouza, M. Savelsbergh, Y. Wang, L. Wolsey, Scheduling projects with labor constraints, CORE Discussion Paper 9859, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998 Sankaran, 1999, A strong fractional cutting-plane algorithm for resource-constrained project scheduling, International Journal of Industrial Engineering, 6, 99 Drozdowski, 1996, Scheduling multiprocessor tasks—An overview, European Journal of Operational Research, 94, 215, 10.1016/0377-2217(96)00123-3 Chen, 1999, General multiprocessor task scheduling, Naval Research Logistics, 46, 57, 10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H Lee, 1999, Scheduling one and two-processor tasks on two parallel processors, IIE Transactions, 31, 445, 10.1080/07408179908969847 R. Möhring, M. Uetz, Scheduling scarce resources in chemical engineering, Technical Report 682, Technische Universität Berlin, Germany, 2000 P. Brücker, S. Knust, Complexity results for scheduling problems, http://www.mathematik.uni-osnabrueck.de/research/OR/class/ Conway, 1967 M. Queyranne, A. Schulz, Polyhedral approaches to machine scheduling, Technical Report 408, Technische Universität Berlin, Germany, 1994 J. Hardin, Resource-constrained scheduling and production planning: Linear programming-based studies, Ph.D. Thesis, Georgia Institute of Technology, 2001 Wolsey, 1977, Valid inequalities and superadditivity for 0-1 integer programs, Mathematics of Operations Research, 2, 66, 10.1287/moor.2.1.66 Gu, 2000, Sequence independent lifting in mixed integer programming, Journal of Combinatorial Optimization, 4, 109, 10.1023/A:1009841107478 Balas, 1975, Facets of the knapsack polytope, Mathematical Programming, 8, 146, 10.1007/BF01580440 Nemhauser, 1988 Wolsey, 1990, Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints, Discrete Applied Mathematics, 29, 251, 10.1016/0166-218X(90)90148-6 Gu, 1998, Cover inequalities for 0-1 linear programs: Computation, INFORMS Journal on Computing, 10, 427, 10.1287/ijoc.10.4.427 Van den Akker, 1999, A polyhedral approach to single-machine scheduling problems, Mathematical Programming, Series A, 85, 541, 10.1007/s101070050071