Scheduling method, electronic equipment, storage medium and program product

Abstract

The embodiment of the invention relates to the technical field of factory scheduling, and discloses a scheduling method, electronic equipment, a storage medium and a program product, and the method comprises the steps: obtaining first demand data input by a user; the first demand data at least comprises a first start serial number, a first identifier of a first to-be-produced object and a first production quantity N of the first to-be-produced object, and N is a natural number greater than or equal to 0; obtaining the first target scheduling information according to the first demand data; the first target scheduling information represents a production plan for producing N first to-be-produced objects; therefore, the production plan for producing the N first to-be-produced objects is obtained according to the first demand data, so that the first target scheduling information is related to user demands, tasks such as new orders, order insertion and order withdrawal can be realized by inputting different first demand data, and the intelligent degree of a factory system is improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the technical field of factory scheduling, and in particular to a scheduling method, electronic equipment, storage medium, and program product. Background Art

[0002] At present, traditional manual scheduling and dispatching can no longer meet the needs of production. With the intelligent development of factory equipment, the workstations and staff in the factory are now managed and controlled through algorithms based on the degree of automation and intelligence.

[0003] However, the current factory system is still relatively low in intelligence and is unable to complete tasks such as placing new orders, inserting orders, and canceling orders based on actual user needs. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide a scheduling method, an electronic device, a storage medium and a program product, so as to improve the intelligence level of the factory system.

[0005] To solve the above technical problems, an embodiment of the present application provides a scheduling method for obtaining first demand data input by a user; the first demand data at least includes a first starting sequence number, a first identifier of a first object to be produced, and a first production quantity N of the first object to be produced, where N is a natural number greater than or equal to 0; the first target scheduling information is obtained according to the first demand data; the first target scheduling information represents a production plan for producing N of the first objects to be produced.

[0006] An embodiment of the present application also provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the scheduling method as described above.

[0007] An embodiment of the present application further provides a computer-readable storage medium storing a computer program, wherein the computer program implements the above-mentioned scheduling method when executed by a processor.

[0008] An embodiment of the present application further provides a computer program product, including a computer program, and when the computer program is executed by a processor, the above-mentioned scheduling method is implemented.

[0009] In some embodiments, obtaining scheduling information corresponding to the user demand based on the first demand data includes: converting the first demand data into a first production task list; the first production task list represents the first serial number of each of the N first objects to be produced, and each first serial number includes the first identifier and the first number; obtaining the first target scheduling information based on the first production task list.

[0010] In some embodiments, before converting the first demand data into a first production task list, it also includes: determining whether the first starting sequence number exists in the current scheduling information; the current scheduling information is the scheduling information being executed; the current scheduling information includes a second sequence number for each production object, the second sequence number includes a second identifier and a second number for the production object; the second sequence number of each production object is arranged in sequence; if it exists, the remaining tasks of the production objects are deleted from the current scheduling information, and the remaining second sequence numbers of the production objects are not earlier than the first starting sequence number; if it does not exist, the current scheduling information is retained.

[0011] In some embodiments, the first demand data further includes a first demand start time; the first production task list further includes a first estimated start time common to N first objects to be produced;

[0012] The conversion of the first demand data into a first production task list includes: obtaining N first serial numbers of N first objects to be produced according to the first identifier and the first production quantity N; and obtaining the first estimated start time according to the first demand start time; the first estimated start time is obtained in the following manner: judging whether the first demand start time is before the estimated completion time, if so, setting the first estimated start time as the estimated completion time; if not, setting the first estimated start time as the first demand start time; wherein the estimated completion time is the end time of a target production object of the current scheduling information, the second serial number of the target production object is adjacent to the first start serial number and is located before the first start serial number, or the estimated completion time is the total end time of the current scheduling information; the first production task list is generated according to the N first serial numbers of N first objects to be produced and the first estimated start time.

[0013] In some embodiments, the first identifier is different from the second identifier; the first starting sequence number is one of the second sequence numbers of the current scheduling information; the method also includes: obtaining second demand data input by the user; the second demand data at least includes a second starting sequence number, a third identifier of the second object to be produced, a second production quantity M of the second object to be produced, and a second demand start time; M is a natural number greater than or equal to 0; the second demand start time is later than the first demand start time; the third identifier is the same as the second identifier; the second target scheduling information is obtained according to the second demand data; the second target scheduling information represents a production plan for producing M of the second objects to be produced.

[0014] In some embodiments, obtaining the second target scheduling information according to the second demand data includes: obtaining M third serial numbers of M second objects to be produced according to the second starting serial number, the third identifier, and the second production quantity M; each third serial number includes the third identifier and the third number; the third serial numbers of each second object to be produced are arranged in sequence; obtaining the second estimated start time according to the total end time of the first target scheduling information; the second estimated start time is no earlier than the total end time of the first target scheduling information; generating the second production task list according to the M third serial numbers and the second estimated start time of the M second objects to be produced; and obtaining the second target scheduling information according to the second production task list.

