1. Bonsma, E., Gerez, S.: A genetic approach to the overlapped scheduling of iterative data-flow graphs for target architectures with communication delays. In: ProRISC Workshop on Circuits, Systems and Signal Processing, 1997
2. Brucker, P., Kampmeyer, T.: Tabu search algorithms for cyclic machine scheduling problems. J. Sched. 8(4), 303–322 (2005)
3. Celoxica Ltd.: Platform Developers Kit: Pipelined Floating-point Library Manual (2004). http://www.celoxica.com
4. Dongen, V.H., Gao, G.R.: A polynomial time method for optimal software pipelining. Lect. Not. Comput. Sci. 634, 613–624 (1992)
5. Dupont de Dinechin, B.: Time-indexed formulations and a large neighborhood search for the resource-constrained modulo scheduling problem. In: MISTA’2007, 3rd Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, August 2007