1. J. Agnèse, N. Bataille, E. Bensana, D. Blumstein and G. Verfaillie, Exact and Approximate methods for the Daily Management of an Earth Observation Satellite, inProc. of the 5th ESA Workshop on Artificial Intelligence and Knowledge Based Systems for Space(1995).
2. T. Benoist and F. Chauvet,Complexity of some FPP related Problems, E-lab Technical Report (2001).
3. Y. Caseau and F. Laburthe, Improved CLP Scheduling with Task Intervals, inProc. of the 11th International Conference on Logic Programming, MIT Press (1994).
4. M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints.SIAM J. Comput.4(1975), 397–411.
5. M.R. Garey and D.S. Johnson,Computers and intractability, a guide to the theory of NP-completeness. W.H. Freeman, New York (1979).