Patent ID: 11960932
Assignee: SIEMENS AKTIENGESELLSCHAFT
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 0:
1. A method for resource management, comprising:
providing a representation of a set of resources; and
receiving a set of use requests, wherein a use request is able to be met by allocating a resource to the use request;
wherein the resources are categorized into resource classes so that resources of one resource class are interchangeable for meeting the use request;
wherein the use request is able to be met by allocating the resource of a resource class requested by the use request for a specific period of use requested by the use request;
wherein a target distribution of resources to use requests is determined on a basis of an optimization parameterization;
wherein the optimization parameterization is based on weightings of allocations of resources to use requests;
wherein, to determine the target distribution, a starting solution is created that represents a distribution of resources to use requests, each use request having an allocation to precisely one resource; and
wherein the target distribution is determined from the starting solution by moving one or more allocations from or to at least one resource in one or more movement steps on a basis of an optimization for the optimization parameterization;
wherein to determine the target distribution, the starting solution is taken as a basis for performing movement steps for each of the resources for a number of iterations I, wherein I is at least 1, until an optimization appears on the basis of the optimization parameterization, wherein a resource distribution is determined following progressive coverage of all resources in an iteration;
if an iteration is terminated, the resource distribution is used as the target distribution;
if the iteration is continued, a further optimization is performed in a new iteration based on the resource distribution to achieve an intermediate distribution;
wherein the number of iterations I is dynamically adapted by comparing the optimization parameterization for the resource distribution with a target value, such that a selection of iterations I balances computational effort and optimization;
wherein the performing movement steps includes checking whether there is an optimization for one or more movement steps each time, and if there is an optimization for a step or a chain of steps, the target distribution is changed accordingly so that a changed distribution is taken into consideration for resources considered subsequently.