[0015] In some embodiments, the method also includes: monitoring the execution status of the current scheduling information; when an abnormality occurs in the current scheduling information, obtaining abnormal workstation information and a third production task list of the unfinished production objects; the third production task list includes the second serial number of each unfinished production object; and re-arranging the current scheduling information according to the abnormal workstation information and the third production task list.

[0016] The technical solution provided by the embodiment of the present application has at least the following advantages:

[0017] In the scheduling process of this embodiment, the user inputs first demand data, and the first demand data at least includes a first starting sequence number, a first identifier of a first object to be produced, and a first production quantity N of the first object to be produced. The first target scheduling information is obtained according to the first demand data, so as to obtain a production plan for producing N first objects to be produced according to the first demand data, so that the first target scheduling information is related to the user demand. By inputting different first demand data, tasks such as new orders, inserted orders, and cancelled orders can be realized, thereby improving the intelligence level of the factory system. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] One or more embodiments are exemplarily described by pictures in the corresponding drawings, and these exemplified descriptions do not constitute limitations on the embodiments. Elements with the same reference numerals in the drawings represent similar elements, and unless otherwise stated, the figures in the drawings do not constitute proportional limitations.

[0019] Figure 1 is a flowchart of a scheduling method according to an embodiment of the present application;

[0020] Figure 2 is a flowchart of the sub-steps of step 102 according to an embodiment of the present application;

[0021] Figure 3 is a flowchart of a scheduling method according to another embodiment of the present application;

[0022] Figure 4 is a flowchart of sub-steps of step 205 according to another embodiment of the present application;

[0023] Figure 5 is a flowchart of a scheduling method according to another embodiment of the present application;

[0024] Figure 6 is a flowchart of sub-steps of step 303 according to another embodiment of the present application;

[0025] Figure 7 is an overall logic diagram of a scheduling method according to an embodiment of the present application;

[0026] Figure 8 is a logic diagram of the execution process of the scheduling method according to an embodiment of the present application;

[0027] Fig. 9 It is a structural schematic diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0028] As can be seen from the background technology, the current factory system is still relatively low in intelligence and is unable to complete tasks such as placing new orders, inserting orders, and canceling orders according to actual needs of users.

[0029] Through analysis and research, it was found that the reason why the current factory system's intelligence level is still relatively low is that in the relevant technologies, when a new order task appears in the intelligent factory system, the new order is taken as a whole to determine the scheduling of the new order and the priority between the new order and the original order in order to realize the new order and insertion task. That is, the relevant technology obtains the nodes of new orders and insertion orders through system calculation, rather than setting them according to user needs. At the same time, the relevant technology cannot complete the order cancellation task according to user needs, resulting in a low level of intelligence.

[0030] In order to solve the above technical problems, the present application provides a scheduling method, including: obtaining first demand data input by a user; the first demand data at least includes a first starting sequence number, a first identifier of a first object to be produced, and a first production quantity N of the first object to be produced, where N is a natural number greater than or equal to 0; obtaining first target scheduling information according to the first demand data; the first target scheduling information represents a production plan for producing N first objects to be produced.

[0031] In the scheduling process of this embodiment, the user inputs first demand data, and the first demand data at least includes a first starting sequence number, a first identifier of a first object to be produced, and a first production quantity N of the first object to be produced. The first target scheduling information is obtained according to the first demand data, so as to obtain a production plan for producing N first objects to be produced according to the first demand data, so that the first target scheduling information is related to the user demand. By inputting different first demand data, tasks such as new orders, inserted orders, and cancelled orders can be realized, thereby improving the intelligence level of the factory system.

[0032] To make the purpose, technical scheme and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings. However, it will be appreciated by those skilled in the art that in the present application, many technical details are proposed in order to enable the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical scheme claimed in the present application can also be implemented. The division of the following embodiments is for the convenience of description, and the specific implementation of the present application should not be construed as any limitation, and the various embodiments can be combined and referenced with each other under the premise of no contradiction.

[0033] An embodiment of the present application relates to a scheduling method, and a specific flow chart is as follows: Figure 1 As shown, the scheduling method includes the following steps:

[0034] Step 101: Acquire first demand data input by a user.

[0035] The execution subject of this embodiment is an electronic device, which can be a terminal, a server, etc. In the production process, the identification of each production object and the corresponding BOM (Bill Of Material) information will be set in advance in the electronic device. The BOM information is also called a product structure tree, which describes the composition of each component of a product and the hierarchical structure of each component composition, that is, the BOM shows the parent-child relationship between each large component, medium component, and small component of the production object. Each production object corresponds to a total serial number, which is the highest-level serial number. For each large component, medium component, and small component of the production object, there is a corresponding sub-serial number, and the total serial number, the sub-serial number of each component and the parent-child relationship between the components are complete sets. The total serial number can read the model, production time, and production serial number of the production object, and the sub-serial number can read the model, production time, and production serial number of the corresponding component (large component, medium component, small component).

[0036] For example, when the production object is a fan, the BOM information of the fan is the various components of the fan and the hierarchical relationship between the various components, that is, the parent-child relationship. The fan as a whole has a total serial number, and each component of the fan has its own corresponding sub-serial number. The total serial number and each sub-serial number are a set; electronic equipment needs to maintain the nested relationship between the total serial number and the sub-serial number in advance, so that it can be scheduled later according to the total serial number entered by the user.

[0037] Specifically, the first demand data of this embodiment includes at least a first starting sequence number, a first identifier of the first object to be produced, and a first production quantity N of the first object to be produced, where N is a natural number greater than or equal to 0; the purpose of the user inputting the first demand data is to generate the first target scheduling information representing the production plan for producing N first objects to be produced; the user can use the first demand data to realize the functions of placing new orders, inserting orders, and canceling orders.

[0038] Step 102: Obtain first target scheduling information according to first demand data.

[0039] Specifically, the first target scheduling information represents the production plan for producing N first objects to be produced; the first target scheduling information includes the production information of each small component, medium component, and large component in the N first objects to be produced, including the corresponding workstation information and team information. The workstation information includes the workstation identification, the workstation start working time, and the workstation end working time. The team information includes the team identification, the team start working time, and the team end working time.

[0040] like Figure 2 FIG. 1 is a flow chart of sub-steps of step 102. Step 102 is to obtain scheduling information corresponding to the user's demand according to the first demand data, and includes the following sub-steps:

[0041] Step 1021: convert the first demand data into a first production task list.

[0042] Specifically, the first production task list represents the first serial number of each first object to be produced among N first objects to be produced, each first serial number includes a first identifier and a first number; the first serial number is the total serial number of the first object to be produced, which is the highest level serial number.

[0043] Step 1022, obtaining first target scheduling information according to the first production task list.

[0044] Specifically, after generating the first production task list, the first serial number of each of the N first objects to be produced is obtained, and the N first serial numbers include a first identifier and a first number. For example, the first identifier of the N first serial numbers is A, the first numbers of the N first serial numbers are 01, 02, and 03 respectively, and the N first serial numbers are A01, A02, and A03 respectively.

[0045] This embodiment uses a genetic algorithm to generate the first target scheduling information according to the first production task list. Before using the genetic algorithm to obtain the first target scheduling information, it is necessary to store the first identification of the first object to be produced and the process path map corresponding to the first identification in the electronic device in advance. Specifically, the electronic device stores the corresponding process path map for each component of the first object to be produced (including large components, medium components, and small components) in advance. The relevant information of the process path map can be provided by the process topology map. The process path map includes the production process of each component and the required team members. At the same time, the electronic device also needs to store the workstation execution capability information of each workstation in the factory in advance, that is, the capabilities of the workstation, that is, what types of parts of the production object (including large components, medium components, and small components) the workstation can produce. The electronic device also needs to store team information. The team information includes the team's execution capability and the team's available working time, including working days, rest days, and rest time periods on working days.

[0046] Since the electronic equipment has already maintained the nested relationship between the total serial number and the sub-serial number, the process path diagram, the workstation execution capability information, and the team information in advance, these can be used as constraints of the genetic algorithm, and the genetic algorithm can generate the first target scheduling information under these constraints. Constraints can also include time constraints of the workstation, such as the necessary maintenance and cleaning time of the workstation.

[0047] Specifically, the genetic algorithm first disassembles the hierarchy of the first production task list. Since the electronic device contains BOM information and a process path diagram for producing each component, each component can be arranged for production at the corresponding workstation according to the workstation execution capability information, and the corresponding team can be arranged to execute it. At the same time, the genetic algorithm can also obtain the subsequence numbers of each component (including large components, medium components, and small components) of the N first objects to be produced according to the obtained N first sequence numbers, and each component is produced according to the order of the corresponding subsequence numbers, that is, small components are produced first according to the subsequence numbers of small components, and then medium components are produced according to the subsequence numbers of medium components, and large components are produced according to the subsequence numbers of large components, and manufacturing is carried out layer by layer until the entire first object to be produced is produced according to the first sequence number.

[0048] Specifically, the first demand data may also include designated workstation information, i.e., the workstations at which the first object to be produced must be produced. Thus, when the genetic algorithm generates the first target scheduling information, the designated workstation information input by the user is used as a constraint condition to generate the first target scheduling information that meets the user's needs.

[0049] In this embodiment, during the scheduling process, the user inputs first demand data, where the first demand data includes at least a first starting sequence number, a first identifier of a first object to be produced, and a first production quantity N of the first object to be produced. The first target scheduling information is obtained according to the first demand data, thereby achieving a production plan for producing N first objects to be produced according to the first demand data, so that the first target scheduling information is related to the user demand. By inputting different first demand data, tasks such as new orders, inserted orders, and cancelled orders can be realized, thereby improving the intelligence level of the factory system.

[0050] Another embodiment of the present application relates to a scheduling method, the specific flow chart is as follows Figure 3 As shown, the scheduling method includes the following steps:

[0051] Step 201: Acquire first demand data input by a user.

[0052] Step 201 is substantially the same as step 101 and will not be described again to avoid repetition.

