Event-based MILP models for resource-constrained project scheduling problems

Alvarez-Valdès, 1993, The project scheduling polyhedron, facets and lifting theorems: dimension, facets and lifting theorems, European Journal of Operational Research, 67, 204, 10.1016/0377-2217(93)90062-R Applegate, 1991, A computational study of job-shop scheduling, ORSA Journal on Computing, 3, 149, 10.1287/ijoc.3.2.149 Artigues, 2003, Insertion techniques for static and dynamic resource-constrained project scheduling, European Journal of Operational Research, 149, 249, 10.1016/S0377-2217(02)00758-0 Artigues, 2008, Computational experiments, 98 Balas, 1970, Project scheduling with resource constraints, 187 Baptiste, 2000, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, Constraints, 5, 119, 10.1023/A:1009822502231 Bowman, 1959, The schedule-sequencing problem, Operations Research, 7, 621, 10.1287/opre.7.5.621 Blazewicz, 1983, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, 5, 11, 10.1016/0166-218X(83)90012-4 Brucker, 2000, A linear programming and constraint propagation-based lower bound for the RCPSP, European Journal of Operational Research, 127, 355, 10.1016/S0377-2217(99)00489-0 Carlier, 1982, The one-machine sequencing problem, European Journal of Operational Research, 11, 42, 10.1016/S0377-2217(82)80007-6 Carlier, 2003, On linear lower bounds for resource constrained project scheduling problem, European Journal of Operational Research, 149, 314, 10.1016/S0377-2217(02)00763-4 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 de Reyck, 1996, On the use of the complexity index as a measure of complexity in activity networks, European Journal of Operational Research, 91, 347, 10.1016/0377-2217(94)00344-0 Dauzère-Pérès S, Lasserre JB. A new mixed-integer formulation of the flow-shop sequencing problem. In: 2nd workshop on models and algorithms for planning and scheduling problems, Wernigerode, Germany, May 1995. 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 Demeulemeester, 1997, New benchmark results for the resource-constrained project scheduling problem, Management Science, 43, 1485, 10.1287/mnsc.43.11.1485 Elmaghraby, 1980, On the measurement of complexity in activity networks, European Journal of Operational Research, 5, 223, 10.1016/0377-2217(80)90053-3 Garey, 1975, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing, 4, 397, 10.1137/0204035 Garey, 1979 Icmeli, 1996, Solving the resource constrained project scheduling problem with optimization subroutine library, Computers & Operations Research, 23, 801, 10.1016/0305-0548(95)00074-7 Jozefowska, 2006 Kolisch, 1995, Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science, 41, 1693, 10.1287/mnsc.41.10.1693 Kolisch, 1996, Serial and parallel resource-constrained project scheduling methods revisited: theory and computation, European Journal of Operational Research, 90, 320, 10.1016/0377-2217(95)00357-6 Kolisch, 2006, Experimental evaluation of heuristics for the resource-constrained project scheduling problem: an update, European Journal of Operational Research, 174, 23, 10.1016/j.ejor.2005.01.065 Kolisch, 1997, PSPLIB—a project scheduling library, European Journal of Operational Research, 96, 205, 10.1016/S0377-2217(96)00170-1 Laborie P. Complete MCS-based search: application to resource constrained project scheduling. In: International joint conferences on artificial intelligence, 2005. p. 181–6. Lasserre JB, Queyranne M. Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling, integer programming and combinatorial optimization. In: Proceedings of the 2nd integer programming and combinatorial optimization conference, 1992. p. 136–49. Mingozzi, 1998, An exact algorithm for the multiple resource-constrained project scheduling problem based on a new mathematical formulation, Management Science, 44, 714, 10.1287/mnsc.44.5.714 Carlier, 2003, On linear lower bounds for the resource constrained project scheduling problem, European Journal of Operational Research, 149, 314, 10.1016/S0377-2217(02)00763-4 Pinto, 1995, A continuous time MILP model for short term scheduling of batch plants with pre-ordering constraints, Industrial & Engineering Chemistry Research, 34, 3037, 10.1021/ie00048a015 Pritsker, 1969, Multi-project scheduling with limited resources: a zero-one programming approach, Management Science, 16, 93, 10.1287/mnsc.16.1.93 PSPLIB. 〈http://129.187.106.231/psplib/〉. High-duration RCSPSP instances. 〈http://www2.laas.fr/laas/files/MOGISA/RCPSP-instances/high_duration_range.zip〉. De Reyck, 1996, On the use of the complexity index as a measure of complexity in activity networks, European Journal of Operational Research, 91, 347, 10.1016/0377-2217(94)00344-0 Sabzehparvar, 2007, A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags, Journal of Supercomputing, 44, 257, 10.1007/s11227-007-0158-9 Sprecher, 2000, Solving the RCPSP efficiently at modest memory requirements, Management Science, 46, 710, 10.1287/mnsc.46.5.710.12044 Sprecher, 1995, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, European Journal of Operational Research, 80, 94, 10.1016/0377-2217(93)E0294-8 Uetz M. Algorithms for deterministic and stochastic scheduling. PhD thesis, Technische Universität Berlin; 2001. Zapata, 2008, The multimode resource constrained multiproject scheduling problem: alternative formulations, AIChE Journal, 54, 2101, 10.1002/aic.11522 Zhu, 2006, A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem, INFORMS Journal on Computing, 18, 377, 10.1287/ijoc.1040.0121