CN112598158A - Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm - Google Patents

Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm Download PDF

Info

Publication number
CN112598158A
CN112598158A CN202011395327.5A CN202011395327A CN112598158A CN 112598158 A CN112598158 A CN 112598158A CN 202011395327 A CN202011395327 A CN 202011395327A CN 112598158 A CN112598158 A CN 112598158A
Authority
CN
China
Prior art keywords
solution
task
fitness
population
constraint function
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
Application number
CN202011395327.5A
Other languages
Chinese (zh)
Inventor
李东栓
肖乐
职统兴
曹宇楠
琚亚梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dalian Sida High Technology Development Co Ltd
Original Assignee
Dalian Sida High Technology Development Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Dalian Sida High Technology Development Co Ltd filed Critical Dalian Sida High Technology Development Co Ltd
Priority to CN202011395327.5A priority Critical patent/CN112598158A/en
Publication of CN112598158A publication Critical patent/CN112598158A/en
Pending legal-status Critical Current

Links

Images

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • 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
    • 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

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Mining & Analysis (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Artificial Intelligence (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a task scheduling method of a collaborative industrial design platform based on a mixed frog leaping algorithm, which is characterized by comprising the following steps: step 1, initializing a population; step 2, calculating the fitness and arranging the fitness in a descending order; step 3, sub-population division; step 4, optimizing in the group; step 5, judging whether the iteration times of the sub-population are reached, repeating the process if the iteration times of the sub-population are not reached, and dividing the population again to perform solution space grouping reconstruction if the iteration times of the sub-population are not reached; and 6, judging whether the current solution space meets a termination condition, if not, continuing to calculate, if so, terminating the algorithm, and outputting an optimal solution. The invention is characterized in that: optimal scheduling can be achieved, project cost is minimized, and construction period is shortened to the maximum extent.

Description

Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm
Technical Field
The invention relates to the technical field related to a collaborative industrial design platform, in particular to a task scheduling method of a collaborative industrial design platform based on a mixed frog leaping algorithm.
Background
The collaborative industrial design platform adopts a man-machine collaborative design mode based on a design cloud (public cloud or private cloud), the work of a cloud-based industrial design project is divided into parallel tasks and serial tasks, as shown in FIG. 2, part modeling to model assembly are basic parallel tasks and are generally completed manually by designers; rendering and resource optimization are completed by man-machine cooperation; variable binding, animation design and simulation control to process analysis are completed by designers. Because the working hours of all stages of the project are different in consumption, the efficiency of personnel participating in cloud design is also different, the labor cost is settled according to the working hours, the service cost of the agent program is settled according to the consumed electricity cost, and therefore tasks are required to be allocated to the designer and the agent program in real time according to the project progress requirement, the optimal scheduling is realized, the project cost is minimum, and the construction period is shortened to the maximum extent.
Disclosure of Invention
The invention aims to overcome the defects and provides a task scheduling method of a collaborative industrial design platform based on a mixed frog leaping algorithm.
The technical scheme adopted by the invention for realizing the purpose is as follows: a task scheduling method of a collaborative industrial design platform based on a mixed frog leaping algorithm is characterized by comprising the following steps:
step 1, initializing a population: preliminarily setting a certain number of feasible solutions which accord with the constraint function according to empirical data managed by the collaborative industrial design project, wherein each frog is a solution which accords with the constraint function;
step 2, calculating the fitness of each frog, and arranging all the frogs in a descending order according to the fitness;
step 3, sub-population division: randomly dispersing the possible solutions into each solution space and sequencing according to the fitness of the solutions;
step 4, setting an upper limit of the number of times of optimization updating in the group, performing fuzzy evolution within the number of times, randomly generating a new solution based on the maximum leapfrogging step length, and when the absolute value of the difference between the current worst solution and the new solution respectively corresponding to the fitness < = is a fuzzy interval used in the better solution, considering that the new solution is a better solution by the system, updating the worst solution by using a worst solution updating strategy, if the optimal solution is not found within the maximum number of times of optimization updating in the group, randomly generating a new solution based on the maximum leapfging step length to replace the original worst solution, and directly jumping out of the group for optimization regardless of the magnitude comparison of the fitness;
step 5, judging whether the iteration times of the sub-population are reached, repeating the process if the iteration times of the sub-population are not reached, and dividing the population again to perform solution space grouping reconstruction if the iteration times of the sub-population are not reached;
and 6, judging whether the current solution space meets a termination condition, if not, continuing to calculate, if so, terminating the algorithm, and outputting an optimal solution.
The constraint functions comprise a constraint function 1, a constraint function 2 and a constraint function 3;
constraint function 1: for a project of a collaborative industrial design, comprising n jobs W1, W2,…,WnAccording to the plan, the total time D of the project is as follows:
D = DW1 + DW2 + … + DWn
acceptable duration of operation for which DW is set for planning
And a certain work Wn can be decomposed into Wn tasks T, wherein T is to be executed by a designer or an agent, i.e. the tasks assigned to the designer or the agent are at least kept for more than M minutes to ensure that the tasks are valid, and DT is the duration of a certain task T:
DT>= M
and (3) constraint of maximum value of task quantity:
wn <= DWn / M + 1
calculating the total project time based on the tasks:
D =(W1DT1+W1DT2+…+W1DTw1) + (W2DT1+W2DT2+…+W2DTw2) + …
+(WnDT1+WnDT2+…+WnDTwn)
D >= (w1 + w2 + … + wn) * M
constraint function 2: for each task T, let H be the number of design personnel involved, Dh be the man-hour, P be the number of agent program threads involved, Dp be the agent program execution time, the personnel efficiency index be Kh, the agent program performance index be Kp, the maximum number of personnel allocated for a single task be Mh, the maximum number of threads be Mp:
Dh = Kh / H
Dp = Kp / P
WnDT = Khwn / Hwn + Kpwn / Pwn
H <= Mh
P <= Mp
when the number of the participated persons is less or the number of the threads of the allocated agent program is less, the time consumption of the task execution is longer, otherwise, the task execution speed is high, but the cost may be higher
Constraint function 3: and if the labor hour rate is Ch and the electric charge conversion rate is Cp, the single task cost is as follows:
CT = Dh * Ch + Dp * Cp
the total cost of the project is as follows:
C = Ch * (W1Kh1 / W1H1 + W1Kh2 / W1H2 + … + W1Khw1 / W1Hw1)
+ Ch * (W2Kh1 / W2H1 + W2Kh2 / W2H2 + … + W2Khw2 / W1Hw2)
+ …
+ Ch * (WnKh1 / WnH1 + WnKh2 / WnH2 + … + WnKhwn / WnHwn)
+ Cp * (W1Kp1 / W1P1 + W1Kp2 / W1P2 + … + W1Kpw1 / W1Pw1)
+ Cp * (W2Kp1 / W2P1 + W2Kp2 / W2P2 + … + W2Kpw2 / W1Pw2)
+ …
+ Cp * (WnKp1 / WnP1 + WnKp2 / WnP2 + … + WnKpwn / WnPwn)
C < MC
MC is the project total budget.
The fitness function is set as:
F(W, DT, H, P) = [Sigma(WiDTwi)] / [Sigma(WiHwi) + Sigma(WiPwi) ]
where i =1 to n, wi < = DWi/M + 1.
The invention is characterized in that: optimal scheduling can be achieved, project cost is minimized, and construction period is shortened to the maximum extent.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
FIG. 1 is a flow chart of the present invention.
FIG. 2 is a task diagram of a cloud-based industrial design project.
Detailed Description
As shown in fig. 1, the present invention is a cooperative industrial design platform task scheduling method based on a mixed frog leap algorithm, including:
step 1, initializing a population: the population scale is the number of solutions obtained by each iteration of the algorithm, a certain number of feasible solutions conforming to the constraint function are preliminarily set according to the empirical data managed by the collaborative industrial design project, and each frog is a solution conforming to the constraint function, namely the number of sub-populations is set, and the iteration depth of the algorithm is set;
the constraint functions comprise a constraint function 1, a constraint function 2 and a constraint function 3;
constraint function 1: for a project of a collaborative industrial design, comprising n jobs W1, W2,…,WnAccording to the plan, the total time D of the project is as follows:
D = DW1 + DW2 + … + DWn
DW an acceptable duration of operation for a planned setting, i.e., the maximum allowable duration of a particular operation
And a certain work Wn can be decomposed into Wn tasks T, which are executed by designers or agents, that is, the tasks allocated to the designers or agents can be ensured to be valid only by keeping for at least M minutes (the shortest execution time), and DT is set as the duration of a certain task T:
DT>= M
and (3) constraint of maximum value of task quantity:
wn <= DWn / M + 1
calculating the total project time based on the tasks:
D =(W1DT1+W1DT2+…+W1DTw1) + (W2DT1+W2DT2+…+W2DTw2) + …
+(WnDT1+WnDT2+…+WnDTwn)
D >= (w1 + w2 + … + wn) * M
constraint function 2: for each task T, let H be the number of design personnel involved, Dh be the man-hour, P be the number of agent program threads involved, Dp be the execution time of the agent program, the personnel efficiency index be Kh (empirical value), the agent program performance index be Kp (empirical value), the maximum number of personnel allocated for a single task be Mh, the maximum number of threads be Mp:
Dh = Kh / H
Dp = Kp / P
WnDT = Khwn / Hwn + Kpwn / Pwn
H <= Mh
P <= Mp
when the number of the participating personnel is less or the number of the threads of the allocated agent program is less, the time consumption of task execution is longer, otherwise, the task execution speed is high, but the cost is possibly higher;
constraint function 3: assuming that the man-hour rate is Ch (empirical value) and the electricity charge conversion rate is Cp (empirical value), the individual task charge:
CT = Dh * Ch + Dp * Cp
the total cost of the project is as follows:
C = Ch * (W1Kh1 / W1H1 + W1Kh2 / W1H2 + … + W1Khw1 / W1Hw1)
+ Ch * (W2Kh1 / W2H1 + W2Kh2 / W2H2 + … + W2Khw2 / W1Hw2)
+ …
+ Ch * (WnKh1 / WnH1 + WnKh2 / WnH2 + … + WnKhwn / WnHwn)
+ Cp * (W1Kp1 / W1P1 + W1Kp2 / W1P2 + … + W1Kpw1 / W1Pw1)
+ Cp * (W2Kp1 / W2P1 + W2Kp2 / W2P2 + … + W2Kpw2 / W1Pw2)
+ …
+ Cp * (WnKp1 / WnP1 + WnKp2 / WnP2 + … + WnKpwn / WnPwn)
c < MC (total budget for the project);
step 2, calculating the fitness of each frog, and arranging all the frogs in a descending order according to the fitness;
the function of fitness in the algorithm is set as:
F(W, DT, H, P) = [Sigma(WiDTwi)] / [Sigma(WiHwi) + Sigma(WiPwi) ]
where i =1 to n, wi < = DWi/M + 1;
step 3, sub-population division: randomly dispersing the possible solutions into various solution spaces and ordering according to the fitness of the solutions, and appearing as if frogs jump from one group to another;
step 4, in order to enable the algorithm not to fall into the dead cycle, setting an upper limit of the optimization updating times in the group, carrying out fuzzy evolution within the times, randomly generating a new solution based on the maximum leapfrog step length, when the absolute value of the difference between the current worst solution and the new solution respectively corresponding to the fitness is < = a fuzzy interval used when the optimal solution is taken, considering that the new solution is a more optimal solution by the system, updating the worst solution by using a worst solution updating strategy, if the optimal solution is not found within the maximum times of the optimization updating in the group, randomly generating a new solution to replace the original worst solution based on the maximum leapfrog step length, and directly jumping out of the group for optimization without considering the fitness size comparison;
step 5, judging whether the iteration times of the sub-population are reached, repeating the process if the iteration times of the sub-population are not reached, and dividing the population again to perform solution space grouping reconstruction if the iteration times of the sub-population are not reached;
and 6, judging whether the current solution space meets a termination condition, if not, continuing to calculate, if so, terminating the algorithm, outputting the optimal solution, and ending the algorithm.
The method is based on a mixed frog leap (SFLA) algorithm, SFLA initial parameters are configured according to task characteristics of a collaborative industrial design platform, meanwhile, task scheduling data in a historical project management database and cache data generated in real time by a current project are called, and system fitness under various constraint conditions is analyzed and calculated in real time, so that a set of optimized collaborative industrial design platform task scheduling scheme is obtained.
The algorithm core of the invention lies in how to schedule and balance the number of human-machine tasks, shortens the construction period to the greatest extent under the permission of project budget, and simultaneously saves the parameter configuration of historical scheduling as an experience scheme into a historical database for the next time when the algorithm initializes a feasible solution, forms a scheduling knowledge base, guides the selection of fitness functions and updating rules, and avoids the occurrence of local optimization to cause that an optimal scheduling scheme cannot be obtained.
When the method is used, a project manager can configure corresponding project budget, project plan, work decomposition (decomposition into tasks), shortest effective period of tasks, personnel number, personnel efficiency index, available thread number of agent programs, agent program execution performance, man-hour rate, electricity charge conversion rate and other parameters according to project requirements, and initializes input sample space, grouping number, frog number of each group, local iteration number, mixed iteration number, realization number, maximum movement step length of solution and other parameters before task allocation scheduling of designers and agent programs, and a background algorithm can utilize real-time calling cache data to carry out calculation analysis according to the parameters required in the algorithm, and finally can obtain a set of optimized task allocation scheduling scheme in a short time. In the calculation process, the system page displays the optimal frog swarm adaptive value obtained in each experiment in real time, the average value of the frog swarm adaptive values is obtained after all calculations are finished, and finally the shortest time of the remaining execution of the project is obtained, namely the optimal real-time task scheduling scheme.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be able to cover the technical solutions and the inventive concepts of the present invention within the technical scope of the present invention.

Claims (3)

1.基于混合蛙跳算法的协同工业设计平台任务调度方法，其特征在于，包括：1. the collaborative industrial design platform task scheduling method based on hybrid leapfrog algorithm, is characterized in that, comprises: 步骤1、初始化种群：按照协同工业设计项目管理的经验数据，初步设定一定数量的符合约束函数的可行解，每一只青蛙就是一个符合约束函数的一个解；Step 1. Initialize the population: According to the empirical data of collaborative industrial design project management, a certain number of feasible solutions that conform to the constraint function are initially set, and each frog is a solution that conforms to the constraint function; 步骤2、计算每一只青蛙的适应度，并将所有青蛙按照适应度降序排列；Step 2. Calculate the fitness of each frog, and arrange all frogs in descending order of fitness; 步骤3、子种群划分：随机的将可能的解分散到各个解空间中并按其适应度排序；Step 3. Subpopulation division: randomly disperse the possible solutions into each solution space and sort them according to their fitness; 步骤4、设定组内寻优更新次数上限，在该次数之内，进行模糊进化，基于最大蛙跳步长随机生成新解，当前最差解与新解分别对应适应度的差的绝对值<=取更优解时使用的模糊区间时，系统认为新解是一个更优解，利用最差解更新策略更新最差解，若在组内寻优更新最大次数内未找到最优解，那么基于最大蛙跳步长随机生成一个新解替换原有最差解，不考虑适应度大小比较，直接跳出组内寻优；Step 4. Set the upper limit of the number of optimization updates within the group. Within this number of times, fuzzy evolution is performed, and a new solution is randomly generated based on the maximum leapfrog step size. The current worst solution and the new solution correspond to the absolute value of the difference in fitness respectively. <=When taking the fuzzy interval used for the better solution, the system considers the new solution to be a better solution, and uses the worst solution update strategy to update the worst solution. If the optimal solution is not found within the maximum number of optimization updates within the group, Then, a new solution is randomly generated based on the maximum leapfrog step size to replace the original worst solution, without considering the fitness comparison, and directly jumping out of the group to seek optimization; 步骤5、判断是否达到子种群迭代次数，未达到则重复上述过程，达到了则重新划分种群，进行解空间分组重构；Step 5. Determine whether the number of iterations of the subpopulation is reached, if not, repeat the above process, if it is reached, re-divide the population, and perform solution space grouping reconstruction; 步骤6、判断当前解空间是否满足终止条件，不满足则继续计算，满足则算法终止，输出最优解。Step 6: Determine whether the current solution space satisfies the termination condition, if not, continue the calculation, if satisfied, the algorithm terminates, and the optimal solution is output. 2.如权利要求1所述的基于混合蛙跳算法的协同工业设计平台任务调度方法，其特征在于，所述约束函数包括约束函数1、约束函数2、约束函数3；2. The collaborative industrial design platform task scheduling method based on the hybrid leapfrog algorithm according to claim 1, wherein the constraint function comprises a constraint function 1, a constraint function 2, and a constraint function 3; 约束函数1：针对某个协同工业设计的项目，包含n项工作W1, W2,…,Wn，依据计划，项目总耗时D为：Constraint function 1: For a collaborative industrial design project, including n tasks W 1 , W 2 ,…,W n , according to the plan, the total project time D is: D = DW1 + DW2 + … + DWn D = DW 1 + DW 2 + … + DW n DW为计划设定的可接受的工作时长Acceptable working hours set by DW for the program 而某项工作Wn又可以被分解为wn个任务T，T将由设计人员或代理程序来执行，即分配给设计人员或代理程序的任务，至少要持续保持达到M分钟以上，才能确保任务有效，设DT为某个任务T的持续时间：And a certain work Wn can be decomposed into wn tasks T, T will be executed by the designer or the agent program, that is, the task assigned to the designer or the agent program must last for at least M minutes to ensure that the task is effective, Let DT be the duration of some task T: DT>= MDT>= M 任务数量最大值约束：Maximum number of tasks constraints: wn <= DWn / M + 1wn <= DWn / M + 1 基于任务计算项目总耗时：Calculate total project time based on tasks: D =(W1DT1+W1DT2+…+W1DTw1) + (W2DT1+W2DT2+…+W2DTw2) + …D = (W1DT 1 +W1DT 2 +…+W1DT w1 ) + (W2DT 1 +W2DT 2 +…+W2DT w2 ) + … +(WnDT1+WnDT2+…+WnDTwn)+(WnDT 1 +WnDT 2 +…+WnDT wn ) D >= (w1 + w2 + … + wn) * MD >= (w1 + w2 + … + wn) * M 约束函数2：针对每个任务T，令H为参与的设计人员数，Dh为人工工时，P为参与的代理程序线程数，Dp为代理程序执行时间，人员效率指标为Kh，代理程序性能指标为Kp，单个任务分配的最多人员数为Mh、最大线程数为Mp：Constraint function 2: For each task T, let H be the number of designers involved, Dh be the man-hours, P be the number of agent threads involved, Dp be the execution time of the agent, the personnel efficiency index be Kh, and the agent performance index For Kp, the maximum number of personnel allocated to a single task is Mh, and the maximum number of threads is Mp: Dh = Kh / HDh = Kh / H Dp = Kp / PDp = Kp / P WnDT = Khwn / Hwn + Kpwn / Pwn WnDT = Kh wn / H wn + Kp wn / P wn H <= MhH <= Mh P <= MpP <= Mp 当参与人员越少或者分配的代理程序线程数越少，任务执行耗时就越长，反之任务执行速度快，但费用可能会更高When there are fewer participants or fewer agent threads are allocated, the task execution time will be longer, otherwise the task execution speed will be faster, but the cost may be higher 约束函数3：设人工工时费率为Ch、电费折算率为Cp，那么单个任务费用：Constraint function 3: Set the labor hour rate as Ch and the electricity rate conversion rate as Cp, then the cost of a single task: CT = Dh * Ch + Dp * CpCT = Dh * Ch + Dp * Cp 项目总费用为：The total project cost is: C = Ch * (W1Kh1 / W1H1 + W1Kh2 / W1H2 + … + W1Khw1 / W1Hw1)C = Ch * (W1Kh 1 / W1H 1 + W1Kh 2 / W1H 2 + … + W1Kh w1 / W1H w1 ) + Ch * (W2Kh1 / W2H1 + W2Kh2 / W2H2 + … + W2Khw2 / W1Hw2)+ Ch * (W2Kh 1 / W2H 1 + W2Kh 2 / W2H 2 + … + W2Kh w2 / W1H w2 ) + … +… + Ch * (WnKh1 / WnH1 + WnKh2 / WnH2 + … + WnKhwn / WnHwn)+ Ch * (WnKh 1 / WnH 1 + WnKh 2 / WnH 2 + … + WnKh wn / WnH wn ) + Cp * (W1Kp1 / W1P1 + W1Kp2 / W1P2 + … + W1Kpw1 / W1Pw1)+ Cp * (W1Kp 1 / W1P 1 + W1Kp 2 / W1P 2 + … + W1Kp w1 / W1P w1 ) + Cp * (W2Kp1 / W2P1 + W2Kp2 / W2P2 + … + W2Kpw2 / W1Pw2)+ Cp * (W2Kp 1 / W2P 1 + W2Kp 2 / W2P 2 + … + W2Kp w2 / W1P w2 ) + … +… + Cp * (WnKp1 / WnP1 + WnKp2 / WnP2 + … + WnKpwn / WnPwn)+ Cp * (WnKp 1 / WnP 1 + WnKp 2 / WnP 2 + … + WnKp wn / WnP wn ) C < MCC < MC MC为项目总预算。MC is the total project budget. 3.如权利要求1所述的基于混合蛙跳算法的协同工业设计平台任务调度方法，其特征在于，适应度的函数设定为：3. the collaborative industrial design platform task scheduling method based on hybrid leapfrog algorithm as claimed in claim 1, is characterized in that, the function of fitness is set as: F(W, DT, H, P) = [Sigma(WiDTwi)] / [Sigma(WiHwi) + Sigma(WiPwi) ]F(W, DT, H, P) = [Sigma(WiDT wi )] / [Sigma(WiH wi ) + Sigma(WiP wi ) ] 其中i=1到n，wi <= DWi / M + 1 。where i=1 to n, wi <= DWi / M + 1 .
CN202011395327.5A 2020-12-03 2020-12-03 Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm Pending CN112598158A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011395327.5A CN112598158A (en) 2020-12-03 2020-12-03 Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011395327.5A CN112598158A (en) 2020-12-03 2020-12-03 Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm

Publications (1)

Publication Number Publication Date
CN112598158A true CN112598158A (en) 2021-04-02

Family

ID=75187627

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011395327.5A Pending CN112598158A (en) 2020-12-03 2020-12-03 Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm

Country Status (1)

Country Link
CN (1) CN112598158A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116432986A (en) * 2023-06-09 2023-07-14 华中科技大学 Reservoir optimal scheduling method based on particle frog jump lightning search algorithm

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108415773A (en) * 2018-02-27 2018-08-17 天津大学 A kind of efficient Method for HW/SW partitioning based on blending algorithm
CN108509269A (en) * 2018-02-27 2018-09-07 天津大学 A kind of Method for HW/SW partitioning shuffling the algorithm that leapfrogs based on supervision
CN110014550A (en) * 2019-04-17 2019-07-16 明光利拓智能科技有限公司 Opening control method for material inlet and outlet valves of material dryer based on mixed frog leaping algorithm
CN115496403A (en) * 2022-10-14 2022-12-20 石小锐 Scheduling method, device, electronic equipment and storage medium of a workshop logistics system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108415773A (en) * 2018-02-27 2018-08-17 天津大学 A kind of efficient Method for HW/SW partitioning based on blending algorithm
CN108509269A (en) * 2018-02-27 2018-09-07 天津大学 A kind of Method for HW/SW partitioning shuffling the algorithm that leapfrogs based on supervision
CN110014550A (en) * 2019-04-17 2019-07-16 明光利拓智能科技有限公司 Opening control method for material inlet and outlet valves of material dryer based on mixed frog leaping algorithm
CN115496403A (en) * 2022-10-14 2022-12-20 石小锐 Scheduling method, device, electronic equipment and storage medium of a workshop logistics system

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
周聪 等: "基于混合蛙跳算法的异地分布式协同开发的任务分配优化", 西北工业大学管理学院, vol. 34, no. 6, 13 October 2020 (2020-10-13), pages 148 - 155 *
林海涛 等: "基于重建策略的云工作流调度算法优化", 重庆邮电大学学报(自然科学版), vol. 29, no. 6, 15 December 2017 (2017-12-15), pages 822 - 829 *
欧阳;孙元姝;: "基于改进混合蛙跳算法的网格任务调度策略", 计算机工程, vol. 37, no. 21, 30 November 2011 (2011-11-30), pages 146 - 148 *
王金阳;郭承军;黄曼娜;: "改进蛙跳算法的约束处理方法", 仲恺农业工程学院学报, no. 01, 8 March 2017 (2017-03-08), pages 48 - 52 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116432986A (en) * 2023-06-09 2023-07-14 华中科技大学 Reservoir optimal scheduling method based on particle frog jump lightning search algorithm
CN116432986B (en) * 2023-06-09 2023-08-11 华中科技大学 A Reservoir Optimal Scheduling Method Based on Particle Leapfrog Lightning Search Algorithm

Similar Documents

Publication Publication Date Title
Shen et al. Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems
Chan et al. Production scheduling for precast plants using a flow shop sequencing model
CN113867295B (en) A method, system, device and storage medium for dynamic scheduling of AGV in a manufacturing workshop based on digital twin
CN113705866B (en) Scheduling optimization method and system based on resource-constrained project scheduling problem model
CN104065745A (en) Cloud computing dynamic resource scheduling system and method
CN108182518B (en) In-process state personnel scheduling method based on improved genetic algorithm
CN110837981B (en) Scheduling and control cooperative processing method and related equipment
CN105629927A (en) Hybrid genetic algorithm-based MES (Manufacturing Execution System) production planning and scheduling method
CN111047272A (en) Project scheduling method and device for multi-language collaborative development
CN112685153A (en) Micro-service scheduling method and device and electronic equipment
CN111144025A (en) Simulation model parameterization integration system and method based on multi-level reconstruction
CN112766782B (en) Modeling methods, scheduling methods, smart devices and storage media for government affairs processes
CN115310794A (en) Man-machine collaborative assembly line balancing method and device
CN115330179A (en) Assembly type building production scheduling optimization method considering resource limitation
CN112598158A (en) Task scheduling method of collaborative industrial design platform based on mixed frog leaping algorithm
CN113467399A (en) Knowledge-driven flexible discrete manufacturing production scheduling optimization method
CN115983429A (en) BIM model-based construction strategy optimization method, system, terminal and medium
Cao et al. Concrete plant operations optimization using combined simulation and genetic algorithms
CN115686788A (en) Heuristic task scheduling and energy consumption optimization method for cloud data center based on deep Q network
CN112488543B (en) Intelligent work site intelligent scheduling method and system based on machine learning
CN112148446B (en) An evolutionary strategy approach for multi-skill resource-constrained project scheduling
CN112598262A (en) Oil-gas well maintenance task scheduling processing method and device
CN116629433A (en) Flow-driven missile equipment guarantee resource allocation optimization method
CN115545329A (en) Integrated dynamic scheduling method suitable for clothing manufacturing production line
Nhu et al. Application of genetic algorithm, GA, to solve a flow shop scheduling problem with changeover times in operations: a case study

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20210402