[0053] Step 202, determine whether the first starting sequence number exists in the current scheduling information; if it exists, go to step 203, if not, go to step 204.

[0054] Specifically, the current scheduling information is the scheduling information being executed; the current scheduling information includes the second serial number of each production object, and the second serial number includes the second identifier and the second number of the production object; the second serial number of each production object is arranged in sequence; for example, if the second identifier of the second serial number is B, the second numbers of the second serial number are 01, 02, 03, 04, 05, 06, 07, 08, 09, and 10 respectively, and the second serial numbers are B01, B02, B03, B04, B05, B06, B07, B08, B09, and B10 respectively.

[0055] Step 203: Delete the remaining tasks of the production object in the current scheduling information.

[0056] Specifically, the second sequence numbers of the remaining production objects are not earlier than the first start sequence numbers; if the first start sequence number input by the user is B06, the first start sequence number B06 exists in the current scheduling information, and the remaining production objects are B06, B07, B08, B09, and B10, delete the tasks of B06, B07, B08, B09, and B10, and arrange the first target scheduling information after the execution end time of B05.

[0057] It should be noted that if the first starting sequence number exists in the current scheduling information, it can indicate that the first demand information is an insertion or cancellation task. In the case of an insertion task, the second demand data needs to be obtained. Not only does it need to delete the remaining tasks of the production object in the current scheduling information, but it also needs to obtain the second target scheduling information based on the second demand data. The next embodiment will discuss this in detail. In the case of a cancellation task, it is sufficient to delete the remaining tasks of the production object in the current scheduling information. It should be noted that when inserting an order, the first object to be produced is different from the model of the production object, and the workstation required by the first object to be produced has the same part as the workstation required by the production object, that is, the corresponding production workstation includes a shared workstation. Only then will there be an insertion order. If the first object to be produced is completely different from the workstation required by the production object, then it can only be a new task. Even if the first starting sequence number input by the user exists in the current scheduling information, only the first target scheduling information independent of the new task can be obtained according to the genetic algorithm, and there is no shared workstation between the new task and the current scheduling information.

[0058] Step 204, retain the current scheduling information.

[0059] Specifically, if the first starting sequence number does not exist in the current scheduling information, it means that the first demand information is a new task, and the current scheduling information is retained. If the workstation required by the first object to be produced is completely different from the workstation required by the production object, then there is no conflict at all between the production process of the first object to be produced and the production process of the production object, and the first target scheduling information can set the start time of producing the first object to be produced according to actual needs, or it can be set to the time entered by the user; if the workstation required by the first object to be produced has the same part as the workstation required by the production object, and includes shared workstations, then the first target scheduling information can set the start time of producing the first object to be produced after the total end time of the current scheduling information, and the genetic algorithm can perform calculations based on the actual occupancy of the workstations.

[0060] Step 205: Obtain first target scheduling information according to the first demand data.

[0061] Specifically, no matter whether the first demand information is a new order, an insertion order, or a cancellation order task, the first target scheduling information needs to be obtained based on the first demand data. It should be noted that, in the case where the first demand information is a cancellation order task, the first production quantity can be set to 0, thereby deleting the remaining production object tasks in the current scheduling information, and not adding production tasks, to achieve the effect of cancellation.

[0062] It can be seen that this embodiment uses the first starting sequence number as the node for inserting or canceling an order; for example, the current scheduling information already has a plan for generating objects B01-B10, of which the last two generating objects do not need to be produced and need to be canceled. The first demand data can be input with the first starting sequence number as B09, the first demand quantity as 0, and the first demand start time can be set to after the end time of production object 08. In this case, the system will delete the original plans for B09 and B10, and the tasks of B09 and B10 will disappear, thereby achieving the effect of canceling the order; or, the first demand data can be input with the first starting sequence number as B08, the first demand quantity as 1, and the first demand start time as after the end time of production object B07. In this case, the system will delete the original plans for B08, B09, and B10, and generate a new plan, that is, to produce a production object B08, thereby making the tasks of B09 and B10 disappear, thereby achieving the effect of canceling the order.

[0063] Specifically, the first demand data of this embodiment also includes the first demand start time; the first production task list also includes the common first estimated start time of the N first objects to be produced.

[0064] like Figure 4 FIG. 2 is a flow chart of sub-steps of step 205. Step 205 is to obtain first target scheduling information according to first demand data, and includes the following sub-steps:

[0065] Step 2051, obtaining N first serial numbers of N first objects to be produced according to the first identifier and the first production quantity N; and obtaining a first estimated start time according to the first required start time.

[0066] Specifically, when the first starting sequence number exists in the current scheduling information, the first starting sequence number includes the second identifier; if the first identifier is the same as the second identifier, the first starting sequence number is used as the starting sequence number, and they are arranged in sequence to obtain N first sequence numbers of N first objects to be produced. For example, the current scheduling information already has a plan to generate objects B01-B10, the first starting sequence number is B10, the first identifier is B, the first production quantity N is 3, and the first identifier B is the same as the second identifier B of the current sorting information. Then, after deleting the original task B10, the first sequence numbers of the three first objects to be produced are obtained by sorting them in sequence according to the sequence number of B10, namely B10, B12, and B13.

