CN116468403A - Resource allocation method, equipment and medium - Google Patents
Resource allocation method, equipment and medium Download PDFInfo
- Publication number
- CN116468403A CN116468403A CN202310445664.8A CN202310445664A CN116468403A CN 116468403 A CN116468403 A CN 116468403A CN 202310445664 A CN202310445664 A CN 202310445664A CN 116468403 A CN116468403 A CN 116468403A
- Authority
- CN
- China
- Prior art keywords
- allocation
- resources
- amount
- total amount
- party
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000013468 resource allocation Methods 0.000 title claims abstract description 20
- 230000008569 process Effects 0.000 claims abstract description 21
- 238000009826 distribution Methods 0.000 claims description 12
- 238000003860 storage Methods 0.000 claims description 11
- 239000004973 liquid crystal related substance Substances 0.000 claims description 6
- 238000012797 qualification Methods 0.000 claims description 5
- 238000007726 management method Methods 0.000 claims description 3
- 238000013439 planning Methods 0.000 claims description 3
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063118—Staff planning in a project environment
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a resource allocation method, equipment and medium, wherein the method comprises the following steps: determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party; determining a first amount allocated to each allocation party according to the total amount of resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array; and after the first amounts corresponding to the allocation parties are overlapped, obtaining a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached. In the allocation process, a multi-section allocation mode is adopted, the first round of allocation is realized according to a first amount in proportion, and the second round of allocation is performed on the difference value between the total amount of resources and the first amount in a corresponding mode, so that the allocation precision is improved, and the objective allocation of the remaining small amount of resources can be completed.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a method, an apparatus, and a medium for resource allocation.
Background
For each organization, it is often necessary to allocate some resources, for example, allocate hardware resources such as computers, tables and chairs, allocate software resources such as cloud space and computing power, and allocate human resources such as personnel in departments.
In the conventional allocation process, the principle is generally adopted that the allocation is performed in proportion, but in the allocation mode, the allocation accuracy is difficult to be precise, and a small number of resources are easy to be left in the allocation process and are difficult to objectively and reasonably allocate.
Disclosure of Invention
In order to solve the above problems, the present application proposes a resource allocation method, including:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
In one example, determining, by the total amount of resources and the allocation proportion respectively corresponding to each of the allocation parties, the first amount allocated to each of the allocation parties specifically includes:
for each allocation formula, multiplying the total amount of the resources by an allocation proportion corresponding to the allocation party, and taking the total amount of the resources as a first amount corresponding to the allocation party according to an integer part of the multiplication result.
In one example, according to the integer part of the multiplication result, as the first amount corresponding to the distributor, specifically including:
performing upward rounding and downward rounding on the multiplication result to respectively obtain a first integer part and a second integer part;
and solving a harmonic mean value of the first integer part and the second integer part, and taking the harmonic mean value as a first amount corresponding to the distributor.
In one example, the reconciliation average is taken as the first amount corresponding to the dispenser, and specifically includes:
if the harmonic mean is an integer, taking the harmonic mean as a first amount;
if the harmonic mean is not an integer, the integer nearest to the harmonic mean is taken as the first amount.
In one example, according to the difference between the total amount of resources and the first total amount, sequentially allocating a second amount to each of the allocation parties until the total amount of resources is reached, specifically including:
for each allocation formula, multiplying the total resource amount by the allocation proportion corresponding to the allocation formula, and determining the remainder part corresponding to the multiplication result;
and sequentially distributing resources for each distributor according to the remainder parts corresponding to all the distributors and taking the second amount as a single distribution unit until the total amount of the resources is reached.
In one example, according to the remainder portion corresponding to all the allocation parties, allocating resources for each allocation party in turn with the second amount as a single allocation unit until the total amount of resources is reached, including:
determining remainder parts corresponding to all the distribution parties, and arranging the remainder parts in sequence from big to small;
according to the arrangement sequence, allocating resources for each allocation party in turn by taking a second amount as a single allocation unit, wherein the second amount is the minimum unit in the allocated resources;
and determining that the allocated quantity reaches the difference value between the total quantity of the resources and the first sum, and completing the resource allocation process.
In one example, determining the total amount of resources to be allocated and the allocation party corresponding to the current resource specifically includes:
determining the type of resources to be allocated in the batch and the total amount of the resources based on an enterprise resource planning management system;
and receiving resource reporting requests of all departments in the enterprise, and determining a part with reporting qualification according to the resource types as a distributor corresponding to the current resource.
In one example, according to the resource type, determining a part with declaration qualification as the distributor corresponding to the current resource, the method further includes:
auditing the current resource allocation according to the resource type and the corresponding quantity of the allocation party;
wherein, the auditing process includes:
determining that the resource type accords with a preset resource proportion allocation condition;
and calculating an average value according to the quantity of the total quantity of the resources corresponding to the distributor, and determining that the average value is higher than a preset value.
In another aspect, the present application further proposes a resource allocation device, including:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform operations such as:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
In another aspect, the present application also proposes a non-volatile computer storage medium storing computer-executable instructions configured to:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
The resource allocation method provided by the application can bring the following beneficial effects:
in the allocation process, a multi-section allocation mode is adopted, the first round of allocation is realized according to a first amount in proportion, and the second round of allocation is performed on the difference value between the total amount of resources and the first amount in a corresponding mode, so that the allocation precision is improved, and the objective allocation of the remaining small amount of resources can be completed.
In the second round of distribution process, the objectivity in the second round of distribution process can be ensured through the cooperation between the remainder and the harmonic mean, so that the whole resource distribution process is more reasonable.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute an undue limitation to the application. In the drawings:
fig. 1 is a schematic flow chart of a resource allocation method in an embodiment of the present application;
fig. 2 is a schematic diagram of a resource allocation device in an embodiment of the present application.
Detailed Description
For the purposes, technical solutions and advantages of the present application, the technical solutions of the present application will be clearly and completely described below with reference to specific embodiments of the present application and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The following describes in detail the technical solutions provided by the embodiments of the present application with reference to the accompanying drawings.
As shown in fig. 1, an embodiment of the present application provides a resource allocation method, including:
s101: and determining the total amount of the resources to be allocated and the allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party.
The resources to be allocated can be hardware resources such as computers, tables and chairs, software resources such as cloud space, computing power and the like, personnel resources such as departments and the like.
An allocation formula refers to a party that allocates resources. When the principal initiating the allocation is an enterprise, the allocation party may be each department subordinate to the enterprise. And the ordered array refers to that each distributor is endowed with a corresponding identifier, and the ordered array is generated according to the identifier.
Specifically, when there are resources to be allocated (for example, fixed resource allocation for each month, or resources newly generated by the enterprise), the type of resources to be allocated and the total amount of resources in the batch are determined based on the enterprise resource planning management system (ERP system).
Each department in the enterprise sends a resource declaration request, and a part with declaration qualification is determined according to the resource type and is used as an allocation party corresponding to the current resource. And for a department with a requirement, the department applies for auditing, and the department is subjected to approval to check whether the department needs the resource of the resource type.
After the departments are subjected to preliminary auditing, the resources are subjected to secondary auditing so as to determine whether the resources are required to be distributed by adopting a preset proportion distribution mode. And auditing the current resource allocation according to the resource type and the number corresponding to the allocation party.
Wherein, the auditing process includes: and determining that the resource type meets the preset resource proportion allocation condition, and if the resource type meets the preset resource proportion allocation condition, if the resource type is special, the resource type is only applicable to a few departments, and the resource type does not meet the resource proportion allocation condition. And calculating an average value according to the quantity of the total quantity of the resources and the corresponding quantity of the allocation party, and determining that the average value is higher than a preset value. If the total amount of resources is lower than the preset value, the total amount of resources is too low, and the final allocation amount is very small if the total amount of resources is still allocated according to the proportion, so that the allocation meaning is reduced.
S102: and determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party respectively, and returning the first amount to the ordered array.
The dispensing ratio is preset, which is typically determined in percent form. For each allocation formula, multiplying the total amount of resources by the allocation proportion corresponding to the allocation party, and taking the integral part of the multiplication result as the first amount corresponding to the allocation party. For example, if the total amount of resources is S and the preset allocation ratio of the allocation party is a, the multiplication result is a×s. In some cases, the multiplication result is not an integer, resulting in difficulty in distribution directly from the multiplication result. At this time, let the integer part of a×s be P, and the remainder be Q, and at this time, the first amount is based on the integer part P.
Further, when the first amount is determined, the multiplication result is rounded up and rounded down to obtain a first integer part and a second integer part, respectively, that is, a first integer part p+1 rounded up and a second integer part P rounded down are obtained, respectively. And solving a harmonic mean value of the first integer part and the second integer part, and taking the harmonic mean value as a first amount corresponding to the distributor.
If the harmonic mean is an integer, the first amount is directly used, and if the harmonic mean is not an integer, the first amount is rounded to find the integer nearest to the harmonic mean.
S103: and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
Typically, the first aggregate amount after superimposing the first amount is less than the total amount of resources. Of course, in some cases, the total amount of resources can be equal, and at this point, the allocation can be completed.
If the total amount of the resources is smaller than the total amount of the resources, continuing to allocate the difference value according to the difference value until the difference value is allocated, namely, the total amount of the resources is allocated completely.
Specifically, for each allocation formula, the total amount of resources is multiplied by the allocation ratio corresponding to that allocation formula, and the remainder portion corresponding to the multiplication result, that is, the remainder portion Q above, is determined.
And according to the remainder parts corresponding to all the allocation parties, allocating the resources to each allocation party in turn by taking the second amount as a single allocation unit (namely, allocating only the resources with the second amount corresponding to each time of allocating the resources, wherein the allocation unit is generally 1 in number) until the total amount of the resources is reached.
Further, remainder parts corresponding to all the allocation parties are determined, and the remainder parts are sequentially arranged from large to small. And according to the arrangement sequence, allocating resources for each allocation party in turn by taking a second amount as a single allocation unit, wherein the second amount is the minimum unit in the allocated resources. And determining that the allocated quantity reaches the difference value between the total quantity of the resources and the first sum, and completing the resource allocation process.
In the allocation process, a multi-section allocation mode is adopted, the first round of allocation is realized according to a first amount in proportion, and the second round of allocation is performed on the difference value between the total amount of resources and the first amount in a corresponding mode, so that the allocation precision is improved, and the objective allocation of the remaining small amount of resources can be completed.
In the second round of distribution process, the objectivity in the second round of distribution process can be ensured through the cooperation between the remainder and the harmonic mean, so that the whole resource distribution process is more reasonable.
As shown in fig. 2, the embodiment of the present application further provides a resource allocation device, including:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform operations such as:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
The embodiments of the present application also provide a non-volatile computer storage medium storing computer executable instructions configured to:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
All embodiments in the application are described in a progressive manner, and identical and similar parts of all embodiments are mutually referred, so that each embodiment mainly describes differences from other embodiments. In particular, for the apparatus and medium embodiments, the description is relatively simple, as it is substantially similar to the method embodiments, with reference to the section of the method embodiments being relevant.
The devices and media provided in the embodiments of the present application are in one-to-one correspondence with the methods, so that the devices and media also have similar beneficial technical effects as the corresponding methods, and since the beneficial technical effects of the methods have been described in detail above, the beneficial technical effects of the devices and media are not described in detail herein.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.
Claims (10)
1. A method for resource allocation, comprising:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
2. The method according to claim 1, wherein determining the first amount allocated to each of the allocation parties by the total amount of resources and the allocation ratio respectively corresponding to each of the allocation parties, comprises:
for each allocation formula, multiplying the total amount of the resources by an allocation proportion corresponding to the allocation party, and taking the total amount of the resources as a first amount corresponding to the allocation party according to an integer part of the multiplication result.
3. The method according to claim 2, characterized in that as the first amount corresponding to the dispenser, based on the integer part of the multiplication result, it specifically comprises:
performing upward rounding and downward rounding on the multiplication result to respectively obtain a first integer part and a second integer part;
and solving a harmonic mean value of the first integer part and the second integer part, and taking the harmonic mean value as a first amount corresponding to the distributor.
4. A method according to claim 3, wherein the reconciliation average is taken as the first amount for the dispenser, and specifically comprises:
if the harmonic mean is an integer, taking the harmonic mean as a first amount;
if the harmonic mean is not an integer, the integer nearest to the harmonic mean is taken as the first amount.
5. The method according to claim 1, wherein sequentially allocating a second amount to each of said distributors based on the difference between said total amount of resources and said first total amount until said total amount of resources is reached, in particular comprising:
for each allocation formula, multiplying the total resource amount by the allocation proportion corresponding to the allocation formula, and determining the remainder part corresponding to the multiplication result;
and sequentially distributing resources for each distributor according to the remainder parts corresponding to all the distributors and taking the second amount as a single distribution unit until the total amount of the resources is reached.
6. The method according to claim 5, wherein allocating resources for each of the allocation parties in turn in a single allocation unit of a second amount according to the remainder portion corresponding to all allocation parties until the total amount of resources is reached, specifically comprising:
determining remainder parts corresponding to all the distribution parties, and arranging the remainder parts in sequence from big to small;
according to the arrangement sequence, allocating resources for each allocation party in turn by taking a second amount as a single allocation unit, wherein the second amount is the minimum unit in the allocated resources;
and determining that the allocated quantity reaches the difference value between the total quantity of the resources and the first sum, and completing the resource allocation process.
7. The method of claim 1, wherein determining the total amount of resources to be allocated and the allocation party corresponding to the current resource specifically includes:
determining the type of resources to be allocated in the batch and the total amount of the resources based on an enterprise resource planning management system;
and receiving resource reporting requests of all departments in the enterprise, and determining a part with reporting qualification according to the resource types as a distributor corresponding to the current resource.
8. The method of claim 7, wherein determining a portion with declaration qualification as the current resource-corresponding allocator based on the resource type, the method further comprises:
auditing the current resource allocation according to the resource type and the corresponding quantity of the allocation party;
wherein, the auditing process includes:
determining that the resource type accords with a preset resource proportion allocation condition;
and calculating an average value according to the quantity of the total quantity of the resources corresponding to the distributor, and determining that the average value is higher than a preset value.
9. A resource allocation apparatus, comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform operations such as:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
10. A non-transitory computer storage medium storing computer-executable instructions, the computer-executable instructions configured to:
determining the total amount of resources to be allocated and an allocation party corresponding to the resources, and generating a corresponding ordered array according to the allocation party;
determining a first amount allocated to each allocation party according to the total amount of the resources and the allocation proportion corresponding to each allocation party, and returning the first amount to the ordered array;
and superposing the first amounts corresponding to the allocation parties to obtain a first total amount, and sequentially allocating a second amount to each allocation party according to the difference between the total amount of the resources and the first total amount until the total amount of the resources is reached.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310445664.8A CN116468403A (en) | 2023-04-19 | 2023-04-19 | Resource allocation method, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310445664.8A CN116468403A (en) | 2023-04-19 | 2023-04-19 | Resource allocation method, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116468403A true CN116468403A (en) | 2023-07-21 |
Family
ID=87173198
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310445664.8A Pending CN116468403A (en) | 2023-04-19 | 2023-04-19 | Resource allocation method, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116468403A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051583A (en) * | 2013-01-07 | 2013-04-17 | 宁波大学 | OFDMA (orthogonal frequency division multiple access) resource distribution method based on rate adaption |
| US20150301864A1 (en) * | 2014-04-17 | 2015-10-22 | National Taiwan University | Resource allocation method |
| US20170093741A1 (en) * | 2015-09-29 | 2017-03-30 | International Business Machines Corporation | Hierarchical fairshare of multi-dimensional resources |
| CN108073448A (en) * | 2016-11-15 | 2018-05-25 | 北京金山云网络技术有限公司 | Host resource allocation methods, device, host dispatching method and device |
| CN111523931A (en) * | 2020-04-21 | 2020-08-11 | 广东智源机器人科技有限公司 | Resource allocation method, device, computer equipment and storage medium |
| CN112965792A (en) * | 2021-05-18 | 2021-06-15 | 云宏信息科技股份有限公司 | Method for allocating memory for multiple virtual machines, computer readable storage medium |
| CN113191546A (en) * | 2021-04-29 | 2021-07-30 | 远光软件股份有限公司 | Resource allocation prediction method, resource management device and storage medium |
| WO2021218208A1 (en) * | 2020-04-30 | 2021-11-04 | 中国科学院深圳先进技术研究院 | Resource allocation method and apparatus, storage medium, and electronic device |
| US20210390481A1 (en) * | 2020-06-12 | 2021-12-16 | Google Llc | Allocating Resources |
-
2023
- 2023-04-19 CN CN202310445664.8A patent/CN116468403A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051583A (en) * | 2013-01-07 | 2013-04-17 | 宁波大学 | OFDMA (orthogonal frequency division multiple access) resource distribution method based on rate adaption |
| US20150301864A1 (en) * | 2014-04-17 | 2015-10-22 | National Taiwan University | Resource allocation method |
| US20170093741A1 (en) * | 2015-09-29 | 2017-03-30 | International Business Machines Corporation | Hierarchical fairshare of multi-dimensional resources |
| CN108073448A (en) * | 2016-11-15 | 2018-05-25 | 北京金山云网络技术有限公司 | Host resource allocation methods, device, host dispatching method and device |
| CN111523931A (en) * | 2020-04-21 | 2020-08-11 | 广东智源机器人科技有限公司 | Resource allocation method, device, computer equipment and storage medium |
| WO2021218208A1 (en) * | 2020-04-30 | 2021-11-04 | 中国科学院深圳先进技术研究院 | Resource allocation method and apparatus, storage medium, and electronic device |
| US20210390481A1 (en) * | 2020-06-12 | 2021-12-16 | Google Llc | Allocating Resources |
| CN113191546A (en) * | 2021-04-29 | 2021-07-30 | 远光软件股份有限公司 | Resource allocation prediction method, resource management device and storage medium |
| CN112965792A (en) * | 2021-05-18 | 2021-06-15 | 云宏信息科技股份有限公司 | Method for allocating memory for multiple virtual machines, computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11656901B2 (en) | CPU resource reservation method and apparatus, and related device thereof | |
| US9619827B1 (en) | Flexible resource commitments for computing resources | |
| CN108154298B (en) | Distribution task allocation method and device, electronic equipment and computer storage medium | |
| US20140358710A1 (en) | Market for resources based on reusable usage points and usage periods | |
| CN110333951B (en) | Commodity purchase request distribution method | |
| CN104301257B (en) | A kind of resource allocation methods, device and equipment | |
| CN109005214B (en) | Resource scheduling method and device | |
| CN110636388A (en) | Service request distribution method, system, electronic equipment and storage medium | |
| TW202121274A (en) | Cloud resource management method and apparatus, and electronic device and computer readable storage medium | |
| CN113807944A (en) | Spare payment allocation method and device, electronic equipment and storage medium | |
| CN107147610B (en) | Resource processing method and device | |
| CN104182295A (en) | Data backup method and data backup device | |
| CN111754079A (en) | Agile management-based project research and development method, equipment and medium | |
| CN116468403A (en) | Resource allocation method, equipment and medium | |
| CN111176844A (en) | Real-time online batch optimization method and system for financial data | |
| CN117196757A (en) | Non-spot purchasing method, device, equipment and medium | |
| CN111142975A (en) | State machine persistence method and state machine persistence system | |
| CN113626415B (en) | Credit data output method, equipment and medium | |
| CN111260411B (en) | Resource processing method and device | |
| CN110008441B (en) | Data interaction method and device | |
| CN112561266A (en) | Service request processing method, device, equipment and storage medium | |
| CN106844038B (en) | Method and device for determining resource use authority and resource provision | |
| CN117635044A (en) | Efficient game research and development project management method, system and storage medium | |
| CN111242624A (en) | Removal compensation method, device and medium based on block chain | |
| CN114549042B (en) | Cost sharing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |