Scheduling real-time tasks: Algorithms and complexity, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 2003. ,

The complexity of periodic maintenance, Proceedings of the International Computer Symposium, pp.315-320, 1990. ,

Feasibility problems for recurring tasks on one processor, Theor. Comput. Sci, vol.118, issue.1, pp.3-20, 1993. ,

Feasibility analysis of sporadic real-time multiprocessor task systems, Algorithmica, vol.63, issue.4, pp.763-780, 2012. ,

The complexity of unique k-sat: An isolation lemma for k-cnfs, Journal of Computer and System Sciences, vol.74, issue.3, pp.386-393, 2008. ,

General schedulers for the pinwheel problem based on double-integer reduction, IEEE Transactions on Computers, vol.41, issue.6, pp.755-768, 1992. ,

Schedulers for larger classes of pinwheel instances, Algorithmica, vol.9, issue.5, pp.425-462, 1993. ,

Thirty years of inventory routing, Transportation Science, vol.48, issue.1, pp.1-19, 2013. ,

Charlemagne's challenge: The periodic latency problem, Operations Research, vol.59, issue.3, pp.674-683, 2011. ,

Exponential time complexity of the permanent and the tutte polynomial, ACM Transactions on Algorithms, vol.10, issue.4, 2014. ,

Scheduling periodic tasks in a hard real-time environment, Proceedings of the 37th International Colloquium on Automata, Languages, and Programming, pp.299-311, 2010. ,

Schedulability analysis of a graph-based task model for mixed-criticality systems, Real-Time Systems, vol.52, issue.1, pp.1-37, 2016. ,

A tight bound on approximating arbitrary metrics by tree metrics, Journal of Computer and System Sciences, vol.69, issue.3, pp.485-497, 2004. ,

Pinwheel scheduling: Achievable densities, Algorithmica, vol.34, issue.1, pp.14-38, 2002. ,

Approximation algorithms for some routing problems, Proceedings of the 17th International Symposium on Foundations of Computer Science, pp.216-227, 1976. ,

Computers and intractability: A guide to the theory of NP-completeness, 1979. ,

Bamboo garden trimming problem, SOFSEM, pp.229-240, 2017. ,

URL : https://hal.archives-ouvertes.fr/hal-01428882

The pinwheel: A real-time scheduling problem, Proceedings of the 22th Annual Hawaii International Conference on System Sciences, vol.2, pp.693-702, 1989. ,

, A new perspective on the windows scheduling problem, 2014.

A nearly best-possible approximation algorithm for node-weighted steiner trees, Journal of Algorithms, vol.19, issue.1, pp.104-115, 1995. ,

Algorithms and complexity of the periodic maintenance problem. Microprocessing and Microprogramming, vol.27, pp.657-664, 1989. ,