[0067] If the first starting sequence number exists in the current scheduling information, if the first identifier is different from the second identifier, then they are arranged in sequence according to the serial number of the production object corresponding to the first identifier. For example, if there is a plan to generate objects B01-B10 in the current scheduling information, that is, the second identifier is B, the first starting sequence number is B10, the first identifier is A, the first production quantity N is 3, and the first identifier A is different from the second identifier B of the current sorting information. Then, after deleting the original task B10, the first serial numbers of the three first objects to be produced are obtained by sorting them in sequence according to the serial number of the existing first identifier A. If the most recent serial number containing the first identifier A is A03, the first serial numbers of the three first objects to be produced are obtained by sorting them in sequence according to the serial number of A03, which are A04, A05, and A06, respectively.

[0068] Specifically, the first estimated start time is obtained by determining whether the first required start time is before the expected completion time. If so, the first estimated start time is set as the expected completion time; if not, the first estimated start time is set as the first required start time; wherein the expected completion time is the end time of a target production object of the current scheduling information, the second serial number of the target production object is adjacent to the first start serial number and is located before the first start serial number, or the expected completion time is the total end time of the current scheduling information.

[0069] Specifically, if the first starting sequence number exists in the current scheduling information, the estimated completion time is the end time of a target production object in the current scheduling information; if the first starting sequence number does not exist in the current scheduling information, the estimated completion time is the total end time of the current scheduling information, that is, the time when all production tasks in the current scheduling information are completed.

[0070] Step 2052: Generate a first production task list according to the N first serial numbers and the first estimated start times of the N first objects to be produced.

[0071] Specifically, the first demand data input by the user in this embodiment is only a fuzzy condition. After obtaining the first demand data, the electronic device needs to convert the first demand data into a specific first production task list. According to the aforementioned first production task list, it includes the first serial number of each first object to be produced, such as A01, A02, and A03, which is a detailed production task instruction; the first production task list in this embodiment may also include the aforementioned first estimated start time. The first production task list is used as the input of the genetic algorithm, and the aforementioned nested relationship, process path diagram, workstation execution capability information, and team information are used as constraints of the genetic algorithm, so that the genetic algorithm calculates the first target scheduling information.

[0072] Specifically, the user inputs demand data, including the starting sequence number, start time, required quantity, and the occupancy status (i.e., the production station, time, etc. of each production task in the current scheduling information) which is pre-stored in the electronic device. Then, the electronic device determines whether the starting sequence number exists in the current scheduling information and whether the demand time is earlier than the occupancy rate (estimated completion time). Then, after determining that a new plan needs to be generated and determining the corresponding start time (i.e., the estimated start time), a corresponding production task list is generated based on the starting sequence number + quantity (required quantity). The production task list also includes the start time (i.e., the estimated start time). The available start time of each mold (station) is calculated based on the production task list to obtain the corresponding target scheduling information.

[0073] In some embodiments, the execution status of the current scheduling information can also be monitored. Specifically, the execution status of the current scheduling information can be automatically monitored or manually monitored by a camera, and when an abnormality occurs in the current scheduling information, the abnormal workstation information and the third production task list of unfinished production objects are obtained, and the current scheduling information is rearranged according to the abnormal workstation information and the third production task list; that is, the abnormal workstation information is deleted from the pre-existing workstation information to update the workstation information constraint. At the same time, since the second serial number exists in the current scheduling information, the second serial number of each unfinished production object can be directly obtained according to the current scheduling information, and a third production task list is formed according to the second serial number, that is, the third production task list includes the second serial number of each unfinished production object. The third production task list can also include a third estimated start time. The third estimated start time can be determined according to the restart time input by the user. The user can set it according to actual needs. It can be executed immediately or after a period of time.

[0074] After obtaining the first demand data input by the user, this embodiment converts the first demand data into a first production task list as the input of the genetic algorithm, so that the genetic algorithm generates the first target scheduling information under multiple pre-set constraints, thereby improving the efficiency of obtaining the first target scheduling information while meeting the user's needs.

[0075] Another embodiment of the present application relates to a scheduling method, and the specific flow chart is as follows Figure 5 As shown, the scheduling method includes the following steps:

[0076] Step 301: Acquire first demand data input by a user and acquire second demand data input by a user.

[0077] Specifically, this embodiment is mainly used in the case of inserting orders. At this time, if the user wants to insert an order, he needs to input two demand data, namely the first demand data and the second demand data; the first starting sequence number of this embodiment is one of the second sequence numbers of the current scheduling information. As mentioned above, the first starting sequence number exists in the previous scheduling information. The first starting sequence number in the first demand data can be used to delete the remaining production object tasks in the current scheduling information. Therefore, by setting the second demand data, the remaining production object tasks that were previously deleted can be continued after the total end time of the first target scheduling information; for this reason, this embodiment sets the first identifier and the second identifier to be different, and sets the third identifier and the second identifier to be the same, thereby achieving the effect of inserting an order through the first demand data and the second demand data.

