Production scheduling scheme determination method and device, electronic equipment and storage medium
By acquiring production process and time information from the work center, determining constraints, and optimizing the production scheduling scheme, the problem of overlapping production processes and unavailable time periods was solved, achieving efficient production scheduling.
Patent Information
- Application Number
- CN202510910496.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-07-02
- Publication Date
- 2025-11-25
AI Technical Summary
In production scheduling in manufacturing workshops, the time of production processes often overlaps and conflicts with unavailable time periods, resulting in low scheduling efficiency.
By acquiring production process information and available/unavailable time information for each work center, constraints are determined, and a preset objective function is used to optimize the production scheduling scheme to avoid overlap between production processes and unavailable time periods.
This effectively avoids overlaps and conflicts between production processes and unavailable time periods, improving the efficiency and reliability of production scheduling.
Smart Images
Figure CN121010113A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of production management technology, and in particular to a method, apparatus, electronic device, and storage medium for determining a production scheduling scheme. Background Technology
[0002] In modern manufacturing workshops, the production of industrial products often requires multiple production processes. A production process is the basic unit of the production process, referring to the production activity in which one (or a group of) workers continuously process the same object of labor at the same work center.
[0003] Production scheduling in a manufacturing workshop refers to the arrangement of the start and end times of multiple production processes. However, due to reasons such as the need for maintenance of each work center or the need for rest for the staff at that work center, each work center usually has periods when it is not in operation (i.e., unavailable time periods). When using the current directed acyclic graph method to schedule production processes, there are frequent cases where the production process time overlaps and conflicts with the unavailable time periods.
[0004] Therefore, how to avoid the overlap and conflict between production process time and unavailable time periods during production scheduling has become a pressing technical problem that needs to be solved. Summary of the Invention
[0005] This application provides a method, apparatus, electronic device, and storage medium for determining a production scheduling scheme, which can avoid the overlap and conflict between the time of production processes and unavailable time periods during the production scheduling process.
[0006] In a first aspect, embodiments of this application provide a method for determining a production scheduling scheme, comprising: acquiring production process information of each work center, and available time information or unavailable time information of each work center; the number of work centers is at least one; determining constraints based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available time information or unavailable time information of each work center; determining a production scheduling scheme based on the constraints and a preset objective function; wherein the production scheduling scheme includes the values of the start time variable and the end time variable of each production process.
[0007] Secondly, embodiments of this application provide a production scheduling scheme determination device, comprising:
[0008] The acquisition module is used to acquire production process information of each work center, as well as available time information or unavailable time information of each work center; the number of work centers is at least one.
[0009] The first determining module is used to determine the constraints based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available time information or unavailable time information of each work center.
[0010] The second determining module is used to determine a production scheduling scheme based on the constraints and a preset objective function; wherein the production scheduling scheme includes the values of the start time variable and the end time variable of each production process.
[0011] Thirdly, embodiments of this application provide an electronic device, including: a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the electronic device implements the method described in the first aspect or various possible implementations of the first aspect.
[0012] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer instructions, which, when executed by a processor, are used to implement the method described in the first aspect or various possible implementations of the first aspect.
[0013] Fifthly, embodiments of this application provide a computer program product comprising a computing program, wherein when the computer program is executed by a processor, it implements the method described in the first aspect or various possible implementations of the first aspect.
[0014] This application provides a method, apparatus, electronic device, and storage medium for determining a production scheduling scheme. It can determine constraints based on production process information of each work center, start time variables of each production process, end time variables of each production process, and available or unavailable time information of each work center. Then, based on the constraints and a preset objective function, a production scheduling scheme is determined. Because this application considers the available or unavailable time information of each work center, it can avoid overlaps and conflicts between production process times and unavailable time periods during the production scheduling process. Attached Figure Description
[0015] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0016] Figure 1A flowchart illustrating a method for determining a production scheduling scheme provided in an embodiment of this application;
[0017] Figure 2 This is a schematic diagram of the available and unavailable time periods in an embodiment of this application.
[0018] Figure 3 This is a schematic diagram of a production scheduling scheme in an embodiment of this application;
[0019] Figure 4 This is another schematic diagram of the production scheduling scheme in the embodiments of this application;
[0020] Figure 5 A schematic diagram of a production scheduling scheme determination device provided for an embodiment of this application;
[0021] Figure 6 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0022] In this article, the term "and / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. The symbol " / " in this article indicates that the related objects are in an "or" relationship; for example, A / B means A or B.
[0023] The terms "first" and "second," etc., used in the specification and claims herein are used to distinguish different objects, not to describe a specific order of objects. For example, "first response message" and "second response message," etc., are used to distinguish different response messages, not to describe a specific order of response messages.
[0024] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of the terms "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.
[0025] In the description of the embodiments of this application, unless otherwise stated, "multiple" means two or more, for example, multiple processors means two or more processors, multiple elements means two or more elements, etc.
[0026] In related technologies, manufacturing an industrial product often involves multiple production processes. In some cases, these processes must be executed in a strict chronological order. For example, manufacturing a plastic toy requires three work centers: an injection molding machine, a painting robot, and an assembly robot. These three work centers are used to perform the injection molding, painting, and assembly processes, respectively. Specifically, the injection molding machine shapes the toy's outer shell, the painting robot applies surface coating to the shell, and the assembly robot assembles the toy. These three processes must be executed in a strict chronological order. Specifically, the painting process must be completed before the injection molding process, and the assembly process must be completed before the painting process.
[0027] In another example, the drinking bottle consists of two parts: the bottle body and the cap. Production process 1 includes manufacturing the bottle body, production process 2 includes manufacturing the cap, and production process 3 includes assembling the bottle body and the cap. Production processes 1 and 2 can be performed independently, but production process 3 can only be performed after production processes 1 and 2 are completed.
[0028] In other cases, the various production processes do not need to be executed in a strict chronological order. For example, a spinning top toy consists of two parts: the top body and the whip. Production process 1 includes manufacturing the top body, and production process 2 includes manufacturing the whip. Production processes 1 and 2 can be executed independently.
[0029] Each work center typically has periods when it cannot work (i.e., unavailable time periods). When using the current directed acyclic graph method for production scheduling, there are often situations where the production process time overlaps and conflicts with the unavailable time periods.
[0030] In view of this, embodiments of this application provide a method, apparatus, electronic device, and storage medium for determining a production scheduling scheme, which can avoid the situation where the time of production processes overlaps with unavailable time periods during the production scheduling process.
[0031] Figure 1 This is a flowchart illustrating a production scheduling method provided in an embodiment of this application. The executing entity in this embodiment is an electronic device, which can be a server, desktop computer, laptop, mobile phone, etc., and this embodiment does not impose any limitations on this. Figure 1 As shown in the embodiments of this application, the method for determining a production scheduling scheme may include the following steps:
[0032] S11, Obtain production process information for each work center, as well as available or unavailable time information for each work center.
[0033] In this step, the user can input production process information for each work center, as well as available or unavailable time information for each work center, through the information input device of the electronic device (such as a mouse and keyboard). After the user inputs the aforementioned information, the electronic device can obtain this information.
[0034] Specifically, the production process information for each work center can include the correspondence between each work center and each production process. For example, in this embodiment of the application, there can be three work centers: work center A, work center B, and work center C. These three work centers are used to execute production process 1, production process 2, and production process 3, respectively.
[0035] The available time information for each work center can be the start and end times of each available time period for that work center. For example, if work center A works for 5 hours, it needs to spend 1 hour on maintenance. For ease of explanation, this application embodiment uses a production scheduling scheme for one day as an example. It can be understood that when it is necessary to determine a production scheduling scheme for a longer period of time, the implementation principle is the same.
[0036] like Figure 2 As shown, the available time slots for work center A consist of four segments: minute 0 to minute 300 (between a and b), minute 360 to minute 660 (between c and d), minute 720 to minute 1020 (between ef and ef), and minute 1080 to minute 1380 (between gh and gh). The available time slots for other work centers may be the same as or different from those for work center A; detailed examples are not provided here.
[0037] In another implementation, the user can input the unavailability time information for each work center via the electronic device's information input device. The unavailability time information for each work center can be the start and end times of each unavailability period for that work center. Since available and unavailable periods alternate, the electronic device can calculate the available time information for each work center based on this unavailability time information. For example, ... Figure 2 As shown, the unavailable time periods of work center A include four segments: minutes 300 to 360 (between b and c), minutes 660 to 720 (between de and e), minutes 1020 to 1080 (between f and g), and minutes 1380 to 1440 (between hi). Electronic devices can use the start and end times of these unavailable time periods to calculate the start and end times of each available time period of work center A. The calculation results are the same as the start and end times of the available time periods listed above.
[0038] In another implementation, the electronic device can communicate with each work center, for example, via a communication cable or wireless network. Users can input relevant production process information, as well as available or unavailable time information, at each work center. Then, each work center can send this information to the electronic device.
[0039] S12, determine the constraints based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available or unavailable time information of each work center.
[0040] In this step, the electronic device can use the production process information of each work center and the Start time variable of each production process. i The End time variable for each production process i Based on the available or unavailable time information for each work center, the constraints are determined. i Let i be the variable representing the start time of the i-th production process. The value of i depends on the production process number. Continuing with the previous example, if the production processes include production process 1, production process 2, and production process 3, the value of i can be 1, 2, or 3.
[0041] For production process 1, we use the start time variable Start1 and the end time variable End1. By determining the values of Start1 and End1, we can determine the start and end times of process 1. Similarly, by determining the values of Start2 and End2, we can determine the start and end times of process 2. And by determining the values of Start3 and End3, we can determine the start and end times of process 3.
[0042] In one implementation, the constraints may include: Here, M represents the maximum value. Specifically, users can set the value of M according to their actual needs. For example, when scheduling production for a day's work tasks, if the time unit is minutes, since a day includes 1440 minutes, the value of M can be set to a value greater than 1440, such as 1500. When scheduling production for two days' work tasks, if the time unit is minutes, the value of M can be set to a value greater than 2880, such as 2900. Furthermore, the meaning of the maximum value M can be found in the relevant definitions in mixed-integer programming models.
[0043] Because of I numLet j ∈ 0, 1, 2, ..., I be the total number of available time slots in the work center where the i-th production process is located. num -1}, therefore, the available time periods on the work center where the i-th production process is located are the 0th available time period, the 1st available time period, and so on until the I-th available time period. num -1 available time slot. The number of available time slots and the start and end times of each available time slot are set separately for each work center based on actual conditions. Therefore, the number of available time slots can be the same or different for different work centers. The start and end times of each available time slot can also be the same or different for different work centers.
[0044] L ij R represents the start time of the j-th available time period on the work center where the i-th production process is located. ij Let $\mathbf{i}$ represent the end time of the $j$-th available time period on the work center where the $i$-th production process is located. Therefore, the above constraints can ensure that the value of the start time variable of the $i$-th production process (i.e., each production process) is within the available time period, and not within the unavailable time period.
[0045] Similarly, constraints may also include: Therefore, it can be guaranteed that the value of the end time variable of the i-th production process (i.e., each production process) is within the available time period, and not within the unavailable time period.
[0046] Furthermore, embodiments of this application may introduce a first auxiliary variable. and the second auxiliary variable This is to facilitate a better description of the constraints.
[0047] When the value of the variable representing the start time of the i-th production process falls within the j-th available time period, the first auxiliary variable... The value of is 1; when the value of the variable at the start time of the i-th production process is not located in the j-th available time period, the first auxiliary variable... The value of is 0. Meanwhile, the constraints include the following mutually exclusive constraints: This ensures that the value of the start time variable of the i-th production process (i.e., each production process) is only within one available time period, and cannot be within multiple available time periods at the same time.
[0048] Similarly, when the value of the variable representing the end time of the i-th production process falls within the j-th available time period, the second auxiliary variable... The value of is 1; when the value of the variable at the end time of the i-th production process is not located in the j-th available time period, the second auxiliary variable... The value of is 0; in addition, the constraints also include the following mutually exclusive constraints: This ensures that the value of the end time variable of the i-th production process is within one and only one available time period, and cannot be within multiple available time periods simultaneously.
[0049] The aforementioned constraints may also include In this constraint, the variable Start at the start time... i The value of the variable End and the end time i The relationships between the values are constrained.
[0050] Specifically, T i This represents the time taken for the i-th production step. The time taken for different production steps is usually different; that is, the values of T1, T2, and T3 are usually different. j This is used to represent the cumulative value of unavailable time before the j-th available time period in the work center where the i-th production process is located. Therefore... The cumulative value of unavailable time before the value of the variable representing the end time of the i-th production process. This represents the cumulative unusable time before the variable reaches its value at the start time of the i-th production process. The difference between the two represents the cumulative unusable time between the variable's value at the start time and its value at the end time of the i-th production process.
[0051] Continuing with the previous example, let's take production process 1 as an example. For work center A, there are four available time periods: available time period 0, available time period 1, available time period 2, and available time period 3. The cumulative unavailable time before available time period 0 (IDLE0) is 0; the cumulative unavailable time before available time period 1 (IDLE1) is 60 minutes; the cumulative unavailable time before available time period 2 (IDLE2) is 60 minutes + 60 minutes = 120 minutes; and the cumulative unavailable time before available time period 3 (IDLE3) is 60 minutes + 60 minutes + 60 minutes = 180 minutes.
[0052] If the start time variable and the end time variable of production process 1 are both within the same available time period, then according to the above constraints, the cumulative unavailable time between them is 0. If the start time variable of production process 1 is within the first available time period and the end time variable is within the third available time period, then according to the above constraints, the cumulative unavailable time between them is 180 minutes - 60 minutes = 120 minutes.
[0053] By employing the above constraints, which consider not only the value of the variable at the start of the production process and its duration, but also the duration of unavailable time between the start and end times of the production process, this constraint accurately defines the relationship between the values of the variable at the start and end of the production process when unavailable periods exist. In other words, given an unavailable time period, this constraint allows for the accurate derivation of the value of the variable at the end of the production process from its start value.
[0054] Furthermore, when there is a strict time sequence between different production processes, the embodiments of this application also include corresponding constraints. For example, if the nth production process can only be executed after the mth production process is completed, the aforementioned constraints may also include: Start n ≥End m This constraint ensures that the value of the start time variable of the nth production process is greater than or equal to the value of the start time variable of the mth production process, thus guaranteeing that the start time of the nth production process is arranged after the end time of the mth production process during production scheduling.
[0055] Similarly, if the k-th production step can only be executed after the m-th and k-th production steps are completed, the aforementioned constraint can be expressed as: Start n ≥End k Start n ≥End m These two constraints ensure that the value of the start time variable for the nth production step is greater than or equal to the value of the start time variable for the mth production step, and also greater than or equal to the value of the start time variable for the kth production step. Therefore, it can be guaranteed that during production scheduling, the start time of the nth production step will be arranged after the end time of both the mth and kth production steps.
[0056] For example, continuing with the previous example, if the third production step can only be performed after the first and second production steps are completed, the constraints could include Start3≥End1 and Start3≥End2.
[0057] It should be noted that the above description is for illustrative purposes only. When the nth production process must be scheduled to be executed only after three or more production processes have been completed, the expression of the constraints is similar and will not be detailed here.
[0058] In the following steps, the main task is to determine the values (i.e., the optimal solution) of the start and end time variables for each production process using the aforementioned constraints. To this end, embodiments of this application can employ an objective function, combined with the aforementioned constraints, to achieve the above objective. Therefore, as... Figure 1 As shown, after step S12, the embodiments of this application may further include the following steps:
[0059] S13. Determine the production scheduling scheme based on the constraints and the preset objective function; wherein the production scheduling scheme includes the values of the start time variable and the end time variable for each production process.
[0060] In this step, the core of determining the optimal solutions for the variables at the start and end times is achieved through the interaction between a pre-defined objective function (the value of which needs to be maximized or minimized) and constraints (equalities or inequalities that restrict the values of the variables). The optimal solution is the one among all feasible solutions that satisfy the constraints, which maximizes or minimizes the objective function value.
[0061] Therefore, by determining the values of the start and end time variables (i.e., the optimal solution) of each production process based on the preset objective function and constraints, the production scheduling scheme can be determined. Since the available or unavailable time information of each work center is considered in this embodiment, overlapping conflicts between production process times and unavailable time periods can be avoided during the production scheduling process.
[0062] The production scheduling scheme in this application embodiment can be a Gantt chart or other forms, and this application embodiment does not limit it.
[0063] In one implementation, the constraints in this application embodiment may be a third auxiliary variable Makespan, and the aforementioned constraints also include Makespan ≥ End. iContinuing with the previous example, the value of i can be 1, 2, or 3. This constraint indicates that the value of Makespan is greater than or equal to the maximum value among the three variables End1, End2, and End3. This maximum value is the end time of all production processes. The preset objective function can be to minimize the value of Makespan. Based on the above constraints and the preset objective function, the values of the six variables Start1, Start2, Start3, End1, End2, and End3 can be determined. The values of the aforementioned six variables obtained in this way can ensure that the aforementioned three production processes are completed in the shortest possible time. The maximum value among the three end time variables End1, End2, and End3 is the time when the three production processes are completed. The above is only an illustrative example. When the number of production processes is other values, the implementation principle is the same and will not be detailed here.
[0064] Specifically, due to Z + Given a set of multiple time-point values with a finite number of constraints, and in conjunction with the objective function, an exhaustive method can be used to calculate the objective function for the start and end time-point variables under various possible values. When the objective function reaches its minimum value, the values of the start and end time-point variables for each production process represent the optimal solution to the problem.
[0065] It should be noted that, in addition to the exhaustive method, other methods can also be used in the embodiments of this application to obtain the optimal solutions for the start time variables and the end time variables of each production process.
[0066] More specifically, Z + The numerical parts of multiple time-time values can be non-negative integers, for example, Z. + The multiple time values can be minute 0, minute 1, minute 2, minute 3, up to minute 1440. In this way, the numerical values of the start and end time variables for each production process are also non-negative integers.
[0067] To more clearly illustrate the basic principles of the embodiments of this application, two specific application scenarios are used as examples below.
[0068] Continuing with the previous example, work center A executes production process 1, work center B executes production process 2, and work center C executes production process 3. Production process 1 lasts for 3.3 hours, production process 2 lasts for 7 hours, and production process 3 lasts for 8.2 hours. Work center A has four available time slots: minute 0 to minute 300, minute 360 to minute 660, minute 720 to minute 1020, and minute 1080 to minute 1380. For simplicity, the available time slot information for work centers B and C is the same as that for work center A.
[0069] In the first application scenario, there is no strict temporal order when executing production processes 1, 2, and 3. Therefore, in the constraints, the value of the end time variable for any production process is not constrained by the values of the start time variables for other production processes. For example... Figure 3 As shown, using the aforementioned constraints and preset objective function, it can be determined that the start time variable of production process 1 is located at minute 0, and the end time variable is located at minute 198. The time period occupied by production process 1 is... Figure 3 The part between 'ak' in the equation. The start time variable for production process 2 is at minute 0, and the end time variable is at minute 480. The time period occupied by production process 2 is... Figure 3 The part between 'al' in the text. The start time variable for production process 3 is at minute 0, and the end time variable is at minute 552. The time period occupied by production process 3 is... Figure 3 The part between aj in the code. Therefore, the earliest time to complete the aforementioned three production processes is the 552nd minute.
[0070] It should be noted that, in this application scenario, the values of the start and end time variables for production process 3 are unique. However, the values of the start and end time variables for production process 1 are not unique; they only need to ensure that the value of the end time variable does not exceed the value of the end time variable for production process 3. Similarly, the values of the start and end time variables for production process 2 are also not unique; they only need to ensure that the value of the end time variable does not exceed the value of the end time variable for production process 3.
[0071] In the second application scenario, there is a strict time sequence when executing production process 1, production process 2 and production process 3. Production process 3 can only be executed after production process 1 and production process 2 are completed. Therefore, the constraints Start3≥End1 and Start3≥End2 must be satisfied.
[0072] like Figure 4 As shown, using the aforementioned constraints and preset objective function, it can be determined that the start time variable of production process 1 is located at minute 0, and the end time variable is located at minute 198. The time period occupied by production process 1 is... Figure 4 The part between 'ak' in the equation. The start time variable for production process 2 is at minute 0, and the end time variable is at minute 480. The time period occupied by production process 2 is... Figure 4 The part between 'al' in the text. The start time variable for production process 3 is at minute 480, and the end time variable is at minute 1032. The time period occupied by production process 3 is... Figure 4 The portion between 1 and 1m. Therefore, the earliest time to complete the aforementioned three production processes is the 1032nd minute.
[0073] It should be noted that, in this application scenario, the values of the start and end time variables for production process 3 are unique. The values of the start and end time variables for production process 2 are also unique. However, the values of the start and end time variables for production process 1 are not unique; they only need to ensure that the value of the end time variable does not exceed the value of the end time variable for production process 2.
[0074] like Figure 5 As shown in the embodiment of this application, a production scheduling scheme determination device 5 is also provided. The device may include: an acquisition module 51, used to acquire production process information of each work center, and available time information or unavailable time information of each work center; the number of work centers is at least one; a first determination module 52, used to determine constraints based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available time information or unavailable time information of each work center; and a second determination module 53, used to determine a production scheduling scheme based on the constraints and a preset objective function; wherein the production scheduling scheme includes the values of the start time variable and the end time variable of each production process.
[0075] This application provides a production scheduling scheme determination device. It can determine constraints based on production process information of each work center, start time variables of each production process, end time variables of each production process, and available or unavailable time information of each work center. Then, based on the constraints and a preset objective function, it determines a production scheduling scheme. Because this application considers the available or unavailable time information of each work center, it can avoid overlap and conflict between production process times and unavailable time periods during the production scheduling process.
[0076] Optionally, in some embodiments of this application, the production process information of each work center includes the correspondence between each work center and each production process; the available time information includes the start and end times of each available time period, or the unavailable time information includes the start and end times of each unavailable time period.
[0077] Optionally, in some embodiments of this application, the constraint condition adopts a first auxiliary variable. and the second auxiliary variable
[0078] The constraints include:
[0079] When the value of the variable representing the start time of the i-th production process falls within the j-th available time period, the first auxiliary variable... The value of is 1; when the value of the variable at the start time of the i-th production process is not located in the j-th available time period, the first auxiliary variable... The value of is 0;
[0080] When the value of the variable representing the end time of the i-th production process falls within the j-th available time period, the second auxiliary variable... The value of is 1; when the value of the variable at the end time of the i-th production process is not located in the j-th available time period, the second auxiliary variable... The value of is 0;
[0081] Start i ∈Z + Start i ≥0;
[0082] End i ∈Z + End i ≥0;
[0083]
[0084]
[0085] j∈{0,1,2,…,1} num -1};
[0086] Among them, Z + A set of multiple time values; Start i Let End be the start time variable for the i-th production process. i Let I be the variable representing the end time of the i-th production process; num L represents the total number of available time slots on the work center where the i-th production process is located. ijR represents the start time of the j-th available time period on the work center where the i-th production process is located. ij T represents the end time of the j-th available time period on the work center where the i-th production process is located, where M is the maximum value; i Used to represent the time taken for the i-th production process; IDLE j This represents the cumulative value of unavailable time before the j-th available time period in the work center where the i-th production process is located.
[0087] Optionally, in some embodiments of this application, the constraint condition also employs a third auxiliary variable, Makespan;
[0088] The constraints also include:
[0089] Makespan≥End i ;
[0090] The preset objective function is to minimize the value of the third auxiliary variable Makespan.
[0091] Optionally, in some embodiments of this application, where the nth production step can only be executed after the mth production step is completed, the constraint further includes:
[0092] Start n ≥End m .
[0093] Optionally, in some embodiments of this application, where the nth production step can only be executed after the kth production step is completed, the constraint further includes:
[0094] Start n ≥End k .
[0095] Optionally, in some embodiments of this application, Z + The numerical parts of multiple time values are non-negative integers.
[0096] The production scheduling scheme determination device provided in this application embodiment can perform the actions performed by the electronic device in the above embodiment. Its implementation principle and technical effect are similar, and will not be described again here.
[0097] like Figure 6 As shown in the embodiments of this application, an electronic device is also provided. The electronic device includes a memory and a processor. The memory is used to store a computer program. When the computer program is executed by the processor, the production scheduling scheme determination method described above can be implemented. For details, please refer to the description of the foregoing embodiments.
[0098] Specifically, at the hardware level, the electronic device may include a processor, an internal bus, and memory. The memory may include main memory and non-volatile memory. The processor reads the corresponding computer program from the non-volatile memory into main memory and then executes it. Those skilled in the art will understand that... Figure 6 The structure shown is for illustrative purposes only and does not limit the structure of the electronic device described above. For example, the electronic device may also include components that are larger than... Figure 6 The components shown may include more or fewer components, such as other processing hardware like a GPU (Graphics Processing Unit) or external communication ports. Of course, this application does not exclude other implementation methods besides software implementations, such as logic devices or a combination of hardware and software.
[0099] In this embodiment, the processor may include a central processing unit (CPU) or a graphics processing unit (GPU), and may also include other microcontrollers, logic gates, integrated circuits, or appropriate combinations thereof with logic processing capabilities. The memory described in this embodiment can be a storage device for storing information. In digital systems, a device capable of storing binary data can be a memory; in integrated circuits, a circuit without physical form but with storage function can also be a memory, such as RAM or FIFO; in a system, a storage device with physical form can also be called a memory. In implementation, this memory can also be implemented using a cloud storage method; the specific implementation method is not limited in this specification.
[0100] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, can implement the production scheduling scheme determination method described above.
[0101] This application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the production scheduling scheme determination method described above.
[0102] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.
[0103] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.
Claims
1. A method for determining a production scheduling scheme, characterized in that, include: Obtain production process information for each work center, as well as available or unavailable time information for each work center; the number of work centers is at least one. Based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available or unavailable time information of each work center, the constraints are determined. Based on the constraints and the preset objective function, a production scheduling scheme is determined; wherein, the production scheduling scheme includes the values of the start time variable and the end time variable for each production process.
2. The method according to claim 1, characterized in that, The production process information of each work center includes the correspondence between each work center and each production process; The available time information includes the start and end times of each available time period, or the unavailable time information includes the start and end times of each unavailable time period.
3. The method according to claim 2, characterized in that, The constraint condition adopts a first auxiliary variable. and the second auxiliary variable The constraints include: When the value of the variable representing the start time of the i-th production process falls within the j-th available time period, the first auxiliary variable... The value of is 1; when the value of the variable at the start time of the i-th production process is not located in the j-th available time period, the first auxiliary variable... The value of is 0; When the value of the variable representing the end time of the i-th production process falls within the j-th available time period, the second auxiliary variable... The value of is 1; when the value of the variable at the end time of the i-th production process is not located in the j-th available time period, the second auxiliary variable... The value of is 0; Start i ∈Z + ,Start i ≥0; End i ∈Z + ,End i ≥0; j∈{0,1,2,…,I num -1}; Among them, Z + A set of multiple time values; Start i Let End be the start time variable for the i-th production process. i Let I be the variable representing the end time of the i-th production process; num L represents the total number of available time slots on the work center where the i-th production process is located. ij R represents the start time of the j-th available time period on the work center where the i-th production process is located. ij T represents the end time of the j-th available time period on the work center where the i-th production process is located, where M is the maximum value; i Used to represent the time taken for the i-th production process; IDLE j This represents the cumulative value of unavailable time before the j-th available time period in the work center where the i-th production process is located.
4. The method according to claim 3, characterized in that, The constraints also employ a third auxiliary variable, Makespan. The constraints also include: Makespan≥End i ; The preset objective function is to minimize the value of the third auxiliary variable Makespan.
5. The method according to claim 3 or 4, characterized in that, The constraint condition further includes the following: If the nth production step can only be executed after the mth production step is completed: Start n ≥End m 。 6. The method according to claim 5, characterized in that, The constraint that the nth production step can only be executed after the kth production step is completed also includes: Start n ≥End k 。 7. The method according to claim 3, characterized in that, Z + The numerical parts of multiple time values are non-negative integers.
8. A production scheduling scheme determination device, characterized in that, include: The acquisition module is used to acquire production process information of each work center, as well as available time information or unavailable time information of each work center; the number of work centers is at least one. The first determining module is used to determine the constraints based on the production process information of each work center, the start time variable of each production process, the end time variable of each production process, and the available time information or unavailable time information of each work center. The second determining module is used to determine a production scheduling scheme based on the constraints and a preset objective function; wherein the production scheduling scheme includes the values of the start time variable and the end time variable of each production process.
9. An electronic device comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it causes the electronic device to implement the method as described in any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the method as described in any one of claims 1 to 7.