J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, CP 2004, pp.238-252, 1962.
DOI : 10.1007/BF01386316

C. Ekelin, An Optimization Framework for Scheduling of Embedded Real-Time Systems, 2004.

E. Ferro, R. Cayssials, and J. Orozco, Tuning the Cost Function in a Genetic/Heuristic Approach to the Hard Real-Time Multitask- Multiprocessor Assignment Problem, Proceeding of the Third World Multiconference on Systemics Cybernetics and Informatics, pp.143-147, 1999.

J. Goossens and C. Macq, Limitation of the hyper-period in real-time periodic task set generation, Proceedings of the RTS Embedded System conference (RTS'01), pp.133-147, 2001.

J. N. Hooker and G. Ottosson, Logic-based benders decomposition, Mathematical Programming, pp.33-60, 2003.
DOI : 10.1007/s10107-003-0375-9
URL : http://ba.gsia.cmu.edu/jnh/benders.ps

U. Junker, Quickxplain : Conflict detection for arbitrary constraint propagation algorithms, IJCAI'01 Workshop on Modelling and Solving problems with constraints (CONS- 1), 2001.

E. L. Lawler, Recent Results in the Theory of Machine Scheduling Mathematical Programming : The State of the Art, pp.202-233, 1983.

J. Y. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, issue.4, pp.237-250, 1982.
DOI : 10.1016/0166-5316(82)90024-4

M. Mutka and J. Li, A tool for allocating periodic real-time tasks to a set of processors, Journal of Systems and Software, vol.29, issue.2, pp.135-164, 1995.
DOI : 10.1016/0164-1212(94)00071-T

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP 2004, pp.556-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1328

P. Richard, Polynomial-time approximate schedulability tests for fixed-priority real-time tasks : Some numerical experimentations, 14th Int. Conf. on Real-Time and Network Systems, pp.191-199, 2006.

K. Schild and J. Würtz, Scheduling of timetriggered real-time systems, Constraints, vol.5, issue.4, pp.335-357, 2000.
DOI : 10.1023/A:1009804226473

K. Tindell, A. Burns, and A. Wellings, Allocating hard real-time tasks: An NP-Hard problem made easy, Real-Time Systems, vol.33, issue.3, pp.145-165, 1992.
DOI : 10.1007/BF00365407
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.6114

K. Tindell, H. Hansson, and A. Wellings, Analysis of real-time communications : controller area network (can), 15th IEEE Real-Time Systems Symposium (RTSS 1994), pp.259-265, 1994.

L. Vargas and R. Olivaira, Empirical study of tabu search, simulated annealing and multistart in field bus scheduling, IEEE Conference on Emerging Technologies and Factory Automation ETFA, pp.101-108, 2005.