[0078] Specifically, the second demand data includes at least the second starting sequence number, the third identifier of the second object to be produced, the second production quantity M of the second object to be produced, and the second demand start time; M is a natural number greater than or equal to 0; the second demand start time is later than the first demand start time; the order of the first demand start time and the second demand start time can be used to know which is a specific insertion task and which is a subsequent task.

[0079] Specifically, there may be workstation machine cleaning or rest time, or team rest time between the first target scheduling information and the second target scheduling information. Therefore, when setting the first demand data and the second demand data, the start time of the second demand can be lengthened compared to the start time of the first demand, or a new time interval requirement can be added. When the genetic algorithm is used for scheduling, the corresponding first target scheduling information and second target scheduling information can be produced according to user needs.

[0080] Step 302: Obtain first target scheduling information according to first demand data.

[0081] Step 302 of this embodiment is substantially the same as step 102 of the above embodiment, and will not be described again to avoid repetition.

[0082] Step 303: Acquire second target scheduling information according to the second demand data.

[0083] Specifically, the second target scheduling information represents the production plan for producing M second objects to be produced; the second target scheduling information includes the production information of each small component, medium component, and large component in the M second objects to be produced, including the corresponding workstation information and team information. The workstation information includes the workstation identification, the workstation start working time, and the workstation end working time. The team information includes the team identification, the team start working time, and the team end working time.

[0084] like Figure 6 FIG. 3 is a flow chart of sub-steps of step 303. Step 303 is to obtain second target scheduling information according to second demand data, and includes the following sub-steps:

[0085] Step 3031, obtaining M third serial numbers of M second objects to be produced according to the second starting serial number, the third identifier, and the second production quantity M.

[0086] Specifically, the second starting sequence number is the sequence number starting from the second demand data. After the aforementioned task of deleting the remaining production objects in the current scheduling information is deleted, the second starting sequence number does not exist in the current scheduling information. Therefore, M third sequence numbers of M second objects to be produced can be directly generated according to the second starting sequence number, the third identifier, and the second production quantity M. Each third sequence number includes a third identifier and a third number, and the third sequence numbers of each second object to be produced are arranged in sequence; if the second starting sequence number is B06, the third identifier of the third sequence number is B, which is the same as the second identifier, and the second production quantity M is 5, then the third numbers of the third sequence numbers are 06, 07, 08, 09, and 10, respectively, and the 5 third sequence numbers are B06, B07, B08, B09, and B10, respectively.

[0087] Step 3032: Obtain a second estimated start time according to the total end time of the first target scheduling information.

[0088] Specifically, the total end time of the first target scheduling information is the time when each first to-be-produced task in the first target scheduling information is completely completed, and the second estimated start time is no earlier than the total end time of the first target scheduling information; that is, the second target scheduling information is executed after the first target scheduling information to achieve the effect of inserting an order.

[0089] Step 3033: Generate a second production task list according to the M third serial numbers and the second estimated start times of the M second objects to be produced.

[0090] Specifically, the second production task list includes M third serial numbers of M second objects to be produced and a second estimated start time. The second production task list serves as input to the genetic algorithm, so that the genetic algorithm generates second target scheduling information that meets user needs based on various constraints.

[0091] Step 3034, obtaining the second target scheduling information according to the second production task list.

[0092] This embodiment uses a genetic algorithm to generate the second target scheduling information based on the second production task list. As mentioned above, the electronic equipment has maintained the nested relationship between the total serial number and the sub-serial number, the process path diagram, the work station execution capability information, and the team information in advance. These can be used as constraints of the genetic algorithm. The genetic algorithm can generate the second target scheduling information under these constraints.

[0093] Specifically, the second demand data may also include designated workstation information, i.e., the workstations at which the second object to be produced must be produced. Thus, when the genetic algorithm generates the second target scheduling information, the designated workstation information input by the user is used as a constraint condition to generate the second target scheduling information that meets the user's needs.

[0094] When the user needs to insert an order, this embodiment receives the first demand data and the second demand data input by the user, thereby determining the corresponding order insertion node according to the first demand data (i.e., the order insertion node determined according to the first starting sequence number), and connecting the second target scheduling information (i.e., the tasks of the remaining generation objects in the current scheduling information) to the first target scheduling information according to the second demand data, thereby realizing the function of inserting the order.

[0095] like Figure 7 As shown, it is an overall logical schematic diagram of the scheduling method of this embodiment. The scheduling method of this embodiment includes demand rolling, production scheduling, algorithm strategy, execution feedback, basic data, and visualization.

[0096] Demand rolling includes normal demand (generating new orders), inserting orders, canceling orders, switching (switching workstations or switching tasks), and designated workshops (designated production workstations). In the case of switching, the corresponding scheduling information can be regenerated according to the switching needs.

