CROSS cyclic resource-constrained scheduling solver

Artigues, 2010, Resource-constrained Project Scheduling M. Ayala, C. Artigues, On integer linear programming formulations for the resource-constrained modulo scheduling problem, Technical Report 10393, LAAS-CNRS, Toulouse, France, 2010. Baptiste, 2001 Beldiceanu, 2006, Sweep synchronization as a global propagation mechanism, Comput. Oper. Res., 33, 2835, 10.1016/j.cor.2005.01.013 Bhattacharyya, 2009 Blachot, 2006, SCAN: A heuristic for near-optimal software pipelining, 289 Bonfietti, 2010, An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms, 897 Brucker, 2005, Tabu search algorithms for cyclic machine scheduling problems, J. Sched., 303, 10.1007/s10951-005-1639-4 Brucker, 2008, A general model for cyclic machine scheduling problems, Discrete Appl. Math., 156, 2561, 10.1016/j.dam.2008.03.029 Chen, 1998, Cyclic scheduling of a hoist with time window constraints, IEEE Trans. Robot. Autom., 14, 144, 10.1109/70.660860 Codina, 2002, A comparative study of modulo scheduling techniques, 97 Dasdan, 2004, Experimental analysis of the fastest optimum cycle ratio and mean algorithms, ACM Trans. Des. Autom. Electron. Syst., 9, 385, 10.1145/1027084.1027085 Draper, 1999, Cyclic scheduling, 1016 Dupont de Dinechin, 2004, From machine scheduling to VLIW instruction scheduling, ST J. Res., 1, 1 Eichenberger, 1997, Efficient formulation for optimal modulo schedulers, ACM SIGPLAN Not., 32, 194, 10.1145/258916.258933 Georgiadis, 2009, An experimental study of minimum mean cycle algorithms, 1 Ghamarian, 2006, Liveness and boundedness of synchronous data flow graphs, 68 Hagog, 2004, Swing modulo scheduling for gcc, 55 Hanen, 1994, Study of a NP-hard cyclic scheduling problem: The recurrent job-shop, Eur. J. Oper. Res., 72, 82, 10.1016/0377-2217(94)90332-8 Huff, 1993, Lifetime-sensitive modulo scheduling, 258 Ito, 1995, Determining the minimum iteration period of an algorithm, J. VLSI Signal Process., 244, 229, 10.1007/BF02107055 Kudlur, 2008, Orchestrating the execution of stream programs on multicore platforms, 114 Le Pape, 1994, Time-versus-capacity compromises in project scheduling Lee, 1987, Static scheduling of synchronous data flow programs for digital signal processing, IEEE Trans. Comput., 36, 24, 10.1109/TC.1987.5009446 Levner, 2010, Complexity of cyclic scheduling problems: A state-of-the-art survey, Comput. Ind. Eng., 59, 352, 10.1016/j.cie.2010.03.013 Llosa, 1996, Swing modulo scheduling: A lifetime-sensitive approach, 80 Llosa, 2001, Lifetime-sensitive modulo scheduling in a production environment, IEEE Trans. Comput., 50, 234, 10.1109/12.910814 Lombardi, 2011, Precedence constraint posting for cyclic scheduling problems, 137 Lombardi, 2012, A min-flow algorithm for minimal critical set detection in resource constrained project scheduling, Artif. Intell., 182–183, 58, 10.1016/j.artint.2011.12.001 McCormick, 1991, Transient behavior in a flexible assembly system, Int. J. Flex. Manuf. Syst., 3, 27, 10.1007/BF00167524 McCormick, 1994, Some complexity results in cyclic scheduling, Math. Comput. Model., 20, 107, 10.1016/0895-7177(94)90210-0 Parhi, 1989, Rate-optimal fully-static multiprocessor scheduling of data-flow signal processing programs, 1923 Parhi, 1991, Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding, IEEE Trans. Comput., 40, 178, 10.1109/12.73588 Policella, 2007, From precedence constraint posting to partial order schedules: A csp approach to robust scheduling, AI Commun., 20, 163 Rau, 1994, Iterative modulo scheduling: An algorithm for software pipelining loops, 63