Workshop decision unit scheduling method, apparatus and device, and storage medium
By constructing flexible strategic ensemble and game models in the flexible manufacturing workshop, and allocating tasks with the shortest maximum completion time and idle time, the problem of difficult scheduling algorithms in the flexible manufacturing workshop is solved, and the response period and stability are improved.
Patent Information
- Application Number
- CN202411179310.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-27
- Publication Date
- 2024-11-12
AI Technical Summary
In flexible manufacturing workshops, existing scheduling algorithms are difficult to adapt to frequent disturbances, resulting in long dynamic response cycles and poor real-time stability, and the inability to achieve the perfect execution of production operation plans.
Using the workshop decision unit scheduling method, by constructing flexible strategy ensemble and flexible strategy game model, the decision unit is used as the game participant, and the utility function is used to allocate tasks to be executed. The goal is to resolve conflicts and update the strategy. Collection, ultimately implement task allocation.
Improve the dynamic response capability and real-time stability of the flexible manufacturing workshop to ensure the effective implementation of production operation plans.
Smart Images

Figure CN118938839A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of workshop scheduling, and in particular to a workshop decision unit scheduling method, device, equipment and storage medium. Background Art
[0002] A flexible manufacturing workshop (FMW) is a flexible manufacturing production line or system consisting of discrete manufacturing equipment and its auxiliary material transportation. It is a series of flexible processing equipment connected by a resource circulation system. Discrete processing equipment builds a logical production line with the help of the circulation system. In the traditional flexible job shop scheduling problem (FJSP), the start-up delay caused by the distribution and circulation of resources is usually not considered, which usually leads to the production operation plan given by the scheduling system cannot be perfectly executed and cannot meet the planned expectations.
[0003] At present, most scheduling algorithms use heuristic algorithms such as genetic algorithms, simulated annealing algorithms, and intelligent optimization algorithms, which are difficult to adapt to various disturbances that frequently occur in FMW, resulting in long dynamic response cycles and poor real-time stability. Summary of the invention
[0004] The purpose of the present invention is to provide a workshop decision unit scheduling method, device, equipment and storage medium to solve the problem that the scheduling algorithm for flexible manufacturing workshops in the prior art has a long dynamic response cycle and poor real-time stability to various types of disturbances that frequently occur, resulting in the inability to perfectly execute production operation plans and achieve planned expectations.
[0005] To achieve the above objectives, in a first aspect, an embodiment of the present invention provides a workshop decision unit scheduling method, comprising:
[0006] According to the acquired tasks to be executed in the workshop, a flexible strategy set is constructed, wherein the flexible strategy set includes a plurality of corresponding relationships between the tasks to be executed and decision units; the decision units include processing units or distribution units;
[0007] Taking the decision-making units as game participants, a flexible strategic game model is constructed;
[0008] Solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0009] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0010] Furthermore, solving the flexible strategic game model to obtain the game result includes:
[0011] According to the flexible strategy set and the utility function, the flexible strategy game model is iteratively solved with Nash equilibrium as the game solution to obtain a target decision unit for executing the task to be executed.
[0012] Furthermore, the target decision unit is the decision unit that has the shortest maximum completion time and the shortest idle time required to complete the task to be executed when determining the task allocation schemes of other decision units except the target decision unit.
[0013] Furthermore, the method further comprises:
[0014] Compensating the maximum completion time and idle time of the second decision unit according to the lead time corresponding to the first decision unit;
[0015] Wherein, the advance time is related to the idleness of the first decision unit;
[0016] The first decision unit is one of the processing unit and the delivery unit, and the second decision unit is the other of the processing unit and the delivery unit.
[0017] Furthermore, the method further comprises:
[0018] In the case where there is a conflict in the game result, screening the decision-making units in the game result according to the task to be performed;
[0019] updating the flexible strategy set according to the screened decision-making units;
[0020] The flexible strategy game model is solved according to the updated flexible strategy set to obtain the target decision unit.
[0021] Furthermore, the method further comprises:
[0022] According to the game result, executing a first task among the tasks to be executed, wherein the first task is one or more of the tasks to be executed;
[0023] The tasks to be executed and the flexible strategy set are updated.
[0024] In a second aspect, an embodiment of the present invention provides a workshop decision unit scheduling device, including:
[0025] A first construction module is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence between multiple groups of the tasks to be executed and decision units; the decision units include processing units or distribution units;
[0026] The second building module is used to build a flexible strategic game model with the decision-making unit as the participant of the game;
[0027] A solution module, used to solve the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0028] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0029] In a third aspect, an embodiment of the present invention provides a workshop decision unit scheduling device, including: a processor;
[0030] The processor is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence between multiple groups of the tasks to be executed and decision units; the decision unit includes a processing unit or a distribution unit;
[0031] Taking the decision-making units as game participants, a flexible strategic game model is constructed;
[0032] Solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0033] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0034] In a fourth aspect, an embodiment of the present invention provides an electronic device, comprising a transceiver, a processor, a memory, and a program or instruction stored in the memory and executable on the processor; when the processor executes the program or instruction, the workshop decision unit scheduling method as described above is implemented.
[0035] In a fifth aspect, an embodiment of the present invention provides a readable storage medium having a program or instruction stored thereon, which, when executed by a processor, implements the steps in the workshop decision unit scheduling method as described above.
[0036] The beneficial effects of the above technical solution of the present invention are as follows:
[0037] The workshop decision unit scheduling method of the embodiment of the present invention takes the decision unit as a participant, constructs a flexible strategic game model, takes the task to be executed as a participant, and gives it the concept of "interest" through the utility function. Through the game between the decision units, an allocation scheme for allocating the task to be executed to the target decision unit is finally obtained. The workshop decision unit scheduling method of the embodiment of the present invention can solve the problem that the scheduling algorithm in the prior art is difficult to adapt to various disturbances that frequently occur in FMW, which leads to a long dynamic response cycle and poor real-time stability, and provides a guarantee for the completion of the production operation plan. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 A flow chart of a workshop decision unit scheduling method according to an embodiment of the present invention;
[0039] Figure 2 A schematic diagram of mutual compensation between two decision-making units according to an embodiment of the present invention;
[0040] Figure 3 A schematic diagram of solving a flexible strategic game model according to an embodiment of the present invention;
[0041] Figure 4 A schematic diagram of screening the decision-making unit in the game result of an embodiment of the present invention;
[0042] Figure 5 A schematic diagram of regulating a flexible strategic game model according to an embodiment of the present invention;
[0043] Figure 6 A schematic diagram of a module of a workshop decision unit scheduling device according to an embodiment of the present invention;
[0044] Figure 7 A schematic structural diagram of a workshop decision unit scheduling device according to an embodiment of the present invention;
[0045] Figure 8 Schematic diagram of the structure of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0046] In order to make the technical problems, technical solutions and advantages to be solved by the present invention more clear, a detailed description will be given below with reference to the accompanying drawings and specific embodiments.
[0047] It should be understood that the references to "one embodiment" or "an embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present invention. Therefore, the references to "in one embodiment" or "in an embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0048] In various embodiments of the present invention, it should be understood that the size of the serial numbers of the following processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
[0049] Additionally, the terms "system" and "network" are often used interchangeably herein.
[0050] In the embodiments provided in the present application, it should be understood that "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should also be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.
[0051] like Figure 1 As shown, a workshop decision unit scheduling method according to an embodiment of the present invention includes the following steps:
[0052] Step 101, constructing a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence relationship between multiple groups of the tasks to be executed and decision units; the decision units include processing units or distribution units;
[0053] Step 102, constructing a flexible strategic game model with the decision-making unit as a participant in the game;
[0054] Step 103, solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0055] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0056] Optionally, the corresponding relationship includes: a one-to-one, one-to-many or many-to-one corresponding relationship between the tasks to be executed and the decision units.
[0057] The workshop decision unit scheduling method of the embodiment of the present invention takes the decision unit as a participant, constructs a flexible strategic game model, takes the task to be executed as a participant, and gives it the concept of "interest" through the utility function. Through the game between the decision units, an allocation scheme for allocating the task to be executed to the target decision unit is finally obtained. The workshop decision unit scheduling method of the embodiment of the present invention can solve the problem that the scheduling algorithm in the prior art is difficult to adapt to various disturbances that frequently occur in FMW, which leads to a long dynamic response cycle and poor real-time stability, and provides a guarantee for the completion of the production operation plan.
[0058] It should be noted that the decision-making unit is used to process the tasks to be executed or to deliver the items corresponding to the tasks to be executed.
[0059] In the embodiment of the present invention, the flexible strategic game model is:
[0060] G= <T;{S i ,i∈T}; {u i ,i∈T}>;
[0061] Wherein, T = {1, 2, ..., n} is a set of participants, i.e., the decision-making unit of this application; the participants have a set of corresponding flexible strategies and m i is the number of optional strategies for participant i (i.e., the pending tasks that the decision-making unit can perform), u i Defined in ∏ T S i ={(s 1 ,s 2 ,…,s n )} on the effect function u i (s 1 ,s 2 ,…,s n ).
[0062] The players participating in the task allocation game are each processing unit or delivery unit, so there are a set of players:
[0063] T={i,i=1,2,…,n}
[0064] Among them, i represents any decision-making unit, and T represents the set of all decision-making units involved in processing.
[0065] Action is the currently issued production task. Generally speaking, the action set for each processing equipment (decision-making unit) is the same, which is the activated task set. Then:
[0066] a i ∈A i A i =T = {t 1 ,t 2 ,…,t m},i∈T
[0067] a i represents the action taken by decision-making unit i, A i Represents the set of all actions of decision-making unit i; in order to conveniently express the actions of all participants, the ordered set of participants' actions is defined:
[0068] a=(a1 ,a 2 ,…,a n )
[0069] a is an action section (slice), each element of which represents the action of each decision-making unit. Then it is obvious that A = ∏ T A i Let a∈A. The Cartesian product of all participants' action sets is the set of all possible action sections.
[0070] Strategy is the action rules of the participants, which stipulates the actions that the participants should take when it is their turn to act. It is a mapping relationship from the current situation to the action set:
[0071] s i =X i →A i ,i∈T
[0072] s i represents the strategy adopted by decision-making unit i, X i It represents the set of all possible decision situations that decision-making unit i may face in making decisions, namely the observation set. Let S i represents the set of all strategies of decision-making unit i. The ordered set of participant strategies is:
[0073] s=(s 1 ,s 2 ,…,s n )
[0074] s represents the strategy combination of n decision-making units, and S = ∏ T S i Let s∈S, where S represents the set of all strategy combinations in the game.
[0075] Payoff is the basis of the game, that is, the benefits obtained by the participants in the game, which is generally expressed in the form of effect function:
[0076] u i =u i (s 1 ,s 2 ,…,s n )=u i (s)
[0077] u i Represents the utility level of decision-making unit i. To conveniently express the strategic combination of all participants except participant i, we define:
[0078] s -i =(s j ),j≠i;j∈T
[0079] So s=(s i ,s -i ) i =u i (s i ,s -i )
[0080] For strategic games, there is no order in which participants make decisions, so for participant i, the observation set X i It is a constant in the whole strategic game process, that is, X 1 =X 2 =…X n = X. Since the game part in this scheduling algorithm is aimed at the current tasks to be executed, it is the operating status of the workshop during the current game. Each decision-making unit will build its own action set based on the current workshop status, and conduct group games based on the utility function to finally complete the assignment of tasks to be executed.
[0081] The flexible strategy set of the decision-making unit is the currently activated tasks to be executed, or more precisely, the processes to be executed. j The duration is:
[0082]
[0083] Where j = 1, 2, ..., m, Execute task t for decision unit i j The above formula will make the decision unit perform tasks that cannot be performed. When , the duration is assigned to positive infinity. Therefore, the strategy set of decision-making unit i can be expanded to a flexible strategy set:
[0084] s 1 =s 2 =…=s n ={t 1 ,t 2 ,…,t m}
[0085] Through the above operations, without affecting the actual logic, the strategy set of the decision-making unit is expanded to the same flexible strategy set, so that the set S of all strategy combinations in the game presents a convex set characteristic in topology, providing a good definition domain for the subsequent Nash equilibrium solution.
[0086] Optionally, the embodiment of the present invention minimizes the maximum completion time C max and minimize the average machine idle time As the basis for constructing the utility function, it ensures the timely completion of production orders and the effective use of related equipment. The duration of the kth task of decision unit i is Start time is and k=1,2,…,K i , K i is the number of all scheduled tasks for decision-making unit i, then:
[0087]
[0088] So the final completion time of decision unit i is:
[0089]
[0090] So, for have:
[0091]
[0092] To minimize the maximum completion time:
[0093]
[0094] It can be seen that the necessary condition for minimizing the maximum completion time is to minimize the completion time of each step of the work, so the completion time utility function of decision-making unit i when performing the kth task is constructed:
[0095]
[0096] And the free time utility function:
[0097]
[0098] In the game process, the choice of each decision-making unit will make and As small as possible to ensure its own "interests", so the utility function of decision-making unit i when performing the kth task is:
[0099]
[0100] Among them, α is the weight ratio of idle time to completion time, and 0≤α≤1.
[0101] The above utility function will make the decision-making unit more inclined to choose jobs that are completed faster and more efficient. This not only ensures the minimization of the overall completion time, but also balances the work intensity of each decision-making unit to a certain extent, ensuring the feasibility of the final game result.
[0102] For a single product production process, production processing and resource circulation (resource distribution) are essentially processes in which resources reach an ideal physical state after a series of processing. There is no essential difference between the two, and the two are interchangeable in event triggering, and have the same impact on the timely completion of production orders and the effective use of related equipment.
[0103] Therefore, it can be considered that the utility functions of the two are the same, and the utility function of decision-making unit i in the production process when performing the kth task can be recorded as:
[0104]
[0105] in, and are the completion time and idle time effect functions in the production process, are the weight ratios of the two types of utility functions in the production process, They are the start time of the work, the duration of the work, and the completion time of the previous work in the production and processing flow.
[0106] Correspondingly, the utility function of distribution unit i in the resource flow process when performing the kth task is:
[0107]
[0108] in, and are the completion time and idle time effect functions in the resource flow process, are the weight ratios of the two types of utility functions in the resource flow process, They are the work start time, work duration, and completion time of the previous work in the resource flow process.
[0109] Optionally, solving the flexible strategic game model to obtain a game result includes:
[0110] According to the flexible strategy set and the utility function, the flexible strategy game model is iteratively solved with Nash equilibrium as the game solution to obtain a target decision unit for executing the task to be executed.
[0111] For a given n-person strategic game model G = <1,2,…,n; S 1 ,S 2 ,…,S n ;u 1 ,u 2 ,…,u n >, Strategic Combination is a Nash equilibrium if and only if Sometimes:
[0112]
[0113] Solving the Nash equilibrium in a strategic game can enable each participant to obtain a relatively good result. Although the prisoner's dilemma may lead to a dilemma between pursuing win-win results and reducing benefits, this situation can be effectively avoided by combining the actual situation when constructing a flexible strategic game model, improving the effect function, and macroeconomic regulation.
[0114] For Nash equilibrium, the "arrow method" can be used for iterative solution, and the participants make greedy strategy choices in turn until each participant cannot further improve his own interests by changing his own strategy while the strategies of other participants remain unchanged.
[0115] Taking the above flexible strategic game model, where the game participants are processing units, as an example, the specific algorithm flow is as follows: Figure 3 As shown:
[0116] Step 1: Initialize variable s as the iteration carrier of the solution;
[0117] Step 2: Initialize i=1, b=1, i means the processing unit is currently being visited, b is the flag for changing the strategy, b=0 means the strategy has not been changed, b=1 means the strategy has been changed;
[0118] Step 3: Determine whether the processing units in T are completely traversed. If i≤maxT, they are not completely traversed and jump to step 6;
[0119] Step 4: Determine whether a strategy change occurs. If b = 1, strategy s changes and jump to step 2;
[0120] Step 5: Output the Nash equilibrium solution s and end.
[0121] Step 6: Initialize j = 1, j indicates that the current processing unit i uses task t j As its own strategy;
[0122] Step 7: Determine whether the strategy set S is completely traversed i ={t 1 ,t 2 ,…,t m}, if j≤m, it is a complete traversal and jumps to step 9;
[0123] Step 8: point the traversal pointer i to the next processing equipment i+1, i=i+1;
[0124] Step 9: Processing equipment determines the current strategy t j Is it more beneficial to yourself? i (t j ,s -i )≤u i(s) indicates that t j It is more beneficial to yourself, skip to step 11;
[0125] Step 10: Set the traversal pointer j to point to the next strategy t j+1 , j = j + 1;
[0126] Step 11: Update the optimal strategic slice s = (t j ,s -i ), when the strategic slice s changes, let b=1.
[0127] Optionally, the target decision unit is a decision unit among the decision units that has the shortest maximum completion time and the shortest idle time required to complete the task to be executed when determining the task allocation schemes of other decision units except the target decision unit.
[0128] Optionally, the method further comprises:
[0129] Compensating the maximum completion time and idle time of the second decision unit according to the lead time corresponding to the first decision unit;
[0130] Wherein, the advance time is related to the idleness of the first decision unit;
[0131] The first decision unit is one of the processing unit and the delivery unit, and the second decision unit is the other of the processing unit and the delivery unit.
[0132] From the perspective of a single decision-making unit (processing unit or distribution unit), the start of its own task is directly subject to the completion of tasks of specific units in other processes, such as Figure 2 shown.
[0133] In one embodiment of the present invention, the process of processing unit i performing task k is the main body, and when task k-1 is completed Task k can be performed at time , but since the relevant resources are not in place, processing unit i can only wait. The resource distribution of task k is performed by the resource circulation system. Before the time, the resource distribution of task k will block the start of task k. Therefore, the early distribution of task k by the resource circulation system can avoid the delayed start of task k and improve the utilization rate of processing unit i. However, due to the capacity and busyness of the resource circulation system, the advance degree of resource distribution of task k is limited.
[0134] It is not difficult to see that in the resource distribution time of task k At a certain time, the busier the resource circulation system is, the longer it takes for resources to be delivered to processing unit i. In other words, the idleness of the resource circulation system alleviates the start-up delay of task k to a certain extent. It can be said that resource circulation compensates for production and processing to a certain extent.
[0135] Current Record The maximum time required to distribute the resources of task k to processing unit i can be expressed as:
[0136]
[0137] The completion time of task k is the completion time of task k-1 plus the resource distribution time. and task duration Finally, subtract the delivery task lead time As compensation. Then we have:
[0138]
[0139] Then the utility function of the flexible processing unit in the production process is:
[0140]
[0141] In the above formula, is related to the lead time of the delivery task, and its dimension is 1, then it is called is the compensation coefficient of the resource flow process for the production process when the processing unit i performs task k. From the above formula, we can know that:
[0142] The equal status of production and processing processes and resource circulation processes will Substituting the formula, we can analogize the distribution unit effect function with compensation mechanism in the resource circulation process as follows:
[0143]
[0144] Among them, the maximum time required for the resources required for task k to be delivered from the first processing after the last delivery to the completion of processing is Therefore, a utility function based on the compensation mechanism is constructed for the production and processing process and the resource flow process, which is used for the subsequent macro-control at the workshop system level.
[0145] Optionally, the method further comprises:
[0146] In the case where there is a conflict in the game result, screening the decision-making units in the game result according to the task to be performed;
[0147] updating the flexible strategy set according to the screened decision-making units;
[0148] The flexible strategy game model is solved according to the updated flexible strategy set to obtain the target decision unit.
[0149] In order to solve the problem that the Nash equilibrium solution does not conform to the actual logic, we can analyze the disadvantaged decision-making unit from the perspective of the task, and remove it from the strategic set of the disadvantaged unit, and finally obtain the Nash equilibrium solution in the feasible domain. The conflict elimination and re-game process is as follows: Figure 4 As shown:
[0150] First, the game object is selected according to the task, and then the game model is constructed according to the strategic game, and the Nash equilibrium is used as the game result. When the game results conflict, reverse selection is performed, that is, the conflicting decision-making unit is examined from the perspective of the task, and the advantaged decision-making unit is selected according to the principle of the shortest task execution duration, and the corresponding one is the disadvantaged decision-making unit. Next, the conflicting task strategy is eliminated from the flexible strategy set of each disadvantaged decision-making unit. If the flexible strategy set of the unit is empty at this time, the participant identity of the decision-making unit is eliminated in the game model.
[0151] Through the above method, the discreteness of the feasible domain caused by the early elimination of conflicting options is avoided, thereby ensuring the continuity of the feasible domain in the process of solving the Nash equilibrium, which helps the solution process to jump out of the local extreme value and find the global optimal solution of the group flexible strategy game model.
[0152] Optionally, the method further comprises:
[0153] According to the game result, executing a first task among the tasks to be executed, wherein the first task is one or more of the tasks to be executed;
[0154] The tasks to be executed and the flexible strategy set are updated.
[0155] It should be noted that the tasks to be executed include processing or distribution tasks corresponding to one or more products; the first task includes tasks corresponding to one or more processes of a product, or the first task includes tasks corresponding to multiple processes of multiple products.
[0156] Optionally, the to-be-performed task and the flexible strategy set are updated when one of the following conditions is met:
[0157] After the first task is completed;
[0158] The game result is obtained and the allocation of the tasks to be performed is completed according to the game result.
[0159] It can be seen from the utility function with compensation mechanism that the processing unit and the distribution unit, as participants in the game model, have compensation coefficients in their utility functions. and They are positively correlated with the advance degree of the delivery task and the advance degree of the task to be executed. The advance degree of the task depends on the overall capacity or busyness of the task execution module. Therefore, the compensation coefficient can be dynamically modified according to the module capacity and idleness, thereby realizing the macro-control of the module management layer.
[0160] In the embodiment of the present invention, the degree of advance of the task to be executed depends on the busyness of the production and processing module, and the compensation coefficient It is positively correlated with the idleness of the production and processing module, so the compensation coefficient of the distribution unit is:
[0161]
[0162] Among them, T A Participants (processing units) in the flexible strategic game model of the production process. is the equipment idle rate (idle time and / or ).
[0163] In the embodiment of the present invention, the advance degree of the distribution task depends on the busyness of the resource flow module, so the compensation coefficient It is positively correlated with the idleness of the resource flow module, so the compensation coefficient of the processing unit is:
[0164]
[0165] Among them, T B Participants (distribution units) in the flexible strategic game model of resource flow process, is the equipment idle rate (idle time and / or ).
[0166] On the basis that the compensation coefficient can be calculated, the game between unit levels will be regulated by the macro system, such as Figure 5 shown.
[0167] When the production order task is issued, the processing steps of each product are placed in the activated set of tasks to be executed. Then, the idle processing units are used as participants and the activated tasks to be executed are used as the flexible strategy set. The improved composite utility function is used to construct the production and processing flexible strategy game model. The flexible strategy game model solution based on Nash equilibrium is adopted, conflicts are eliminated and then the game is played, and finally the production and processing operation plan is obtained. The production and processing operation plan generates a resource demand order, which is handled by the resource flow module. Its process is similar to that of the production and processing module.
[0168] The production order task is decomposed into the production and processing operation plan and the resource flow operation plan. According to the operation plan, the pending tasks and distribution tasks are respectively issued to the designated processing unit and distribution unit. When the task is completed, the status of the processing unit and distribution unit in the production and processing module and the resource flow module is first updated, and then a new pending task is activated or a resource return and distribution task is generated, and the new task is updated to the activated task set. This cycle continues until all products in the production order have been processed.
[0169] During this period, the production and processing module and the resource circulation module dynamically update the compensation factor in the utility function according to their own average idle rate, thereby dynamically adjusting the utility function, and further realizing macro-control of the flexible strategic game model at the management level.
[0170] like Figure 6 As shown, a workshop decision unit scheduling device 600 according to an embodiment of the present invention includes:
[0171] The first construction module 601 is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence relationship between multiple groups of the tasks to be executed and decision units; the decision units include processing units or distribution units;
[0172] The second construction module 602 is used to construct a flexible strategic game model with the decision-making unit as a participant in the game;
[0173] A solution module 603 is used to solve the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0174] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0175] The workshop decision unit scheduling device of the embodiment of the present invention constructs a flexible strategic game model by taking the decision unit as a participant, taking the task to be executed as a participant, and giving it the concept of "interest" through the utility function. Through the game between the decision units, an allocation scheme for allocating the task to be executed to the target decision unit is finally obtained. The workshop decision unit scheduling method of the embodiment of the present invention can solve the problem that the scheduling algorithm in the prior art is difficult to adapt to various disturbances that frequently occur in FMW, which leads to a long dynamic response cycle and poor real-time stability, and provides a guarantee for the completion of the production operation plan.
[0176] like Figure 7 As shown, a workshop decision unit scheduling device 700 according to an embodiment of the present invention includes a processor 710, wherein:
[0177] The processor is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence between multiple groups of the tasks to be executed and decision units; the decision unit includes a processing unit or a distribution unit;
[0178] Taking the decision-making units as game participants, a flexible strategic game model is constructed;
[0179] Solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit;
[0180] The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
[0181] An electronic device according to an embodiment of the present invention, such as Figure 8 As shown, it includes a transceiver 810, a processor 800, a memory 820, and a program or instruction stored in the memory 820 and executable on the processor 800; when the processor 800 executes the program or instruction, the above-mentioned scheduling method applied to the workshop decision unit is implemented.
[0182] The transceiver 810 is used to receive and send data under the control of the processor 800 .
[0183] Among them, Figure 8 In the embodiment, the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by processor 800 and various circuits of memory represented by memory 820 are linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The transceiver 810 may be a plurality of components, namely, a transmitter and a receiver, providing a unit for communicating with various other devices on a transmission medium. For different user devices, the user interface 830 may also be an interface capable of externally and internally connecting required devices, and the connected devices include but are not limited to a keypad, a display, a speaker, a microphone, a joystick, and the like.
[0184] The processor 800 is responsible for managing the bus architecture and general processing, and the memory 820 can store data used by the processor 800 when performing operations.
[0185] A readable storage medium according to an embodiment of the present invention stores a program or instruction thereon. When the program or instruction is executed by a processor, the steps in the workshop decision unit scheduling method as described above are implemented and the same technical effect can be achieved. To avoid repetition, it will not be described here.
[0186] The processor is a processor in the electronic device described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0187] It should be further explained that the terminals described in this specification include but are not limited to smart phones, tablet computers, etc., and many of the functional components described are called modules in order to more particularly emphasize the independence of their implementation methods.
[0188] In the embodiment of the present invention, module can be implemented with software so that it can be executed by various types of processors. For example, an executable code module of an identification can include one or more physical or logical blocks of computer instructions, for example, it can be constructed as an object, process or function. Nevertheless, the executable code of the identified module does not need to be physically located together, but can include different instructions stored in different positions, and when these instructions are logically combined together, it constitutes a module and realizes the specified purpose of the module.
[0189] In fact, executable code module can be a single instruction or many instructions, and can even be distributed on a plurality of different code segments, distributed among different programs, and distributed across a plurality of memory devices. Similarly, operating data can be identified in the module, and can be implemented and organized in the data structure of any appropriate type according to any appropriate form. The operating data can be collected as a single data set, or can be distributed in different locations (including on different storage devices), and can only be present on a system or network as an electronic signal at least in part.
[0190] When a module can be implemented by software, considering the level of existing hardware technology, a person skilled in the art can build a corresponding hardware circuit to implement the corresponding function of the module that can be implemented by software without considering the cost. The hardware circuit includes a conventional very large scale integration (VLSI) circuit or gate array and existing semiconductors such as logic chips, transistors, or other discrete components. The module can also be implemented by a programmable hardware device, such as a field programmable gate array, a programmable array logic, a programmable logic device, etc.
[0191] The above exemplary embodiments are described with reference to the accompanying drawings, and many different forms and embodiments are feasible without departing from the spirit and teachings of the present invention. Therefore, the present invention should not be constructed as a limitation of the exemplary embodiments proposed herein. More specifically, these exemplary embodiments are provided so that the present invention will be perfect and complete, and the scope of the present invention will be conveyed to those who are familiar with the technology. In these figures, the component sizes and relative sizes may be exaggerated for clarity. The terms used here are only based on the purpose of describing specific exemplary embodiments and are not intended to be limiting. As used herein, unless the text clearly indicates otherwise, the singular forms "one", "an" and "the" are intended to include these multiple forms. It will be further understood that the terms "including" and / or "comprising" when used in this specification indicate the presence of the features, integers, steps, operations, components and / or components, but do not exclude the presence or increase of one or more other features, integers, steps, operations, components, components and / or their groups. Unless otherwise indicated, when stated, a range of values includes the upper and lower limits of that range and any subranges therebetween.
[0192] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A workshop decision unit scheduling method, characterized in that: include: According to the acquired tasks to be executed in the workshop, a flexible strategy set is constructed, wherein the flexible strategy set includes a plurality of corresponding relationships between the tasks to be executed and decision units; the decision units include processing units or distribution units; Taking the decision-making units as game participants, a flexible strategic game model is constructed; Solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit; The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
2. The workshop decision unit scheduling method according to claim 1, characterized in that: Solving the flexible strategic game model to obtain game results includes: According to the flexible strategy set and the utility function, the flexible strategy game model is iteratively solved with Nash equilibrium as the game solution to obtain a target decision unit for executing the task to be executed.
3. The workshop decision unit scheduling method according to claim 1 or 2, characterized in that: The target decision unit is a decision unit among the decision units that has the shortest maximum completion time and the shortest idle time required to complete the task to be executed when determining the task allocation schemes of other decision units except the target decision unit.
4. The workshop decision unit scheduling method according to claim 1, characterized in that: The method further comprises: Compensating the maximum completion time and idle time of the second decision unit according to the lead time corresponding to the first decision unit; Wherein, the advance time is related to the idleness of the first decision unit; The first decision unit is one of the processing unit and the delivery unit, and the second decision unit is the other of the processing unit and the delivery unit.
5. The workshop decision unit scheduling method according to claim 1, characterized in that: The method further comprises: In the case where there is a conflict in the game result, screening the decision-making units in the game result according to the task to be performed; updating the flexible strategy set according to the screened decision-making units; The flexible strategy game model is solved according to the updated flexible strategy set to obtain the target decision unit.
6. The workshop decision unit scheduling method according to claim 1, characterized in that: The method further comprises: According to the game result, executing a first task among the tasks to be executed, wherein the first task is one or more of the tasks to be executed; The tasks to be executed and the flexible strategy set of the decision-making unit are updated.
7. A workshop decision unit scheduling device, characterized in that: include: A first construction module is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence between multiple groups of the tasks to be executed and decision units; the decision units include processing units or distribution units; The second building module is used to build a flexible strategic game model with the decision-making unit as the participant of the game; A solution module, used to solve the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit; The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
8. A workshop decision unit scheduling device, characterized in that: include: processor; The processor is used to construct a flexible strategy set according to the acquired tasks to be executed in the workshop, wherein the flexible strategy set includes a correspondence between multiple groups of the tasks to be executed and decision units; the decision unit includes a processing unit or a distribution unit; Taking the decision-making units as game participants, a flexible strategic game model is constructed; Solving the flexible strategy game model according to the flexible strategy set and the utility function to obtain a game result, wherein the game result is an allocation scheme for allocating the tasks to be executed to the target decision-making unit; The utility function is related to the maximum completion time and idle time of the decision-making units in the workshop.
9. An electronic device, comprising: A transceiver, a processor, a memory, and a program or instruction stored in the memory and executable on the processor; characterized in that when the processor executes the program or instruction, the workshop decision unit scheduling method as described in any one of claims 1-6 is implemented.
10. A readable storage medium having a program or instruction stored thereon, characterized in that: When the program or instruction is executed by the processor, the steps in the workshop decision unit scheduling method as described in any one of claims 1-6 are implemented.