[0097] Production scheduling refers to the tasks that electronic devices need to handle during the scheduling process, including human-computer interaction (i.e. users input demand data into electronic devices), planning strategies, scheduling parameters, version release, result preservation, task management, work order management, sequence number generation, change rescheduling, constraint management, calculation scheduling, and statistical screening.

[0098] The algorithm strategy is the rules of the genetic algorithm, including the highest utilization of molds (stations), the fastest output (highest efficiency), unavailable extensions, and team flow (referring to the information about which processes can be performed at which stations by the team).

[0099] Execution feedback includes equipment (workstation) status feedback, completion status feedback, process progress feedback, number of people feedback, actual working hours feedback, and abnormal working feedback (including equipment abnormality and process delay); after an equipment abnormality occurs or a process progress delay occurs, the task rescheduling can be triggered. In the event of an equipment abnormality, the abnormal workstation information and the third production task list of unfinished production objects are obtained. The third production task list includes the second serial number of each unfinished production object. The abnormal workstation information is deleted from the pre-existing workstation information to update the workstation information constraint condition, and rescheduling is performed according to the third production task list; in the event of a process progress delay, the third production task list of unfinished production objects is obtained in the current scheduling information, the constraint condition remains unchanged, and rescheduling is performed according to the third production task list.

[0100] Basic data includes BOM information, equipment (workstation execution capability), constraints (other constraints include nested relationships of serial numbers), process routes (process path diagrams), and work teams (work team execution capabilities and workable hours of the work team).

[0101] Visualization includes order Gantt chart (i.e. Gantt chart of the first scheduling information and the second scheduling information), resource Gantt chart (i.e. Gantt chart of workstation and team resources), process Gantt chart (i.e. the execution order of each process of each component and the required number of people), specific production scheduling data (i.e. the specific production plan of each component of each production task to be produced), and KPI report.

[0102] like Figure 8 FIG. 1 is a logic diagram of the execution process of the scheduling method of this embodiment. The scheduling method of this embodiment includes the following steps:

[0103] S1, set the start sequence number, start time, and required quantity (multiple items are allowed); determine whether there is an existing sequence number. If so, clear the original sequence number. Then, based on historical data (i.e., current scheduling information), determine whether the time is earlier than the occupied model (i.e., whether the required time is earlier than the expected completion time). If so, generate a new plan to replace the original plan, and the new plan will be executed immediately. If not, generate a new plan and execute it after the original plan.

[0104] That is, in step S1, the demand data input by the user (including at least the start sequence number, the production quantity, and the demand start time) is obtained, and a corresponding production task list is generated according to the demand data.

[0105] S2 handles production requirements, basic data maintenance, and constraint initialization.

[0106] In step S2, a production task list is obtained, and basic data and various constraints, including processes, workstations, rest days, maintenance time, etc., that need to be maintained in advance.

[0107] S3, data initialization, initial plan, whether to save.

[0108] In step S3, the genetic algorithm triggers data initialization calculation based on the production task list, combined with pre-maintained basic data and various constraints, including processes, workstations, rest days, maintenance time, etc., to obtain the initial plan, i.e., the target scheduling information, after which you can choose whether to save the initial plan.

[0109] S4, Results presentation and editing.

[0110] The target scheduling information will be displayed in the form of a Gantt chart, and the Gantt chart can be edited according to actual production.

[0111] S5, output process-level task arrangement and plan implementation.

[0112] That is, the production arrangement corresponding to each component is determined according to the target scheduling information, and the production arrangement of each component is issued to the corresponding team, so that the team can produce each component according to the specific arrangement and produce the objects to be produced layer by layer.

[0113] S7, equipment inspection data and work report.

[0114] That is, by setting up sensors or cameras to use target detection technology to transmit the actual production progress, equipment, personnel usage, etc. in real time, it is possible to determine whether the equipment has failed or whether the process has been delayed.

[0115] S8, rearranged.

[0116] That is, whether to trigger the rescheduling of step S8 is determined according to the production progress of the process and the equipment conditions, and then return to step S4 to display and edit the results.

[0117] This embodiment can handle the collaborative scheduling of assembly and components, and achieves complete set scheduling, that is, an association is established between the work orders of finished products and small components; and this embodiment can quickly respond to changes in orders, such as order changes, emergency orders, equipment abnormalities, etc., and the development cost of the system is lower than other existing systems; at the same time, in the case of multiple processes intertwined with each other in related technologies, manual insertion of orders will cause a large number of conflicts, so this embodiment has maintained a variety of constraints in advance, and can quickly adjust subsequent plans to cope with the impact of new products on subsequent plans; this embodiment can also be rescheduled through genetic algorithms when the situation on site is very different from the plan and the production plan needs to be modified, so as to minimize the impact on subsequent plans. The genetic algorithm of this embodiment can also move part of the tasks on the failed equipment to other similar equipment in the event of equipment failure to ensure the shortest output.

[0118] An embodiment of the present application relates to an electronic device, such as Fig. 9 As shown, it includes: at least one processor 401; and a memory 402 that is communicatively connected to the at least one processor 401; wherein the memory stores instructions that can be executed by the at least one processor 401, and the instructions are executed by the at least one processor 401 so that the at least one processor 401 can execute the above-mentioned scheduling method.

