CN109636097A - A kind of distribution method and device of product design task - Google Patents
A kind of distribution method and device of product design task Download PDFInfo
- Publication number
- CN109636097A CN109636097A CN201811294370.5A CN201811294370A CN109636097A CN 109636097 A CN109636097 A CN 109636097A CN 201811294370 A CN201811294370 A CN 201811294370A CN 109636097 A CN109636097 A CN 109636097A
- Authority
- CN
- China
- Prior art keywords
- product
- allocated
- task
- design
- processing node
- 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.)
- Granted
Links
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/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
-
- 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/06316—Sequencing of tasks or work
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses the distribution method and device of a kind of product design task.Wherein, which comprises obtain multiple product design tasks to be allocated of single in-process, each product design task to be allocated is divided into each process in advance；Each processing node that multiple product design tasks to be allocated are assigned to the single process is handled according to preset task allocation rule；Wherein, each processing node one per treatment product design task to be allocated.Described device is for executing the above method.The distribution method and device of product design task provided by the invention to be allocated product design task to be treated to single in-process can be distributed automatically automatically, improve the allocative efficiency of product design task.
Description
Technical field
The present invention relates to technical field of information processing, and in particular to a kind of distribution method and device of product design task.
Background technique
The modular design method of product can be such that product design simplifies, improve the design efficiency of product, answer extensively
For industries such as rail traffic, automobile, electrotechnical, electronic, buildings.
In the prior art, for each process can be divided into and each process is there are the product to be designed of sequencing,
Designer can be distributed to using each product to be designed as design objective in each process by total and fractional task assignment method
Member is handled.Using total and fractional task assignment method, each product to be designed usually requires to pass through in the distribution of each in-process
Chief designer and director designer are crossed, product to be designed is distributed to director designer by chief designer, and director designer again will be upper
It states product to be designed and distributes to conventional design teacher.When facing more product to be designed, chief designer and director designer's
Distribution task is heavy, reduces product to be designed in the allocative efficiency of each process.
Therefore, the distribution method for how proposing a kind of product design task, production that can automatically to each process is divided into
Product design objective is allocated, and the allocative efficiency for improving product design task becomes industry important topic urgently to be resolved.
Summary of the invention
For the defects in the prior art, the present invention provides the distribution method and device of a kind of product design task.
On the one hand, the present invention proposes a kind of distribution method of product design task, comprising:
Multiple product design tasks to be allocated of single in-process are obtained, each product design task to be allocated is preparatory
It is divided into each process；
Multiple product design tasks to be allocated are assigned to the single process according to preset task allocation rule
Each processing node is handled；Wherein, each processing node one per treatment product design task to be allocated.
On the other hand, the present invention provides a kind of distributor of product design task, comprising:
Acquiring unit, obtains multiple product design tasks to be allocated of single in-process, and each product to be allocated is set
Meter task is divided into each process in advance；
Allocation unit, for multiple product design tasks to be allocated to be assigned to institute according to preset task allocation rule
The each processing node for stating single process is handled；Wherein, each the processing node one per treatment it is described to be allocated
Product design task.
In another aspect, the present invention provides a kind of electronic equipment, including memory, processor and storage are on a memory and can
The computer program run on a processor, the processor realize that product described in above-described embodiment is set when executing described program
The step of distribution method of meter task.
Another aspect, the present invention provide a kind of non-transient computer readable storage medium, are stored thereon with computer program,
The computer program realizes the step of distribution method of product design task described in above-described embodiment when being executed by processor.
The distribution method and device of product design task provided by the invention, since the multiple of single in-process can be obtained
Product design task to be allocated, and multiple product design tasks to be allocated are assigned to by each place according to preset task allocation rule
Reason node is handled, and one per treatment product design task to be allocated of each processing node can be automatically to single process
Interior product design task to be allocated to be treated is distributed automatically, improves the allocative efficiency of product design task.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is the flow diagram of the distribution method for the product design task that one embodiment of the invention provides；
Fig. 2 be another embodiment of the present invention provides product design task distribution method flow diagram；
Fig. 3 is the flow diagram of the distribution method for the product design task that yet another embodiment of the invention provides；
Fig. 4 is the flow diagram of the distribution method for the product design task that further embodiment of this invention provides；
Fig. 5 is the flow diagram of the distribution method for the product design task that a further embodiment of the present invention provides；
Fig. 6 is the structural schematic diagram of the distributor for the product design task that one embodiment of the invention provides；
Fig. 7 is the entity structure schematic diagram for the electronic equipment that one embodiment of the invention provides.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached in the embodiment of the present invention
Figure, technical solution in the embodiment of the present invention are explicitly described, it is clear that described embodiment is a part of the invention
Embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making wound
Every other embodiment obtained under the premise of the property made labour, shall fall within the protection scope of the present invention.
Fig. 1 is the flow diagram of the distribution method for the product design task that one embodiment of the invention provides, such as Fig. 1 institute
Show, the distribution method of product design task provided by the invention, comprising:
S101, the multiple product design tasks to be allocated for obtaining single in-process, each product design to be allocated are appointed
Business is divided into each process in advance；
Specifically, for being divided into the product design task to be allocated of each process, the distribution of product design task
Device (hereinafter referred to as task allocation apparatus) can obtain the product design task to be allocated, and the product design to be allocated is appointed
Business can be treated separately in the in-process.Wherein, the product design task to be allocated can be production to be designed
Each process of product, the product design task to be allocated has preset ordinal relation, the product to be allocated
For design objective after a process is completed, next process is arrived in circulation.
S102, multiple product design tasks to be allocated are assigned to by each processing section according to preset task allocation rule
Point is handled；Wherein, each processing node one per treatment product design task to be allocated.
Specifically, the single process may include multiple processing nodes, and the task allocation apparatus is obtaining multiple institutes
It, can be according to preset task allocation rule by multiple product design tasks to be allocated after stating product design task to be allocated
Each processing node is assigned to be handled.Wherein, each one per treatment product to be allocated of the processing node is set
Meter task.It will be appreciated that the processing node can be when the product design task to be allocated is product to be designed
It is equipped with computer and the design station of designer, plug-in unit is installed and designed on computer, the design plug-in unit is for receiving institute
State product design task to be allocated.
For example, if the preset task allocation rule includes: the quantity Z that the product design task to be allocated is known in judgement
Greater than the quantity M of the processing node, then the Z product design tasks to be allocated is divided into the product design to be allocated of M group and appointed
Business, product design task to be allocated described in every group includes at least one described product design task to be allocated；It is to be allocated according to M group
Every group of product design task to be allocated obtains single processing in the deadline of each processing node in product design task
The longest finishing time of node, and the single processing node is obtained according to the longest finishing time of the single processing node
Deadline threshold value；It is that the M group product design task to be allocated distributes the processing node according to default allocation rule, obtains
Task allocation plan；If judgement knows that the task completion time of each processing node in the task allocation plan is both less than
Or be equal to the deadline threshold value, then multiple product design tasks to be allocated are divided according to the task allocation plan
Corresponding processing node is fitted on to be handled；Otherwise, task allocation plan, Zhi Daochong are regained using branch and bound method
When the task completion time of each processing node is both less than or is equal to the completion in the task allocation plan newly obtained
Between threshold value.
The distribution method of product design task provided by the invention, since the multiple to be allocated of single in-process can be obtained
Product design task, and multiple product design tasks to be allocated are assigned to by each processing node according to preset task allocation rule
It is handled, one per treatment product design task to be allocated of each processing node, single in-process can be needed automatically
The product design task to be allocated of processing is distributed automatically, improves the allocative efficiency of product design task.
Fig. 2 be another embodiment of the present invention provides product design task distribution method flow diagram, such as Fig. 2 institute
Show, on the basis of the various embodiments described above, further, the preset task allocation rule includes:
If S201, judgement know that the quantity Z of the product design task to be allocated is greater than the quantity M of the processing node,
The Z product design tasks to be allocated are then divided into M group product design task to be allocated, product design to be allocated described in every group
Task includes at least one described product design task to be allocated；
Specifically, the task allocation apparatus can obtain the quantity Z and the list of the product design task to be allocated
The quantity M that node is handled described in a in-process, by the number of the quantity Z of the product design task to be allocated and the processing node
Amount M is compared, if the quantity Z of the product design task to be allocated is greater than the quantity M of the processing node, by Z
A product design task to be allocated is divided into M group product design task to be allocated, every group in M group product design task to be allocated
Product design task to be allocated includes at least one described product design task to be allocated.It will be appreciated that Z and M is positive integer.
For example, the task allocation apparatus is set Z product design tasks to be allocated are divided into M group product to be allocated
When meter task, the product design task to be allocated with same task attribute is preferentially divided into one group and does not have identical
The product design task to be allocated of business attribute is individually for one group, obtains N group product design task to be allocated；Wherein, described
The task attribute of product design task to be allocated is preset；Then after judgement knows that N is greater than M, according to the production to be allocated of N group
In product design objective the deadline of every group of product design task to be allocated it is ascending be ranked up, obtain ranking results；Again
N group product design task merging to be allocated is set at M group product to be allocated according to the ranking results and default merging rule
Meter task.
S202, according to every group of product design task to be allocated in M group product design task to be allocated in each processing
The deadline of node obtains the longest finishing time of single processing node, and complete according to the maximum of the single processing node
The deadline threshold value of the single processing node is obtained at the time；
Specifically, the task allocation apparatus is after obtaining M group product design task to be allocated, calculate every group it is to be allocated
The workload of product design task, due to one per treatment product design task to be allocated of the processing node, every group
The deadline of product design task to be allocated is equal to each production to be allocated that every group of product design task to be allocated includes
The sum of the expected workload of product design objective.The task allocation apparatus, which can calculate, obtains M group product design task to be allocated
In every group of product design task to be allocated in the deadline of each processing node, in M group product design task to be allocated
Every group of product design task to be allocated is equal to every group of product design task to be allocated in the deadline of each processing node
Workload divided by it is each it is described processing node working efficiency, then by product design to be allocated task described in each group each
The deadline of the processing node is compared, and can obtain product design task to be allocated described in each group at each place
The maximum value in the deadline of node is managed, the maximum value of above-mentioned deadline is completed as single the maximum of processing node
Time.The longest finishing time of the single processing node multiplied by magnification ratio coefficient, is obtained institute by the task allocation apparatus
The deadline threshold value of single processing node is stated, the magnification ratio coefficient is configured based on practical experience, and the present invention is implemented
Example is without limitation.Wherein, the expected workload of the product design task to be allocated is preset, the work of the processing node
Efficiency is preset.
For example, the task allocation apparatus obtains the wherein one group of product design to be allocated of M group product design task to be allocated
Task includes product design task a to be allocated and product design task b to be allocated, the estimated work of product design task a to be allocated
Work amount is 70 working hours, and the expected workload of product design task b to be allocated is 50 working hours.If there is processing node A, processing
Node B and processing node C carries out task distribution, and the working efficiency of processing node A per hour, handles node B's for 10 working hours
Working efficiency be 8 working hours per hour, processing node C working efficiency be 12 working hours per hour.So group production to be allocated
The expected workload that the workload of product design objective is product design task a to be allocated is pre- with product design task b's to be allocated
The sum of workload: 70+50=120 working hour is counted, group product design task to be allocated is in the deadline of processing node A
120/10=12 hours, group product design task to be allocated was 120/8=15 hours in the deadline of processing node B, should
Group product design task to be allocated is 120/12=10 hours in the deadline of processing node B.
S203, it is that the M group product design task to be allocated distributes the processing node according to default allocation rule, obtains
Task allocation plan；
Specifically, the task allocation apparatus is according to the product design task distribution to be allocated of preset rules M group
Handle node, obtain task allocation plan, the task allocation plan include the M group product design task to be allocated and respectively
The group corresponding processing node of product design task to be allocated.
Appoint for example, the task allocation apparatus obtains every group of product design to be allocated in M group product design task to be allocated
It is engaged in the deadline of each processing node；Wherein, each deadline is obtained based on study efficacy, that is, calculated
The influence that learning efficiency is considered when the deadline, when the task in the processing consecutive identical task attribute of node processing
When, the deadline can be reduced；Then by every group of product design task to be allocated in M group product design task to be allocated,
It is assigned to the deadline least processing node.
If S204, judgement know that the task completion time of each processing node in the task allocation plan is both less than
Or be equal to the deadline threshold value, then multiple product design tasks to be allocated are divided according to the task allocation plan
Corresponding processing node is not assigned to be handled；Otherwise, task allocation plan is regained using branch and bound method, directly
Into the task allocation plan regained, the task completion time of each processing node is both less than or equal to described complete
At time threshold.
Specifically, the task allocation apparatus calculates the task distribution side after obtaining the task allocation plan
The task completion time of each processing node in case, the task completion time of each processing node, which is equal to, is assigned to institute
The sum of the expected workload for stating each product design task to be allocated of processing node is imitated divided by the work of the processing node
Rate.If the task completion time of each processing node is both less than or is equal to the deadline threshold value, according to
Multiple product design tasks to be allocated are separately dispensed into corresponding processing node and carried out by the task allocation plan
Processing.It is greater than the deadline threshold value if there is the task completion time of a processing node, then using branch
Demarcation method regains task allocation plan, i.e., the product to be allocated distributed maximum task completion time alignment processing node
The product design task to be allocated that design objective and minimum task deadline alignment processing node are distributed, it is complete in maximum task
Distribution is re-started between time alignment processing node and minimum task deadline alignment processing node, it is described most with reduction
Big task completion time, for example, the product to be allocated that can be distributed from the maximum task completion time alignment processing node
Design objective selects a product design task to be allocated, distributes to minimum task deadline alignment processing node.Described
After business distributor will regain task allocation plan, each processing node in the task allocation plan that regains
Task completion time, by the task allocation plan regained it is each it is described processing node task completion time with it is described
Deadline threshold value is compared, if the task of each processing node is completed in the task allocation plan regained
Between both less than or be equal to the deadline threshold value, then will be multiple described wait divide according to the task allocation plan that regains
Each processing node is assigned to product design task to be handled.If existed in the task allocation plan regained
The task completion time of one processing node is greater than the deadline threshold value, divides then repeating the above-mentioned task that regains
Process with scheme, until the task completion time of the processing node each in the task allocation plan regained is both less than
Or it is equal to the deadline threshold value.
Fig. 3 be another embodiment of the present invention provides product design task distribution method flow diagram, such as Fig. 3 institute
Show, it is further, described that the Z product design tasks to be allocated are divided into M group wait divide on the basis of the various embodiments described above
Include: with product design task
S2011, preferentially by the product design task to be allocated with same task attribute be divided into one group and there are
The product design task to be allocated of same task attribute is individually for one group, obtains N group product design task to be allocated；Its
In, the task attribute of the product design task to be allocated is preset；
Specifically, for product design task, it is carried out continuously the product design to be allocated of same task attribute
Task can keep higher working efficiency, preferentially be assigned to the product design task to be allocated of same task attribute together
One processing node is conducive to the efficiency for improving product design.The task allocation apparatus is set to the Z products to be allocated
When meter task is grouped, the product design task to be allocated with same task attribute is preferentially divided into one group, it will not
The product design task to be allocated with same task attribute is individually for one group, can obtain the product design to be allocated of N group
Task.It will be appreciated that N is positive integer.
For example, according to learning curve effect, if product design task to be allocated described in the processing node processing is complete
It is T at the time, when the product design task to be allocated of described processing m same task attribute of node continuous processing, the place
The deadline for managing m-th of node processing product design task to be allocated is Tbm-1, wherein b is the constant of study efficacy, and b is big
In 0 and less than 1, it is configured based on practical experience, the embodiment of the present invention is without limitation.
If S2012, judgement know that N is greater than M, set according to every group of product to be allocated in N group product design task to be allocated
Meter task it is each it is described processing node minimum completion time it is ascending be ranked up, obtain ranking results；
Specifically, the Z product design tasks to be allocated are being divided into N group product to be allocated by the task allocation apparatus
After design objective, N is compared with M, if N is greater than M, calculates in N group product design task to be allocated and wait for for every group
It distributes the deadline in each processing node of product design task, then exists from every group of product design task to be allocated
The minimum value that the above-mentioned deadline is obtained in the deadline of each processing node, obtains every group of product design to be allocated and appoints
The minimum completion time in each processing node of business, it is then right according to the ascending sequence of the minimum completion time
N group product design task to be allocated is ranked up, and obtains ranking results, and the ranking results may include when completing according to minimum
Between ascending sequence N group product design task to be allocated and corresponding minimum completion time.
S2013, according to the ranking results and default merge rule for N group product design task merging to be allocated into M
Group product design task to be allocated.
Specifically, it since N is greater than M, needs to set N-M group product design task merging to be allocated to M group product to be allocated
In meter task, to obtain M group product design task to be allocated.The task allocation apparatus can be according to default merging rule, by N
Group product design task merging to be allocated is at M group product design task to be allocated.
For example, the default merging rule includes: if that N-M is less than or equal to M, before sorting in the ranking results
The each group of N-M product design task to be allocated is reversed, N-M group product to be allocated before removing from the ranking results
Design objective obtains remaining ranking results, and each group that N-M before sorting is obtained from the remaining ranking results waits for point
With product design task, by preceding N-M in the N-M group reversed product design task to be allocated and the remaining ranking results
Group product design task to be allocated, according to rank order, one-to-one correspondence is merged, to obtain the product design to be allocated of M group
Task；If N-M is greater than M, each group product design task to be allocated of M carries out backward row before sorting in the ranking results
Column, M group product design task to be allocated before removing from the ranking results, obtain the remaining ranking results, from residue
The ranking results in obtain sort before M each group product design task to be allocated, the M group product to be allocated that will be reversed
Preceding M group product design task to be allocated in design objective and the remaining ranking results, according to rank order, correspond into
Row merges, and obtains M group product design task to be allocated, does not join according to the M group product design task to be allocated for merging acquisition and
With combined N-2M group product design task to be allocated, T group product design task to be allocated is obtained, and to T group product to be allocated
Design objective obtain T group every group of product design task product design task to be allocated to be allocated each processing node most
Then the small deadline is ranked up according to the ascending sequence of above-mentioned minimum completion time, regains ranking results,
In, T=N-M.Product design task to be allocated for T group repeats N-M and is less than or equal to M if T-M is less than or equal to M
When corresponding product design task to be allocated treatment process, M group product design task to be allocated can be exported；If T-M is big
In M, repeat N-M greater than M when corresponding product design task to be allocated treatment process, regain T group product to be allocated
Design objective, until the T regained meets T-M less than or equal to M.
It is further, described to be waited for according to every group in M group product design task to be allocated on the basis of the various embodiments described above
Product design task is distributed in the deadline of each processing node, obtains the longest finishing time packet of single processing node
It includes:
According to every group of product design task to be allocated in M group product design task to be allocated in each processing node
Deadline and Hungary Algorithm obtain M group product design task to be allocated being assigned to the first of the M processing nodes
Allocation result, and the single longest finishing time for handling node is obtained according to first allocation result.
Specifically, the task allocation apparatus can obtain every group of product to be allocated in M group product design task to be allocated
The expected workload for each product design task to be allocated that design objective includes, in M group product design task to be allocated
Every group of product design task to be allocated is equal to every group of product design task to be allocated in the deadline of a processing node
Including the sum of the expected workload of each product design task to be allocated divided by above-mentioned processing node working efficiency.Institute
State task allocation apparatus can calculate obtain M group product design task to be allocated in every group of product design task to be allocated each
The deadline of the processing node, it is then based on every group of product design task to be allocated in M group product design task to be allocated
It deadline and Hungary Algorithm in each processing node, obtains and M group product design task to be allocated is assigned to M
First allocation result of a processing node, first allocation result includes every group in M group product design task to be allocated
Product design task to be allocated and its corresponding processing node.The task allocation apparatus is based on first allocation result, can
To calculate the time used in one group of product design task to be allocated of each processing node processing distribution, obtain each described
The maximum value for handling the time used in one group of product design task to be allocated of node processing distribution is saved as the single processing
The longest finishing time of point.Wherein, the product design task to be allocated is default in the expected workload of the processing node
, the working efficiency of the processing node is preset.
Appoint for example, the task allocation apparatus is based on every group of product design to be allocated in M group product design task to be allocated
It the deadline and Hungary Algorithm being engaged in each processing node, obtains and distributes M group product design task to be allocated
When first allocation result for handling node a to M, it can regard as and M group product design task to be allocated is assigned at M
The assignment problem for managing node, can be according to every group of product design task to be allocated in M group product design task to be allocated each
The deadline construction complete time matrix of the processing node, YzrFor an element of deadline matrix, indicate z group to
Distribute the deadline that product design task handles node at r-th, wherein z and r is positive integer, and z and r are both less than or wait
In M, above-mentioned deadline matrix is handled using Hungary Algorithm, task allocation matrix, the task point can be obtained
It is 0-1 matrix, the element representation for being 1 in the task allocation matrix, by 1 corresponding product design task to be allocated point with matrix
1 corresponding processing node is fitted on to be handled.Wherein, specific mistake deadline matrix handled using Hungary Algorithm
Journey is the prior art, herein without repeating.
Fig. 4 is the flow diagram of the distribution method for the product design task that further embodiment of this invention provides, such as Fig. 4 institute
Show, on the basis of the various embodiments described above, further, the basis presets allocation rule and includes:
Every group of product design task to be allocated is in each processing in S2031, acquisition M group product design task to be allocated
The deadline of node；Wherein, each deadline is obtained based on study efficacy；
Specifically, the task allocation apparatus can obtain every group of product to be allocated in M group product design task to be allocated
The expected workload for each product design task to be allocated that design objective includes, in M group product design task to be allocated
Every group of product design task to be allocated is equal to every group of product design task to be allocated in the deadline of a processing node
Including the sum of the expected workload of each product design task to be allocated divided by above-mentioned processing node working efficiency.?
The influence for calculating each deadline consideration learning efficiency, if one group of product design task to be allocated includes multiple continuous
The product design task to be allocated of same task attribute, then consecutive identical of m-th of group product design task to be allocated
The product design task to be allocated of business attribute is Tb in the deadline of the processing nodem-1, wherein T is the production to be allocated
For product design objective in the deadline of the processing node, b is the constant of study efficacy, and b is greater than 0 and less than 1.It is described to be allocated
Product design task is removed in the expected workload that the deadline of the processing node is equal to the product design task to be allocated
With the working efficiency of the processing node.Wherein, the expected workload of the product design task to be allocated is preset, described
It is preset for handling the working efficiency of node.
S2032, by every group of product design task to be allocated in M group product design task to be allocated, be assigned to the deadline
The least processing node.
Specifically, the task allocation apparatus every group of product to be allocated in obtaining M group product design task to be allocated is set
Meter task is after the deadline of each processing node, by every group of production to be allocated in M group product design task to be allocated
Product design objective is compared in the deadline of each processing node, and every group of product design task to be allocated is assigned to
The deadline least processing node.
For example, the task allocation apparatus obtains three groups of product design tasks to be allocated: the 1st group of product design to be allocated is appointed
Business, the 2nd group of product design task to be allocated and the 3rd group of product design task to be allocated, need three groups of product designs to be allocated
Task is assigned to three processing nodes: processing node A, processing node B and processing node C.The task allocation apparatus obtains the 1st
Group product design task to be allocated is 50 hours in the deadline of processing node A, and the task allocation apparatus obtains the 1st group and waits for
It is 45 hours that product design task, which is distributed, in the deadline of processing node B, and described the 1st group of task allocation apparatus acquisition to be allocated
Product design task is 48 hours in the deadline of processing node C, since the 1st group of product design task to be allocated is saved in processing
The deadline of point B is minimum, and the 1st group of product design task to be allocated is assigned to processing node B.Similarly, it is waited for using with the 1st group
Assigning process as distributing product design task class, by the 2nd group of product design task to be allocated and the 3rd group of product design to be allocated
Task is assigned to corresponding processing node.
On the basis of the various embodiments described above, further, the preset task allocation rule further include:
If judgement knows that the quantity Z of the product design task to be allocated is less than or equal to the quantity of the processing node
The task attribute of M and each product design task to be allocated is different, then according to each product design to be allocated
Deadline and Hungary Algorithm of the task in each processing node, by the Z product design tasks to be allocated point
The M processing nodes are fitted on to be handled；Wherein, the task attribute of the product design task to be allocated is preset.
Specifically, the task allocation apparatus is by the quantity Z of the product design task to be allocated and the processing node
Quantity M be compared, while the task attribute of more each product design task to be allocated, if the production to be allocated
The quantity Z of product design objective is less than or equal to the quantity M of the processing node and each product design task to be allocated
Task attribute it is different, then the task allocation apparatus can obtain each product design task to be allocated each
The deadline of a processing node, the product design task to be allocated are equal to institute in the deadline of the processing node
The expected workload of product design task to be allocated is stated divided by the working efficiency of the processing node.The task allocation apparatus exists
Obtain each product design task to be allocated it is each it is described processing node deadline after, according to it is each it is described to
Deadline and Hungary Algorithm of the product design task in each processing node are distributed, by the Z productions to be allocated
Product design objective is assigned to the M processing nodes and is handled.Wherein, the estimated work of the product design task to be allocated
The working efficiency of amount and the processing node is preset；The task attribute of the product design task to be allocated be it is preset,
The expected workload of the product design task to be allocated of same task attribute is equal.
For example, existing 5 product design tasks to be allocated, the task category of 5 product design tasks to be allocated
Property is different, needs to be assigned to 5 processing nodes.For each product design task to be allocated, according to described
The working efficiency of the expected workload of product design task to be allocated and each processing node, can obtain each to be allocated
Deadline of the product design task in each processing node.As 5 product design tasks to be allocated described in 5
The deadline for handling node, construct the deadline matrix of 5*5, YzrIt is arranged for z row in the deadline matrix and r
Element indicates that z-th of product design task to be allocated handles the deadline of node at r-th, using Hungary Algorithm to institute
It states deadline matrix to be handled, can obtain task allocation matrix, the task allocation matrix is 0-1 matrix, described
The corresponding product design task to be allocated of line number of element 1 distributes to element 1 in the task allocation matrix in business allocation matrix
The corresponding processing node of row number, that is, realize and 5 product design tasks to be allocated be assigned to 5 processing nodes.
Hungary Algorithm is the prior art to the deadline matrix process, herein without repeating.
Fig. 5 is the flow diagram of the distribution method for the product design task that a further embodiment of the present invention provides, such as Fig. 5 institute
Show, on the basis of the various embodiments described above, further, the preset rules include:
If S501, judgement know that the quantity Z of the product design task to be allocated is less than or equal to the processing node
Quantity M and the task attribute of each product design task to be allocated in there are the identical task attributes, then by Z
The product design task to be allocated is considered as the mutually different product design task to be allocated of the task attribute, is appointed according to Z
Deadline and Hungary Algorithm of the mutually different product design task to be allocated of attribute of being engaged in each processing node,
It obtains and the Z mutually different product design tasks to be allocated of task attribute is assigned to the second of the M processing nodes
Allocation result, and the longest finishing time threshold value for obtaining single processing node is calculated according to second allocation result；
Specifically, the task allocation apparatus is by the quantity Z of the product design task to be allocated and the processing node
Quantity M be compared, while the task attribute of more each product design task to be allocated, if the production to be allocated
The quantity Z of product design objective is less than or equal to the quantity M of the processing node and each product design task to be allocated
Task attribute in there are the identical task attributes, then Z product design tasks to be allocated are considered as described appoint
The business mutually different product design task to be allocated of attribute, that is, the product design to be allocated that the identical task attribute will be present are appointed
The task attribute of business is changed to difference, obtains the mutually different product design task to be allocated of Z task attribute.The task point
With device according to the mutually different product design task to be allocated of Z task attribute in each deadline for handling node
And Hungary Algorithm, the mutually different product design task to be allocated of Z task attribute is assigned to the M processing nodes
It is handled, obtains the second allocation result, second allocation result includes the mutually different production to be allocated of each task attribute
Product design objective and its processing node of distribution.Then, each task attribute mutually not phase is calculated according to second allocation result
Same product design task to be allocated is equal to each task category in the deadline of the processing node of its distribution, above-mentioned deadline
Property mutually different product design task to be allocated expected workload divided by distribution processing node working efficiency, will be above-mentioned
Maximum deadline in deadline, the longest finishing time threshold value as single processing node.Wherein, the production to be allocated
The task attribute of product design objective is preset, the product design task to be allocated of same alike result estimated work having the same
Amount；The expected workload of the product design task to be allocated be it is preset, it is described processing node working efficiency be preset.
It S502, is one described to be allocated by the product design task merging to be allocated of the n+1 identical task attributes
Product design task is allocated, according to the Z-n product design tasks to be allocated in each completion for handling node
The product design task merging to be allocated of the n+1 identical task attributes is by time and Hungary Algorithm, acquisition
The third allocation result that one product design task to be allocated is allocated, and institute is obtained according to the third allocation result
State the longest finishing time of single processing node；Wherein, the product design task to be allocated of the n+1 identical task attributes is closed
And the calculating for a product design task to be allocated in the deadline of each processing node is based on study efficacy,
N value since 1；
Specifically, for there are the product design task to be allocated of same task attribute, the task allocation apparatus is by n+1
The product design task merging to be allocated of a identical task attribute is that a product design task to be allocated is divided
The problem of matching, i.e., being allocated to the Z product design tasks to be allocated, which is converted into, sets the Z-n products to be allocated
The assignment problem of meter task, the Z-n product design tasks to be allocated include one by the n+1 identical task attributes
The product design task to be allocated of product design task merging to be allocated.The task allocation apparatus is described wait divide according to Z-n
It deadline and Hungary Algorithm with product design task in each processing node, obtains identical described by n+1
The product design task merging to be allocated of task attribute is that a product design task to be allocated is allocated
Three allocation results, the i.e. deadline according to the Z-n product design tasks to be allocated in each processing node construct
Corresponding deadline matrix recycles Hungary Algorithm to handle above-mentioned deadline matrix, obtains corresponding task
Allocation matrix obtains the third allocation result according to corresponding task allocation matrix.The third allocation result includes Z-n
The product design task to be allocated and its processing node of distribution, according to the third allocation result calculate Z-n it is described to
Distributing each product design task to be allocated in product design task, will be above-mentioned complete in the deadline of the processing node of its distribution
Longest finishing time at the deadline maximum in the time, as the single processing node.The n+1 identical task categories
Property product design task merging to be allocated be product design task to be allocated in the complete of each processing node
It is obtained at the time based on study efficacy, the product design task merging to be allocated of the n+1 identical task attributes is an institute
The deadline that product design task to be allocated is stated in the processing node is tAlways=tb0+tb1+…+tbn+1-1, wherein t n+
Each product design task to be allocated is in the processing node in the product design task to be allocated of 1 identical task attribute
Deadline.N value since 1.
If S503, judgement know that the longest finishing time of the single processing node is less than the single processing node most
Big deadline threshold value, then enable n=n+1, according to the Z-n product design tasks to be allocated in each processing node
Deadline and Hungary Algorithm regain and appoint the product design to be allocated of the n+1 identical task attributes
The third allocation result that a product design task to be allocated is allocated is merged into business, and according to the third regained
Allocation result updates the longest finishing time of the single processing node, until the longest finishing time of the single processing node
More than or equal to the longest finishing time threshold value of the single processing node；
Specifically, the task allocation apparatus by it is described it is single processing node longest finishing time and the single processing
The longest finishing time threshold value of node is compared, if the longest finishing time of the single processing node is single less than described
The longest finishing time threshold value of node is handled, then enabling n=n+1, repeats step S502, it can be described to be allocated according to Z-n
It deadline and Hungary Algorithm of the product design task in each processing node, regains n+1 identical institutes
The product design task merging to be allocated for stating task attribute is what a product design task to be allocated was allocated
Third allocation result, and the single longest finishing time for handling node is updated according to the third allocation result regained,
By the longest finishing time threshold value of the longest finishing time of the updated single processing node and the single processing node
It is compared, if the longest finishing time of the updated single processing node is still less than the single processing node
Longest finishing time threshold value repeats the above process then enabling n=n+1 again, when the maximum completion of the single processing node
Between be more than or equal to it is described it is single processing node longest finishing time threshold value.
S504, the longest finishing time for obtaining the single processing node are more than or equal to the single processing node
Corresponding n when longest finishing time threshold value appoints each product design to be allocated according to the corresponding third allocation result of n-1
Business is assigned to each processing node and is handled.
Specifically, when the longest finishing time of the single processing node is more than or equal to the single processing node
When longest finishing time threshold value, the task allocation apparatus obtain it is described it is single processing node longest finishing time be greater than or
Corresponding n when equal to the longest finishing time threshold value of the single processing node, and the corresponding third allocation result of n-1 is obtained,
According to the corresponding third allocation result of n-1 by each product design task to be allocated be assigned to each processing node into
Row processing.
It will be appreciated that when multiple product design tasks to be allocated are assigned to the same processing node,
The high product design task to be allocated of priority attribute is preferentially performed, the priority of the product design task to be allocated
Attribute is preset.For example, it is excellent to set third for the priority attribute of the product design task to be allocated normally executed
First grade, will be after the single in-process be completed, and the priority attribute for auditing underproof product design task to be allocated is set
It is set to the second priority, the priority category of the product design task to be allocated of current process will be returned to from next process
Property be set as the first priority, first priority is higher than second priority, and second priority is higher than described the
Three priority.
It is carried out below with distribution method of the specific embodiment to product design task provided in an embodiment of the present invention
Explanation.
Need to distribute the Z product design tasks to be allocated in the single process, the single process includes M institute
Processing node is stated, the type of the task attribute of the Z product design tasks to be allocated is N.By the task of the processing node
The maximum value of deadline is denoted as maxCm, CmThe task completion time of m-th of processing node is indicated, in order to described wait divide by Z
The M processing nodes are assigned to product design task, with maxCmMinimum optimization aim.
The task allocation apparatus is greater than M if it is determined that obtaining Z, then Z product design tasks to be allocated are divided into M group
Product design task to be allocated, every group of product design task to be allocated include at least one product design task to be allocated.Wherein,
The detailed process that Z product design tasks to be allocated are divided into M group product design task to be allocated is detailed in step S2011, S2012
And S2013.
The task allocation apparatus can obtain M group product to be allocated after obtaining M group product design task to be allocated
Every group of product design task to be allocated is in the M processing nodes when completion of each processing node in design objective
Between, at this point, not considering influence of the study efficacy to the deadline, maximum value is then obtained from the above-mentioned deadline as single
The longest finishing time of node is handled, then the longest finishing time of above-mentioned single processing node is obtained multiplied by magnification ratio coefficient
To the deadline threshold value of single processing node, it is denoted asWherein it is possible to by M group product design task to be allocated to M
The distribution for handling node, regards assignment problem as, and the longest finishing time of the single processing node is obtained using Hungary Algorithm.
The task allocation apparatus acquisition can obtain every group of product design to be allocated in M group product design task to be allocated
The deadline of task each processing node in the M processing nodes, appoint calculating every group of product design to be allocated
It is engaged in considering influence of the study efficacy to the deadline in the deadline of each processing node.The task allocation apparatus from
In the deadline that every group of product design task to be allocated handles node at M, the least deadline is obtained, it then will be minimum
Deadline corresponding distribution of the processing node as group product design task to be allocated processing node.Repeat above-mentioned place
The acquisition process of node is managed, every group of product design task to be allocated in product design task to be allocated for M group can obtain
Corresponding processing node, to obtain a task allocation plan.
The task allocation apparatus is according to above-mentioned task allocation plan, the task of each processing node in task allocation plan
Deadline, i.e., the described task handle the time used in each group product design task to be allocated of node processing distribution, will be described
The task completion time of each processing node is compared in task allocation plan, can obtain maxCm, then by maxCm
WithIf maxCmIt is less thanIt is so based on above-mentioned task allocation plan, by Z product design tasks to be allocated point
It is fitted on corresponding processing node.If maxCmIt is more than or equal toThe task point is adjusted using branch and bound method
With scheme, maxC is regainedm, the maxC that regainsmLess than the maxC before the adjustment task allocation planm, Zhi Daochong
It is new to obtain maxCmIt is less than
The task allocation apparatus is if it is determined that know that Z is less than or equal to M, and N=Z, then can be by Z wait divide
M processing node is assigned to product design task and is considered as assignment problem, calculates each product design task to be allocated each
The deadline for handling node, according to above-mentioned deadline construction complete time matrix, using Hungary Algorithm to above-mentioned completion
Time gap is handled, and task allocation matrix is obtained, and task allocation matrix is 0-1 matrix, according to task allocation matrix by Z
Product design task to be allocated is assigned to corresponding processing node.
The task allocation apparatus is if it is determined that know that Z is less than or equal to M, and N is less than Z, then not considering first
Study efficacy, Z product design tasks to be allocated can be assigned to M processing Node is assignment problem, is calculated each
Product design task to be allocated is in the deadline of each processing node, according to above-mentioned deadline construction complete time matrix,
Above-mentioned deadline distance is handled using Hungary Algorithm, corresponding task allocation matrix is obtained, according to corresponding
Z product design tasks to be allocated are assigned to corresponding processing node by business allocation matrix, calculate the task of each processing node
Deadline, it is each processing node task completion time in obtain processing node task completion time maximum value, as
Then consider study efficacy, by the product design task merging to be allocated of n+1 same task attribute be one to
Distribution product design task is allocated, and Z-n product design tasks to be allocated can be assigned to M processing Node and is
Assignment problem can solve the corresponding assignment problem of Z-n product design task to be allocated, obtain corresponding since n=1
Z-n product design tasks to be allocated are assigned to corresponding processing node by task allocation plan, calculate each processing node
Task completion time, it is each processing node task completion time in obtain processing node task completion time maximum value,
As maxCm。
If maxCmIt is more than or equal toSo basisCorresponding task allocation plan is to be allocated by Z
Product design task is assigned to corresponding processing node.If maxCmIt is less thanSo n=n+1 is repeated above-mentioned by n+1
The product design task merging to be allocated of a same task attribute is the processing that a product design task to be allocated is allocated
Process regains task allocation plan, regains maxCm, until maxCmIt is more than or equal toWork as maxCmIt is greater than
Or it is equal toWhen, obtain maxCmCorresponding n, according to the corresponding task allocation plan of n-1 by Z product designs to be allocated
Task is assigned to corresponding processing node.
Fig. 6 is the structural schematic diagram of the distributor for the product design task that one embodiment of the invention provides, such as Fig. 6 institute
Show, the distributor of product design task provided in an embodiment of the present invention, including acquiring unit 601 and allocation unit 602,
In:
Acquiring unit 601 obtains multiple product design tasks to be allocated of single in-process, each product to be allocated
Design objective is divided into each process in advance；Allocation unit 602 according to preset task allocation rule will it is multiple it is described to
Each processing node that distribution product design task is assigned to the single process is handled；Wherein, each processing section
A point product design task to be allocated per treatment.
Specifically, for being divided into the product design task to be allocated of each process, acquiring unit 601 can be obtained
The product design task to be allocated, the product design task to be allocated can be treated separately in the in-process.
Wherein, the product design task to be allocated can be product to be designed, each institute of the product design task to be allocated
Process is stated with preset ordinal relation, the product design task to be allocated is after a process is completed, stream
Go to next process.
The single process may include multiple processing nodes, and allocation unit 602 is obtaining multiple products to be allocated
After design objective, multiple product design tasks to be allocated can be assigned to by each place according to preset task allocation rule
Reason node is handled.Wherein, each processing node one per treatment product design task to be allocated.It is appreciated that
, when the product design task to be allocated be product to be designed when, the processing node can be equipped with computer with
The design station of designer installs and designs plug-in unit on computer, and the design plug-in unit is for receiving product design to be allocated
Task.
The distributor of product design task provided by the invention, since the multiple to be allocated of single in-process can be obtained
Product design task, and multiple product design tasks to be allocated are assigned to by each processing node according to preset task allocation rule
It is handled, one per treatment product design task to be allocated of each processing node, single in-process can be needed automatically
The product design task to be allocated of processing is distributed automatically, improves the allocative efficiency of product design task.
The embodiment of device provided by the invention specifically can be used for executing the process flow of above-mentioned each method embodiment,
Details are not described herein for function, is referred to the detailed description of above method embodiment.
Fig. 7 is the entity structure schematic diagram for the electronic equipment that one embodiment of the invention provides, as shown in fig. 7, the electronics is set
Standby may include: processor (processor) 710,720, memory communication interface (Communications Interface)
(memory) 730 and communication bus 740, wherein processor 710, communication interface 720, memory 730 pass through communication bus 740
Complete mutual communication.Processor 710 can call the logical order in memory 730, to execute following method: obtain single
Multiple product design tasks to be allocated of a in-process, each product design task to be allocated are divided into each institute in advance
State process；Multiple product design tasks to be allocated are assigned to each of the single process according to preset task allocation rule
A processing node is handled；Wherein, each processing node one per treatment product design task to be allocated.
In addition, the logical order in above-mentioned memory 730 can be realized by way of SFU software functional unit and conduct
Independent product when selling or using, can store in a computer readable storage medium.Based on this understanding, originally
Substantially the part of the part that contributes to existing technology or the technical solution can be in other words for the technical solution of invention
The form of software product embodies, which is stored in a storage medium, including some instructions to
So that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation of the present invention
The all or part of the steps of example the method.And storage medium above-mentioned include: USB flash disk, mobile hard disk, read-only memory (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. it is various
It can store the medium of program code.
The present embodiment discloses a kind of computer program product, and the computer program product includes being stored in non-transient calculating
Computer program on machine readable storage medium storing program for executing, the computer program include program instruction, when described program instruction is calculated
When machine executes, computer is able to carry out method provided by above-mentioned each method embodiment, for example, obtains single in-process
Multiple product design tasks to be allocated, each product design task to be allocated are divided into each process in advance；Root
Multiple product design tasks to be allocated are assigned to each processing section of the single process according to preset task allocation rule
Point is handled；Wherein, each processing node one per treatment product design task to be allocated.
The present embodiment provides a kind of non-transient computer readable storage medium, the non-transient computer readable storage medium
Computer program is stored, the computer program makes the computer execute method provided by above-mentioned each method embodiment, example
It such as include: the multiple product design tasks to be allocated for obtaining single in-process, each product design task to be allocated is preparatory
It is divided into each process；Multiple product design tasks to be allocated are assigned to institute according to preset task allocation rule
The each processing node for stating single process is handled；Wherein, each the processing node one per treatment it is described to be allocated
Product design task.
The apparatus embodiments described above are merely exemplary, wherein described, unit can as illustrated by the separation member
It is physically separated with being or may not be, component shown as a unit may or may not be physics list
Member, it can it is in one place, or may be distributed over multiple network units.It can be selected according to the actual needs
In some or all of the modules achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creativeness
Labour in the case where, it can understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
It realizes by means of software and necessary general hardware platform, naturally it is also possible to pass through hardware.Based on this understanding, on
Stating technical solution, substantially the part that contributes to existing technology can be embodied in the form of software products in other words, should
Computer software product may be stored in a computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including several fingers
It enables and using so that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation
Method described in certain parts of example or embodiment.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (10)
1. a kind of distribution method of product design task characterized by comprising
Multiple product design tasks to be allocated of single in-process are obtained, each product design task to be allocated is drawn in advance
It is divided into each process；
Multiple product design tasks to be allocated are assigned to each of the single process according to preset task allocation rule
Processing node is handled；Wherein, each processing node one per treatment product design task to be allocated.
2. the method according to claim 1, wherein the preset task allocation rule includes:
If judgement knows that the quantity Z of the product design task to be allocated is greater than the quantity M of the processing node, by Z institute
It states product design task to be allocated and is divided into M group product design task to be allocated, product design task to be allocated described in every group includes
At least one described product design task to be allocated；
According to every group of product design task to be allocated in M group product design task to be allocated in each completion for handling node
Time obtains the longest finishing time of single processing node, and is obtained according to the longest finishing time of the single processing node
The deadline threshold value of the single processing node；
It is that the M group product design task to be allocated distributes the processing node according to default allocation rule, obtains task distribution
Scheme；
If judgement is known the task completion time of each processing node in the task allocation plan both less than or is equal to
Multiple product design tasks to be allocated are then assigned to respectively according to the task allocation plan by the deadline threshold value
Corresponding processing node is handled；Otherwise, task allocation plan is regained using branch and bound method, until what is regained
The task completion time of each processing node is both less than or equal to the deadline threshold value in task allocation plan.
3. according to the method described in claim 2, it is characterized in that, described be divided into M for the Z product design tasks to be allocated
Organizing product design task to be allocated includes:
The product design task to be allocated with same task attribute is preferentially divided into one group and there is no same task categories
Property the product design task to be allocated be individually for one group, obtain N group product design task to be allocated；Wherein, described wait divide
Task attribute with product design task is preset；
If judgement knows that N is greater than M, according to every group of product design task to be allocated in N group product design task to be allocated each
The minimum completion time of a processing node is ascending to be ranked up, and ranking results are obtained；
According to the ranking results and default merging rule by N group product design task merging to be allocated at the production to be allocated of M group
Product design objective.
4. according to the method described in claim 2, it is characterized in that, described according to every group in M group product design task to be allocated
Product design task to be allocated obtains the longest finishing time of single processing node in the deadline of each processing node
Include:
According to every group of product design task to be allocated in M group product design task to be allocated in each completion for handling node
Time and Hungary Algorithm obtain the first distribution that M group product design task to be allocated is assigned to the M processing nodes
As a result, and obtaining the single longest finishing time for handling node according to first allocation result.
5. according to the method described in claim 2, it is characterized in that, the default allocation rule of the basis includes:
Completion of the every group of product design task to be allocated in each processing node in acquisition M group product design task to be allocated
Time；Wherein, each deadline is obtained based on study efficacy；
By every group of product design task to be allocated in M group product design task to be allocated, it is least to be assigned to the deadline
The processing node.
6. according to the method described in claim 2, it is characterized in that, the preset task allocation rule further include:
If judgement know the product design task to be allocated quantity Z be less than or equal to it is described processing node quantity M and
The task attribute of each product design task to be allocated is different, then according to each product design task to be allocated
Deadline and Hungary Algorithm in each processing node, the Z product design tasks to be allocated are assigned to M
A processing node is handled；Wherein, the task attribute of the product design task to be allocated is preset.
7. method according to any one of claims 1 to 6, which is characterized in that the preset rules include:
If judgement know the product design task to be allocated quantity Z be less than or equal to it is described processing node quantity M and
There are the identical task attributes in the task attribute of each product design task to be allocated, then described wait divide by Z
It is considered as the mutually different product design task to be allocated of the task attribute with product design task, it is mutual according to Z task attribute
It deadline and Hungary Algorithm of the different product design task to be allocated in each processing node, obtains Z
A mutually different product design task to be allocated of the task attribute is assigned to the second distribution knot of the M processing nodes
Fruit, and the longest finishing time threshold value for obtaining single processing node is calculated according to second allocation result；
It is that the product design to be allocated is appointed by the product design task merging to be allocated of the n+1 identical task attributes
Business is allocated, deadline and breast according to the Z-n product design tasks to be allocated in each processing node
Tooth benefit algorithm, obtain by the product design task merging to be allocated of the n+1 identical task attribute be described in one to
The third allocation result that distribution product design task is allocated, and the single processing is obtained according to the third allocation result
The longest finishing time of node；Wherein, the product design task merging to be allocated of the n+1 identical task attributes is an institute
The calculating that product design task to be allocated is stated in the deadline of each processing node is obtained based on study efficacy, and n is opened from 1
Beginning value；
If judgement knows that the longest finishing time of the single processing node is completed less than the maximum of the single processing node
Between threshold value, then enable n=n+1, according to Z-n product design tasks to be allocated each processing node deadline
And Hungary Algorithm, it regains and is by the product design task merging to be allocated of n+1 identical task attributes
The third allocation result that one product design task to be allocated is allocated, and according to the third allocation result regained
Update it is described it is single processing node longest finishing time, until it is described it is single processing node longest finishing time be greater than or
Equal to the longest finishing time threshold value of the single processing node；
The longest finishing time for obtaining the single processing node, which is more than or equal to single the maximum of processing node, to be completed
Each product design task to be allocated is assigned to by corresponding n when time threshold according to the corresponding third allocation result of n-1
Each processing node is handled.
8. a kind of distributor of product design task characterized by comprising
Acquiring unit, obtains multiple product design tasks to be allocated of single in-process, and each product design to be allocated is appointed
Business is divided into each process in advance；
Allocation unit, for multiple product design tasks to be allocated to be assigned to the list according to preset task allocation rule
Each processing node of a process is handled；Wherein, each one per treatment product to be allocated of the processing node
Design objective.
9. a kind of electronic equipment including memory, processor and stores the calculating that can be run on a memory and on a processor
Machine program, which is characterized in that the processor realizes product as described in any one of claim 1 to 7 when executing described program
The step of distribution method of design objective.
10. a kind of non-transient computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer
The step of distribution method of product design task as described in any one of claim 1 to 7 is realized when program is executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811294370.5A CN109636097B (en) | 2018-11-01 | 2018-11-01 | Method and device for distributing product design tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811294370.5A CN109636097B (en) | 2018-11-01 | 2018-11-01 | Method and device for distributing product design tasks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109636097A true CN109636097A (en) | 2019-04-16 |
| CN109636097B CN109636097B (en) | 2021-09-21 |
Family
ID=66067139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811294370.5A Active CN109636097B (en) | 2018-11-01 | 2018-11-01 | Method and device for distributing product design tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109636097B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110620818A (en) * | 2019-09-18 | 2019-12-27 | 东软集团股份有限公司 | Method, device and related equipment for realizing node distribution |
| CN111427682A (en) * | 2020-03-11 | 2020-07-17 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100180003A1 (en) * | 2009-01-14 | 2010-07-15 | Gm Global Technology Operations, Inc. | Message loss prevention in can systems |
| CN101916404A (en) * | 2010-08-06 | 2010-12-15 | 沈阳工业大学 | Multi-factory cooperative scheduling optimization method during equipment manufacturing |
| CN101986272A (en) * | 2010-11-05 | 2011-03-16 | 北京大学 | Task scheduling method under cloud computing environment |
| CN104486400A (en) * | 2014-12-12 | 2015-04-01 | 广东工业大学 | Schedule optimization method for node collaborative awareness of Internet of Things in manufacturing industry |
| CN103236949B (en) * | 2013-04-27 | 2016-12-28 | 北京搜狐新媒体信息技术有限公司 | Monitoring method, device and the system of a kind of server cluster |
| CN106293952A (en) * | 2016-07-11 | 2017-01-04 | 河南大学 | The remote sensing method for scheduling task that a kind of task based access control demand is mated with service ability |
| WO2017020637A1 (en) * | 2015-08-05 | 2017-02-09 | 杭州海康威视数字技术股份有限公司 | Task allocation method and task allocation apparatus for distributed data calculation |
| CN107203492A (en) * | 2017-05-31 | 2017-09-26 | 西北工业大学 | Product design cloud service platform modularization task replanning and distribution optimization method |
| CN107526623A (en) * | 2016-06-22 | 2017-12-29 | 腾讯科技（深圳）有限公司 | A kind of data processing method and device |
| CN107590002A (en) * | 2017-09-15 | 2018-01-16 | 东软集团股份有限公司 | Method for allocating tasks, device, storage medium, equipment and distributed task scheduling system |
| CN107767007A (en) * | 2016-09-05 | 2018-03-06 | 北京三快在线科技有限公司 | Method for allocating tasks and device |
| CN108229792A (en) * | 2017-12-11 | 2018-06-29 | 浪潮软件集团有限公司 | Method and device for automatically allocating tasks |
| CN108717379A (en) * | 2018-05-08 | 2018-10-30 | 平安证券股份有限公司 | Electronic device, distributed task dispatching method and storage medium |
-
2018
- 2018-11-01 CN CN201811294370.5A patent/CN109636097B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100180003A1 (en) * | 2009-01-14 | 2010-07-15 | Gm Global Technology Operations, Inc. | Message loss prevention in can systems |
| CN101916404A (en) * | 2010-08-06 | 2010-12-15 | 沈阳工业大学 | Multi-factory cooperative scheduling optimization method during equipment manufacturing |
| CN101986272A (en) * | 2010-11-05 | 2011-03-16 | 北京大学 | Task scheduling method under cloud computing environment |
| CN103236949B (en) * | 2013-04-27 | 2016-12-28 | 北京搜狐新媒体信息技术有限公司 | Monitoring method, device and the system of a kind of server cluster |
| CN104486400A (en) * | 2014-12-12 | 2015-04-01 | 广东工业大学 | Schedule optimization method for node collaborative awareness of Internet of Things in manufacturing industry |
| WO2017020637A1 (en) * | 2015-08-05 | 2017-02-09 | 杭州海康威视数字技术股份有限公司 | Task allocation method and task allocation apparatus for distributed data calculation |
| CN107526623A (en) * | 2016-06-22 | 2017-12-29 | 腾讯科技（深圳）有限公司 | A kind of data processing method and device |
| CN106293952A (en) * | 2016-07-11 | 2017-01-04 | 河南大学 | The remote sensing method for scheduling task that a kind of task based access control demand is mated with service ability |
| CN107767007A (en) * | 2016-09-05 | 2018-03-06 | 北京三快在线科技有限公司 | Method for allocating tasks and device |
| CN107203492A (en) * | 2017-05-31 | 2017-09-26 | 西北工业大学 | Product design cloud service platform modularization task replanning and distribution optimization method |
| CN107590002A (en) * | 2017-09-15 | 2018-01-16 | 东软集团股份有限公司 | Method for allocating tasks, device, storage medium, equipment and distributed task scheduling system |
| CN108229792A (en) * | 2017-12-11 | 2018-06-29 | 浪潮软件集团有限公司 | Method and device for automatically allocating tasks |
| CN108717379A (en) * | 2018-05-08 | 2018-10-30 | 平安证券股份有限公司 | Electronic device, distributed task dispatching method and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110620818A (en) * | 2019-09-18 | 2019-12-27 | 东软集团股份有限公司 | Method, device and related equipment for realizing node distribution |
| CN111427682A (en) * | 2020-03-11 | 2020-07-17 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
| CN111427682B (en) * | 2020-03-11 | 2023-09-01 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109636097B (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE69028612T2 (en) | Installation optimization of flexible manufacturing systems | |
| CN109783224A (en) | Method for allocating tasks, device and terminal device based on load allotment | |
| CN103369041B (en) | Resource allocation methods and device based on cloud computing | |
| CN104699542B (en) | Task processing method and system | |
| CN107958349A (en) | Method for allocating tasks, device, computer equipment and storage medium | |
| WO2019193075A1 (en) | Coordinated heterogeneous processing of training data for deep neural networks | |
| CN106534302A (en) | Multi-task demand service combination method and system | |
| CN109636097A (en) | A kind of distribution method and device of product design task | |
| CN109615188A (en) | A kind of predistribution combines the multi-robot Task Allocation of Hungary Algorithm | |
| CN110866687A (en) | Task allocation method and device | |
| CN109389297A (en) | The automatic distributing method of work order and device based on telecommunication service | |
| WO2021057465A1 (en) | Method and apparatus for performing parallel processing on deep learning model | |
| WO2021190921A1 (en) | Computer-implemented method for planning and/or controlling a production by a production system, and production planning and/or control system for production optimization | |
| CN109872049B (en) | Resource allocation optimization method and device | |
| CN110290228A (en) | A kind of internet protocol address distribution method and device | |
| CN109598411A (en) | A kind of processing method and electronic equipment of product design task | |
| CN112199407B (en) | Data packet ordering method, device, equipment and storage medium | |
| CN108196970A (en) | The dynamic memory management method and device of Spark platforms | |
| CN105072049B (en) | The resource allocation methods and device of the multi-level flexible application in data-oriented center | |
| CN109783189A (en) | A kind of quiescent operation stream scheduling method and device | |
| Ferjani et al. | A HEURISTIC APPROACH TAKING OPERATORS’FATIGUE INTO ACCOUNT FOR THE DYNAMIC ASSIGNMENT OF WORKFORCE TO REDUCE THE MEAN FLOWTIME | |
| CN110209656A (en) | Data processing method and device | |
| CN113438173B (en) | Routing and spectrum allocation method, device, storage medium and electronic equipment | |
| CN107888784A (en) | A kind of method and server of dynamically distributes number | |
| CN109829753B (en) | Method and equipment for distributing flow to advertisement orders |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |