A method of planning a set N of requests for services competing for the allocation of M resources with identical characteristics, wherein each service i has to be rendered continuously over a time interval included in a period, said requests for services are divided into groups, each service is rendered by the use of an undifferentiated resource, which resources can render the service i during predefined time intervals known as intervals of potential use, said resources are divided into subsets, a resource is able to render only one service at a time, the requests for services of the same group cannot be rendered by resources belonging to the same subset, the passage from the use of one resource to the next necessitates the simultaneous use of two resources during a minimum duration, a released resource cannot be reused immediately, to determine sequences of resources whose use guarantees at least two continuous services over said period, a graph of intervals is determined for each request for service, each node consists of an interval of potential use of a resource and each line consists of a handover from one resource to another, and, for each request for service, said disjoint node paths are determined in said graph.