[0119] The memory 402 and the processor 401 are connected in a bus manner, and the bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors 401 and the memory 402 together. The bus can also connect various other circuits such as peripheral devices, 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 between the bus and the transceiver. The transceiver can be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. The data processed by the processor 401 is transmitted on a wireless medium via an antenna, and further, the antenna also receives data and transmits the data to the processor 401.

[0120] The processor 401 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management and other control functions. The memory 402 can be used to store data used by the processor when performing operations.

[0121] An embodiment of the present application relates to a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the above method embodiment is implemented.

[0122] An embodiment of the present application relates to a computer program product, including a computer program, and when the computer program is executed by a processor, the above-mentioned process scheduling method is implemented.

[0123] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of each embodiment method of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0124] Those skilled in the art will appreciate that the above embodiments are specific embodiments for implementing the present application, and in actual applications, various changes may be made thereto in form and detail without departing from the spirit and scope of the present application.

Claims

1. A scheduling method, characterized in that: include: Acquire the first requirement data input by the user; The first demand data at least includes a first starting sequence number, a first identifier of the first object to be produced, and a first production quantity N of the first object to be produced, where N is a natural number greater than or equal to 0; Acquire the first target scheduling information according to the first demand data; The first target scheduling information represents a production plan for producing N of the first objects to be produced.

2. The scheduling method according to claim 1, characterized in that: The acquiring the first target scheduling information according to the first demand data includes: Converting the first demand data into a first production task list; the first production task list indicates a first serial number of each of the N first objects to be produced, each of the first serial numbers including the first identifier and the first number; The first target scheduling information is obtained according to the first production task list.

3. The scheduling method according to claim 2, characterized in that: Before converting the first demand data into a first production task list, the method further includes: Determine whether the first starting sequence number exists in the current scheduling information; the current scheduling information is the scheduling information being executed; the current scheduling information includes the second sequence number of each production object, the second sequence number includes the second identification and the second number of the production object; the second sequence number of each production object is arranged in sequence; If so, deleting the remaining tasks of the production object in the current scheduling information, wherein the second sequence number of the remaining production object is not earlier than the first start sequence number; If not present, the current schedule information is retained.

4. The scheduling method according to claim 3, characterized in that: The first demand data also includes a first demand start time; the first production task list also includes a first estimated start time common to N first objects to be produced; The converting the first demand data into a first production task list comprises: According to the first identifier and the first production quantity N, N first serial numbers of N first objects to be produced are obtained; and, according to the first demand start time, the first estimated start time is obtained; the first estimated start time is obtained in the following manner: whether the first demand start time is before the estimated completion time, if so, the first estimated start time is set as the estimated completion time; if not, the first estimated start time is set as the first demand start time; wherein the estimated completion time is the end time of a target production object of the current scheduling information, the second serial number of the target production object is adjacent to the first start serial number and is located before the first start serial number, or the estimated completion time is the total end time of the current scheduling information; The first production task list is generated according to the N first serial numbers of the N first objects to be produced and the first estimated start time.

5. The scheduling method according to claim 3, characterized in that: The first identifier is different from the second identifier; the first starting sequence number is one of the second sequence numbers of the current scheduling information; The method further comprises: Acquire the second demand data input by the user; the second demand data at least includes a second starting sequence number, a third identifier of the second object to be produced, a second production quantity M of the second object to be produced, and a second demand start time; M is a natural number greater than or equal to 0; the second demand start time is later than the first demand start time; the third identifier is the same as the second identifier; The second target scheduling information is obtained according to the second demand data; the second target scheduling information represents a production plan for producing M of the second objects to be produced.

6. The scheduling method according to claim 5, characterized in that: The acquiring the second target scheduling information according to the second demand data includes: Obtain M third serial numbers of M second objects to be produced according to the second starting serial number, the third identifier, and the second production quantity M; each third serial number includes the third identifier and the third serial number; the third serial numbers of each second object to be produced are arranged in sequence; Acquire the second estimated start time according to the total end time of the first target scheduling information; the second estimated start time is not earlier than the total end time of the first target scheduling information; Generate the second production task list according to the M third serial numbers of the M second objects to be produced and the second estimated start time; The second target scheduling information is obtained according to the second production task list.

7. The scheduling method according to claim 3, characterized in that: The method further comprises: Monitoring the execution of the current scheduling information; In the case that the current scheduling information is abnormal, obtaining abnormal workstation information and a third production task list of the unfinished production objects; the third production task list includes the second serial number of each unfinished production object; The current scheduling information is rearranged according to the abnormal workstation information and the third production task list.

8. An electronic device, characterized in that: include: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the scheduling method according to any one of claims 1 to 7.

9. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the scheduling method according to any one of claims 1 to 7 is implemented.

10. A computer program product, characterized in that The invention comprises a computer program, which implements the scheduling method according to any one of claims 1 to 7 when being executed by a processor.

Images