A method and device for island assembly production scheduling

Abstract

The present invention discloses a method and device for island assembly production scheduling. The invention includes: confirming the assembly island area and the assembly island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of the minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as the final decision variables; calculating the total completion time according to the final decision variables, known quantities and constraints. Through the present invention, the problem of lack of an efficient production scheduling system in the multi-link production process of the island assembly mode in the related art is solved.

Description

Technical Field

[0001] The present invention relates to the technical field of production scheduling, and in particular to a method and device for island assembly production scheduling. Background Art

[0002] With the continuous development and improvement of the field of intelligent manufacturing, the technical level of the production process is constantly improving, and the demand for optimizing personalized customized production scheduling is also growing. The increase in customer customization needs makes each order unique, including personalized requirements in terms of product specifications, colors, functions, etc. This diversity requires the production system to respond quickly and flexibly, and adjust the production process to meet different customer needs, thereby improving customer satisfaction and competitive advantage. The application of advanced manufacturing systems and Internet technologies makes the production process more intelligent and interconnected. This information-based production management provides the necessary foundation and support for production scheduling under the personalized customization model. Workshop production scheduling is particularly critical in this context. Through reasonable production scheduling, it can ensure that limited resources are allocated to each task within the appropriate time to meet one or more optimization goals, and significantly shorten the project completion cycle, reduce production costs, and improve overall production efficiency and equipment utilization. Therefore, it is of great practical significance to study and solve the production scheduling problem in the manufacturing industry.

[0003] The traditional workshop assembly mode is usually a linearly arranged production line, where products flow in different processes in turn, and each process is handled by specialized equipment and personnel. The island assembly mode divides the assembly process into multiple independent assembly islands (or workstations), each of which has complete tools, equipment and required human resources to independently complete specific assembly tasks. The island assembly mode can better meet the personalized customization needs of customers. Each assembly island in the island assembly mode can be operated independently, and the production sequence and process flow can be flexibly adjusted according to the personalized customization needs of customers to cope with order changes and production scheduling needs. This flexibility helps shorten the delivery cycle and improve production response speed.

[0004] At present, there are few studies on the layout and production scheduling methods of the island assembly mode, and the traditional workshop production scheduling model cannot fit the actual assembly production of the island assembly mode. At the same time, in previous scheduling, minimizing the total maximum completion time is often used as the optimization objective function, but this may cause the waiting time of some manufacturing links of the product to be too long. Taking minimizing the total waiting time of all products as the objective function, it can reduce the inventory demand of work-in-progress, reduce the quality problems caused by long stays, reduce the bottleneck effect caused by process imbalance, improve the overall efficiency of the production line, reduce the idle time of equipment, and improve the utilization rate of equipment. At the same time, the bottleneck process with a long waiting time can be identified, and it can be analyzed and improved in time to improve the efficiency of the entire production process. In addition, reducing the total waiting time of each product can enable all products to pass through each process quickly, which will also minimize the completion time of the last product (i.e., the total maximum completion time).

[0005] Greedy Algorithm is an algorithm strategy that achieves the global optimal solution by selecting the best solution in the current state (i.e. the local optimal solution) at each step. In the greedy algorithm, the algorithm will select the local optimal solution at each stage, and hope to eventually obtain the global optimal solution or a solution close to the optimal solution in this way.

[0006] In the related technology, the multi-link production process of the island assembly model lacks an efficient production scheduling system.

[0007] Currently, no effective solution has been proposed for the above-mentioned problems existing in the related technologies. Summary of the invention

[0008] The main purpose of the present application is to provide a method and device for island assembly production scheduling, so as to at least solve the problem of lack of an efficient production scheduling system in the multi-link production process of the island assembly mode in the related art.

[0009] In order to achieve the above-mentioned purpose, according to one aspect of the present application, a method for island assembly production scheduling is provided. The method includes: confirming assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of the minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as the final decision variables; and calculating the total completion time according to the final decision variables, known quantities and constraints.

[0010] Optionally, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0011] Optionally, set a difference island constraint, the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; set a parallel island constraint, the parallel island constraint condition is that each product needs to pass through all parallel islands; set a parallel island constraint, the parallel island constraint condition is that each product passes through any parallel island; set a general constraint, the general constraint conditions are: each assembly island can only assemble one product at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0012] Optionally, obtain the island waiting time, the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0013] Optionally, products are added to assembly islands according to constraints to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0014] Optionally, calculate the product waiting time, the calculation formula is ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0015] Optionally, calculate the completion time using the formula ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0016] According to another aspect of the present application, a device for island assembly production scheduling is provided. The device includes: a confirmation unit, used to confirm assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island; a setting unit, used to set constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; an establishment unit, used to establish an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of the minimum waiting time; an adjustment unit, used to adjust the initial decision variables, and when the objective function is the minimum value, the initial decision variables are determined to be the final decision variables; a calculation unit, used to calculate the total completion time according to the final decision variables, known quantities and constraints.

[0017] In order to achieve the above-mentioned purpose, according to another aspect of the present application, a computer-readable storage medium is provided, the computer-readable storage medium comprising a stored program, wherein the program executes any one of the above-mentioned methods for island assembly production scheduling.

[0018] According to another aspect of the present application, an electronic device is provided, comprising: one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs include a method for executing any one of the island assembly production scheduling items.

[0019] Through the present application, the following steps are adopted: confirming assembly island areas and assembly islands, wherein the assembly island areas include difference island areas, parallel island areas and parallel island areas, the assembly islands include difference islands, parallel islands and parallel islands, the difference island areas include at least one difference island, the parallel island areas include at least one parallel island, and the parallel island areas include at least one parallel island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as the final decision variables; calculating the total completion time based on the final decision variables, known quantities and constraints, thereby solving the problem of lack of an efficient production scheduling system in the multi-link production process of the island assembly mode in the related technology, thereby achieving the technical effect of maximizing production efficiency, improving equipment utilization and forming a complete model. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0021] Figure 1 It is a flow chart of a method for island assembly production scheduling provided according to an embodiment of the present application;

[0022] Figure 2 It is a functional diagram of the method model of the present invention;

[0023] Figure 3 It is the technical roadmap of the present invention;

[0024] Figure 4 Gantt chart for the optimal production scheduling solution;

[0025] Figure 5 It is a structural block diagram of a device for island assembly production scheduling provided according to an embodiment of the present application. DETAILED DESCRIPTION

[0026] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0027] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0028] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0029] As introduced in the background technology, the island assembly mode in the prior art is inefficient and there is no suitable way to schedule production. In order to solve the problem of lack of an efficient production scheduling system in the multi-link production process of the island assembly mode, the embodiments of the present application provide a method and device for island assembly production scheduling.

[0030] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present invention.

[0031] In this embodiment, a method for island assembly production scheduling running on a mobile terminal, a computer terminal or a similar computing device is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0032] Figure 1 1 is a flow chart of a method for island assembly production scheduling according to an embodiment of the present application. Figure 1 As shown, the method comprises the following steps:

[0033] Step S101, confirming assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island;

[0034] Specifically, first determine how many assembly islands are needed for production, and also obtain known quantities, so that all the basic conditions required for production are obtained. Difference islands: customize the difference assembly process for product personalization to complete the difference process assembly work of different types of products. Parallel islands: for the common assembly process without process constraints of the product, complete the common process assembly work of all products without considering process constraints. Parallel islands: for the bottleneck assembly process of the product, match the overall assembly rhythm, and complete the bottleneck process assembly work of all products.

[0035] Step S102, setting constraint conditions, wherein the constraint conditions include difference island constraint, parallel island constraint, parallel island constraint and conventional constraint;

[0036] Specifically, the constraints limit the range of values ​​of the initial decision variables and the final decision variables to ensure the feasibility and rationality of the production scheduling plan. In this model, the constraints include that each product needs to pass through a specific island, that only one product can be processed at a time on an assembly island, and the assembly sequence of each assembly stage. These constraints ensure the rationality and consistency of the production process.

[0037] Step S103, establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time;

[0038] Specifically, the objective function is the goal that the model is to optimize. In this model, the objective function is to minimize the total waiting time of all products. By solving the problem of minimizing the total waiting time of all products, the production tasks can be completed quickly, the efficiency of the entire production process can be improved, the idle time of the equipment can be reduced, and the utilization rate of the equipment can be improved. The synergy between these factors is achieved through mathematical modeling. The decision variables used in this model are and , The machine allocation problem used for each stage of decision making indicates whether the product Assembly is carried out in island K. The job sequencing problem for decision-making workpieces indicates whether the product Before the product On the Island Execute in.

[0039] Step S104, adjusting the initial decision variables, and when the objective function is at a minimum value, determining the initial decision variables as final decision variables; and calculating the total completion time based on the final decision variables, known quantities, and constraints;

[0040] Specifically, the objective function corresponding to the final decision variable is the minimum waiting time, and the total completion time is used to compare the completion time with the previous production scheduling rules to make it clear that the final objective function also corresponds to the shortest completion time.

[0041] On the basis of fully considering the actual island assembly mode and production scheduling process, this method gives the layout of the island assembly workshop, and takes the number of various assembly islands, the assembly time of each assembly island, the type and quantity of products to be assembled as input, and calculates the optimal production scheduling plan through this method to minimize the total waiting time of all products. The variables in the model are mainly divided into four parts. The number of various assembly islands in the island assembly, the assembly time of each assembly island, the type of products to be assembled, and the number of products to be assembled are defined as known quantities. The allocation of assembly islands and the assembly order of products are used as decision variables. The shortest total waiting time of all products is defined as the objective function, and appropriate constraints are defined in combination with the actual island assembly process.

[0042] In order to solve the production scheduling problem of the island assembly mode under personalized customization, a method and device for island assembly production scheduling based on a greedy algorithm are proposed, aiming to solve the production scheduling problem of the island assembly mode under personalized customization. This method considers the actual island assembly mode and production scheduling process, gives the layout of the island assembly workshop, and takes the number of various assembly islands, the assembly time of each assembly island, the type and quantity of products to be assembled as input to construct a 0-1 integer programming model. At the same time, the objective function is to minimize the total waiting time of all products, and the greedy algorithm is used to solve the model. The model takes the allocation of assembly islands and the assembly order of products as decision variables, and the objective function is set to minimize the total waiting time of all products. At the same time, appropriate constraints are defined in combination with the actual situation of the island assembly process to improve production efficiency and response speed.

[0043] Aiming at the problem of lack of efficient production scheduling system in the multi-link production process of island assembly mode, this paper constructs the layout of island assembly workshop, builds a 0-1 integer programming model, and solves the optimal production scheduling scheme based on the greedy algorithm, so as to minimize the total waiting time of all products.

[0044] like Figure 2 as well as Figure 3 , the technical route of the present invention is:

[0045] Collect relevant flexible production scheduling model information, and build an island assembly workshop layout based on actual production needs and production scheduling methods to meet customers' personalized customization needs, and give the definitions of difference islands, parallel islands and parallel islands.

[0046] Based on the layout of the island assembly workshop, a 0-1 integer programming model is constructed to define the known information and decision variables of the model. The objective function and constraints are defined according to the actual production needs and the layout of the island assembly workshop.

[0047] Based on the constructed 0-1 integer programming model, the solution steps are given based on the greedy algorithm.

[0048] In the actual island assembly mode, there are many factors that affect the production scheduling plan, but the assembly sequence of the assembly island plays a deterministic role. Based on this realistic condition, a method and device for island assembly production scheduling are established.

[0049] The scenario considered in this model is the production scheduling problem between the islands of personalized customization difference between two types of products, the parallel islands without process constraints, and the parallel islands with bottleneck processes. The most reasonable production scheduling method is solved by using the known information such as the number of various assembly islands, assembly time, the type of products to be assembled, the number of products, and the assembly sequence.

[0050] The model is mainly divided into known quantities, decision variables, objective functions and constraints. The known quantities are the number of various assembly islands in the island assembly, the assembly time of each assembly island, the type of products to be assembled, and the number of products to be assembled. The decision variables are the variables that need to be obtained. Then, according to the actual assembly scheduling situation, the constraints are constructed to form a model. By solving the model, the production scheduling plan for the island assembly can be obtained, so that the total waiting time of all products is the shortest.

[0051] In an optional embodiment, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0052] Specifically, the known quantity is defined according to the input value. This method does not consider the specific transfer time between islands. In an island assembly workshop, taking the automobile industry as an example, the assembly process can be decomposed into five modules: door subassembly, cockpit subassembly, seat subassembly, front and rear bumper subassembly, three-electric and chassis subassembly. For similar door subassembly, based on customer needs, difference islands can be designed to meet personalized customization needs. For time-consuming assemblies such as seat subassembly and cockpit subassembly, parallel islands are designed to balance the assembly time of the entire assembly process. For certain assemblies such as front and rear bumper subassembly, three-electric and chassis subassembly that do not need to consider process constraints, parallel islands can be designed for flexible scheduling of assembly islands. Each product to be assembled must pass through all personalized customization difference islands, parallel islands without process constraints, and bottleneck process parallel islands to complete the assembly, and each assembly island can only complete one assembly task. Now only consider the production scheduling problems between personalized customization difference islands, parallel islands without process constraints, and bottleneck process parallel islands for two types of products.

[0053] This method does not consider the specific transfer time between islands. In an island assembly workshop, each product to be assembled must pass through all common process assembly islands, personalized customization difference islands, parallel islands without process constraints, and bottleneck process parallel islands to complete the assembly. Each assembly island can only complete one assembly task.

[0054] In an optional embodiment, a difference island constraint is set, and the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; a parallel island constraint is set, and the parallel island constraint condition is that each product needs to pass through all parallel islands; a parallel island constraint is set, and the parallel island constraint condition is that each product passes through any parallel island; a regular constraint is set, and the regular constraint conditions are: only one product can be assembled on each assembly island at the same time; the start time of assembly of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0055] Specifically, the constraints that the model needs to satisfy are as follows:

[0056] (1) Difference island constraint (if there is no difference island, this constraint is omitted):

[0057] For each island of difference, each product needs to go through a specific island of difference: , x is the number of difference islands, and X is the set of difference islands.

[0058] Certain products are only available on the assembly island Mid-Assembly: , ,in, Represents the collection of product type 1 and product type 2 respectively.

[0059] (2) Parallel island constraint (if there is no parallel island, this constraint is omitted):

[0060] For each parallel island, each product needs to pass through all parallel islands: , is the number of parallel islands, is a collection of parallel islands.

[0061] In parallel islands, the start time of assembly of any product cannot be the same as the start time of assembly in other assembly islands: .

[0062] (3) Parallel island constraint (if there is no parallel island, this constraint is omitted):

[0063] For each parallel island, each product needs to pass through an arbitrary parallel island: , is the set of parallel islands;

[0064] (4) General constraints:

[0065] Each assembly island can only process one product at a time: ,in, is a sufficiently large positive number;

[0066] The assembly of any product cannot start earlier than the time it was assembled on the previous assembly island. End time: ;

[0067] The end time of any product in each stage is determined by its start time and production time: , is the production time on assembly island k;

[0068] The total completion time is defined as the maximum of the final completion times of all assembly islands: ,in, For assembly island final completion time.

[0069] In an optional embodiment, the island waiting time is obtained, and the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0070] Specifically, when calculating the island waiting time, the difference island and parallel island are calculated by adding up the product waiting times of all products to get the island waiting time. When calculating the island waiting time of the parallel island, it is calculated based on the processing type of the parallel island. If the parallel island has only one processing method, then the island waiting time is the product waiting time of the last product. If the parallel island has multiple processing methods, then the island waiting time is the sum of the product waiting time of the last product corresponding to each processing method.

[0071] In an optional embodiment, products are added to assembly islands according to constraint conditions to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0072] Specifically, since the first assembly island is the beginning of processing, when any product is processed in the first assembly island, the product waiting time is 0.

[0073] In an optional embodiment, the product waiting time is calculated using the formula: ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0074] In an optional embodiment, the completion time is calculated using the formula: ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0075] In an optional embodiment, the greedy algorithm selects the local optimal solution in each assembly island area, that is, when each product determines the assembly sequence and assembly island allocation, the assembly island that can make the current stage waiting time the shortest is selected for processing to minimize the total waiting time of the product. Specifically, each assembly island area determines the production sequence and assembly island selection of the next product based on the current completion time and the assembly time required for the product, so as to minimize the total waiting time of all products.

[0076] There are two types of products in certain quantities. The assembly production needs to be arranged through the three assembly islands mentioned above (e.g., two different models of the same series, Model A , Model B ); the number of corresponding difference islands is 2, numbered k=1, 2 (i.e. k=1, 2∈X); the number of corresponding parallel islands is 2, numbered k=3, 4 (i.e. k=3, 4∈M); the number of corresponding parallel islands is 2, numbered k=5, 6 (i.e. k=5, 6∈N). The specific production scheduling steps are as follows:

[0077] (1) Difference island: Based on the difference island constraint and the conventional constraint, for each product :

[0078] if is a product of type I (i.e. ), then add it to difference island 1, for each product added to difference island 1 (k=1) , its waiting time (If it is the first stage, there is no waiting time consideration. ), completion time . And update the final completion time of difference island 1 .

[0079] if is a product of type II (i.e. ), then add it to difference island 2. For each product added to difference island 2 (k=2), , its waiting time (If it is the first stage, there is no waiting time consideration. =0), completion time . And update the final completion time of Difference Island 2 .

[0080] (2) Parallel islands: Based on the parallel island constraints and conventional constraints, for each product :

[0081] if Assembly islands already in the difference island area If the production is completed in parallel island 3 and parallel island 3 is idle, it will be added to parallel island 3 (k=3). For each product added to parallel island 3 , its waiting time , completion time . and update the product Total waiting time , Parallel Island 3 final completion time Once completed, the product will be added to Parallel Island 4.

[0082] if If the product has been completed in parallel island 3 and parallel island 4 is idle, it will be added to parallel island 4 (k=4). For each product added to parallel island 4 , its waiting time , completion time . and update the product Total waiting time , Parallel Island 4 final completion time .

[0083] (3) Parallel island: Based on the parallel island constraints and conventional constraints, for each product :

[0084] if If the product has been completed in the parallel island area and parallel island 5 is idle, it will be added to parallel island 5 (k=5). For each product added to parallel island 5 , its waiting time , completion time . and update the product Total waiting time , Parallel Island 5 final completion time .

[0085] if If the production has been completed in the parallel island area and parallel island 5 is in working state, it will be added to parallel island 6 (k=6). For each product added to parallel island 6 , its waiting time , its completion time . and update the product Total waiting time , Parallel Island 6 final completion time .

[0086] (4) Minimum total waiting time for all products:

[0087] Total completion time: .

[0088] In the actual calculation and solution process, under the premise of obtaining known quantities, the decision variables can be solved through the constraints given above, and then the solution results are obtained, and the optimal production scheduling plan under the current scenario conditions is obtained. The present invention is verified by an example.

[0089] In the automobile manufacturing industry, the production process includes stamping, body, painting and final assembly. In order to achieve multi-variety and small-batch production, companies often use final assembly with the lowest automation rate as the entry point and breakthrough for the new model. Based on the principle of "modular assembly, differentiated subassembly", various assembly processes such as door subassembly and inspection, cockpit subassembly and inspection, seat subassembly and inspection, front and rear bumper subassembly and inspection, three-electric and chassis subassembly and inspection are divided into corresponding assembly islands to complete production. Therefore, we simplified the scenario of this link to verify the positive use of this method.

[0090] The following example is given for a simple verification: There is an electric vehicle assembly workshop that needs to produce two models of electric vehicles. The workshop has six assembly islands, among which a differential process is completed in differential island 1 (k=1) and differential island 2 (k=2), and the corresponding production time is 10 minutes (T1=10) and 15 minutes (T2=15). A process without process constraints is completed in parallel island 3 (k=3) and parallel island 4 (k=4), and the corresponding production time is 15 minutes (T3=15) and 10 minutes (T4=10). A bottleneck process is completed in parallel island 5 and parallel island 6, and the corresponding production time is 20 minutes (T5= T6=10). There are 5 products waiting for assembly production, among which products A, B, and C are type I and need to be completed in differential island 1, and products D and E are type II and need to be completed in differential island 2. All products need to be assembled in the differential island area, parallel island area, and parallel island area in sequence. Through the above information, we can calculate and finally get the optimal production scheduling plan as follows: Figure 4 shown.

[0091] Figure 4 Gantt chart for the optimal production scheduling solution. Figure 4 P1-P5 represent five products to be assembled; the vertical axis represents the assembly island, among which Q1 and Q2 represent two difference islands, Q3 and Q4 represent two parallel islands, and Q5 and Q6 represent two parallel islands. The total minimum waiting time is 95 and the total completion time is 115 minutes.

[0092] Scheduling results:

[0093] (1) On which assembly island is each product assembled?

[0094] P1: Q1-Q3-Q4-Q5;

[0095] P2: Q1-Q3-Q4-Q5;

[0096] P3: Q1-Q3-Q4-Q6;

[0097] P4: Q2-Q3-Q4-Q6;

[0098] P5: Q2-Q3-Q4-Q5;

[0099] (2) Assembly order of all products on each assembly island:

[0100] Q1: P1, P2, P3;

[0101] Q2: P4, P5;

[0102] Q3: P1, P4, P2, P3, P5;

[0103] Q4: P1, P4, P2, P3, P5;

[0104] Q5: P1, P2, P5;

[0105] Q6: P4, P3;

[0106] After obtaining the known quantities of the model, the initial decision variables, the final decision variables, the objective function and the constraints. In this model, the known quantities include the number of various assembly islands, the assembly time of each assembly island, the type and quantity of products to be assembled. This information provides the basic data of the model and is the starting point of the production scheduling problem. Through these known quantities, the model can understand the configuration of the production environment and production requirements. Decision variables are controllable factors in the model, which are used to describe the parts that need to be decided. In this model, the decision variables include the distribution of products in each assembly island and the assembly order of products in each assembly island. Through these decision variables, the flow path and assembly order of products in the production process can be adjusted to optimize production efficiency. Constraints limit the value range of decision variables to ensure the feasibility and rationality of the production scheduling plan. In this model, the constraints include that each product needs to pass through a specific island area, that only one product can be processed on the assembly island at the same time, and the assembly order of each assembly stage. These constraints ensure the rationality and consistency of the production process. The objective function is the goal to be optimized by the model. In this model, the objective function is to minimize the total waiting time of all products. By solving the problem of minimizing the total waiting time of all products, the production tasks can be completed quickly, the efficiency of the entire production process can be improved, the idle time of equipment can be reduced, and the utilization rate of equipment can be improved. The synergy between these factors is achieved through mathematical modeling. The known quantities provide the input data of the model, the decision variables and constraints constitute the description and restriction of the production scheduling problem, and the objective function guides the direction of model optimization. By reasonably designing the decision variables and constraints and minimizing the objective function, an optimal production scheduling plan can be found to maximize production efficiency, improve equipment utilization, and form a complete model.

[0107] The embodiment of the present application also provides a device for island assembly production scheduling. It should be noted that the device for island assembly production scheduling in the embodiment of the present application can be used to execute the method for island assembly production scheduling provided in the embodiment of the present application. The device is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the device described in the following embodiments is preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceived.

[0108] The following introduces an island assembly production scheduling device provided in an embodiment of the present application.

[0109] Figure 5 1 is a structural block diagram of a device for island assembly production scheduling according to an embodiment of the present application. Figure 5 As shown, the device includes: a confirmation unit 501, used to confirm assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island; a setting unit 502, used to set constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; an establishment unit 503, used to establish an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; an adjustment unit 504, used to adjust the initial decision variables, and when the objective function is the minimum value, the initial decision variables are determined to be the final decision variables; a calculation unit 505, used to calculate the total completion time according to the final decision variables, known quantities and constraints.

[0110] In an optional embodiment, the confirmation unit 501 includes: a first acquisition subunit, used to obtain known quantities, the known quantities including production type, production quantity, difference island quantity, parallel island quantity, parallel island quantity, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0111] In an optional embodiment, the setting unit 502 includes: a first setting subunit, used to set a difference island constraint, wherein the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; a second setting subunit, used to set a parallel island constraint, wherein the parallel island constraint condition is that each product needs to pass through all parallel islands; a third setting subunit, used to set a parallel island constraint, wherein the parallel island constraint condition is that each product passes through any parallel island; a fourth setting subunit, used to set a conventional constraint, wherein the conventional constraint conditions are: only one product can be assembled on each assembly island at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and the assembly time of the product.

[0112] In an optional embodiment, the establishing unit 503 includes: a second obtaining subunit, which is used to obtain the island waiting time, and the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish subunits to establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0113] In an optional embodiment, the second acquisition subunit includes: an acquisition module, which is used to add the product to the assembly island according to the constraint conditions to obtain the product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0114] In an optional embodiment, the second acquisition subunit includes: a calculation module for calculating the product waiting time, and the calculation formula is: ,in, is the product waiting time; the second acquisition subunit includes: when in the parallel island area, selecting the product waiting time corresponding to the last product as the island area waiting time.

[0115] In an optional embodiment, the calculation unit 505 includes: a calculation subunit, which is used to calculate the completion time, and the calculation formula is: ,in, For completion time, For products The assembly start time, For assembly island assembly time; select subunits to select the maximum value of all completion times as the total completion time.

[0116] The device for island assembly production scheduling includes a processor and a memory, and the confirmation unit 501 and the like are stored in the memory as program units, and the processor executes the program units stored in the memory to implement corresponding functions. The modules are all located in the same processor; or, the modules are located in different processors in any combination.

[0117] The processor contains a kernel, which retrieves the corresponding program unit from the memory. One or more kernels can be set, and the technical problem of lack of efficient production scheduling system in the multi-link production process of island assembly mode can be solved by adjusting the kernel parameters.

[0118] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.

[0119] An embodiment of the present invention provides a computer-readable storage medium, which includes a stored program, wherein when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the method for island assembly production scheduling.

[0120] Specifically, a method for island assembly production scheduling includes: confirming assembly island areas and assembly islands, wherein the assembly island areas include difference island areas, parallel island areas and parallel island areas, the assembly islands include difference islands, parallel islands and parallel islands, the difference island areas include at least one difference island, the parallel island areas include at least one parallel island, and the parallel island areas include at least one parallel island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as the final decision variables; and calculating the total completion time based on the final decision variables, known quantities and constraints.

[0121] Optionally, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0122] Optionally, set a difference island constraint, the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; set a parallel island constraint, the parallel island constraint condition is that each product needs to pass through all parallel islands; set a parallel island constraint, the parallel island constraint condition is that each product passes through any parallel island; set a general constraint, the general constraint conditions are: each assembly island can only assemble one product at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0123] Optionally, obtain the island waiting time, the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0124] Optionally, products are added to assembly islands according to constraints to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0125] Optionally, calculate the product waiting time, the calculation formula is ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0126] Optionally, calculate the completion time using the formula ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0127] An embodiment of the present invention provides a processor, which is used to run a program, wherein the program executes the method for island assembly production scheduling when running.

[0128] Specifically, a method for island assembly production scheduling includes:

[0129] Confirm assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island; set constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establish an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; adjust the initial decision variables, and when the objective function is the minimum value, determine the initial decision variables as the final decision variables; calculate the total completion time based on the final decision variables, known quantities and constraints.

[0130] Optionally, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0131] Optionally, set a difference island constraint, the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; set a parallel island constraint, the parallel island constraint condition is that each product needs to pass through all parallel islands; set a parallel island constraint, the parallel island constraint condition is that each product passes through any parallel island; set a general constraint, the general constraint conditions are: each assembly island can only assemble one product at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0132] Optionally, obtain the island waiting time, the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0133] Optionally, products are added to assembly islands according to constraints to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0134] Optionally, calculate the product waiting time, the calculation formula is ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0135] Optionally, calculate the completion time using the formula ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0136] The embodiment of the present invention provides a device, the device includes a processor, a memory and a program stored in the memory and can be run on the processor, and the processor implements at least the following steps when executing the program: confirming the assembly island area and the assembly island, wherein the assembly island area includes a difference island area, a parallel island area and a parallel island area, the assembly island includes a difference island, a parallel island and a parallel island, the difference island area includes at least one difference island, the parallel island area includes at least one parallel island, and the parallel island area includes at least one parallel island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as final decision variables; calculating the total completion time according to the final decision variables, known quantities and constraints. The device in this article can be a server, a PC, a PAD, a mobile phone, etc.

[0137] Optionally, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0138] Optionally, set a difference island constraint, the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; set a parallel island constraint, the parallel island constraint condition is that each product needs to pass through all parallel islands; set a parallel island constraint, the parallel island constraint condition is that each product passes through any parallel island; set a general constraint, the general constraint conditions are: each assembly island can only assemble one product at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0139] Optionally, obtain the island waiting time, the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0140] Optionally, products are added to assembly islands according to constraints to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0141] Optionally, calculate the product waiting time, the calculation formula is ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0142] Optionally, calculate the completion time using the formula ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0143] The present application also provides a computer program product, which, when executed on a data processing device, is suitable for executing a program that initializes at least the following method steps: confirming assembly island areas and assembly islands, wherein the assembly island areas include difference island areas, parallel island areas and parallel island areas, the assembly islands include difference islands, parallel islands and parallel islands, the difference island areas include at least one difference island, the parallel island areas include at least one parallel island, and the parallel island areas include at least one parallel island; setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; establishing an objective function based on a greedy algorithm model according to known quantities, constraints and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; adjusting the initial decision variables, and when the objective function is the minimum value, determining the initial decision variables as the final decision variables; and calculating the total completion time based on the final decision variables, known quantities and constraints.

[0144] Optionally, known quantities are obtained, including production type, production quantity, number of difference islands, number of parallel islands, number of parallel islands, difference island assembly time, parallel island assembly time, and parallel island assembly time.

[0145] Optionally, set a difference island constraint, the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; set a parallel island constraint, the parallel island constraint condition is that each product needs to pass through all parallel islands; set a parallel island constraint, the parallel island constraint condition is that each product passes through any parallel island; set a general constraint, the general constraint conditions are: each assembly island can only assemble one product at the same time; the start assembly time of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

[0146] Optionally, obtain the island waiting time, the calculation formula is: , where the island waiting time is the product The sum of the waiting time of products in any assembly island area, Waiting time for the island area, For products The assembly start time, The assembly completion time of the product in the previous assembly island. For a collection of products, For the previous assembly island; establish the objective function, the objective function is ,in, is the total waiting time, is the total number of assembly islands.

[0147] Optionally, products are added to assembly islands according to constraints to obtain product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

[0148] Optionally, calculate the product waiting time, the calculation formula is ,in, is the product waiting time; obtain the island area waiting time, including: when in the parallel island area, select the product waiting time corresponding to the last product as the island area waiting time.

[0149] Optionally, calculate the completion time using the formula ,in, For completion time, For products The assembly start time, For assembly island The maximum value of all completion times is selected as the total completion time.

[0150] Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order than here, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0151] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0152] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0153] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0154] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0155] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0156] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0157] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0158] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0159] The above description is only the preferred embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A method for island assembly production scheduling, characterized in that: include: Confirming assembly islands and assembly islands, wherein the assembly islands include difference islands, parallel islands and parallel islands, the assembly islands include difference islands, parallel islands and parallel islands, the difference islands include at least one difference island, the parallel islands include at least one parallel island, and the parallel islands include at least one parallel island; Setting constraints, wherein the constraints include difference island constraints, parallel island constraints, parallel island constraints and general constraints; Establishing an objective function based on a greedy algorithm model according to known quantities, the constraint conditions and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; Adjusting the initial decision variable, and when the objective function is a minimum value, determining the initial decision variable as a final decision variable; The total completion time is calculated according to the final decision variable, the known quantity and the constraint condition.

2. The method according to claim 1, characterized in that Identify the assembly island area and assembly island, including: The known quantities are obtained, and the known quantities include production type, production quantity, difference island quantity, parallel island quantity, parallel island quantity, difference island assembly time, parallel island assembly time, and parallel island assembly time.

3. The method according to claim 1, characterized in that Set constraints, including: Setting the difference island constraint, where the difference island constraint condition is that each product needs to pass through a difference island corresponding to the product; Set the parallel island constraint, where each product needs to pass through all the parallel islands; Set the parallel island constraint, where the parallel island constraint condition is that each product passes through any of the parallel islands; The conventional constraints are set as follows: only one product can be assembled on each assembly island at the same time; the start time of assembly of any product is greater than the end time of the product on the previous assembly island; the end time of any product on each assembly island is the sum of the assembly start time and assembly time of the product.

4. The method according to claim 1, characterized in that The objective function is established based on the greedy algorithm model according to the known quantities, the constraints and the initial decision variables, including: Get the island waiting time, the calculation formula is: , Among them, the island waiting time is the product The sum of the waiting time of products in any assembly island area, is the island waiting time, For products The assembly start time, The assembly completion time of the product in the previous assembly island. is the set of products, For the last assembly island; Establish the objective function, which is ,in, is the total waiting time, is the total number of assembly islands.

5. The method according to claim 4, characterized in that Get the island waiting time, including: The product is added to the assembly island according to the constraint condition to obtain the product waiting time. When the product is assembled in the first assembly island, the product waiting time is zero.

6. The method according to claim 5, characterized in that Get the island waiting time, including: Calculate the waiting time of the product, the calculation formula is ,in, Waiting time for said product; Obtaining the island waiting time includes: when in a parallel island, selecting the product waiting time corresponding to the last product as the island waiting time.

7. The method according to claim 1, characterized in that Calculating the total completion time according to the final decision variable, the known quantity and the constraint condition includes: Calculate the completion time, the calculation formula is ,in, is the completion time, For products The assembly start time, For assembly island Assembly time; The maximum value of all the completion times is selected as the total completion time.

8. A device for island assembly production scheduling, characterized in that: include: A confirmation unit, used to confirm an assembly island area and an assembly island, wherein the assembly island area includes a difference island area, a parallel island area and a parallel island area, the assembly island includes a difference island, a parallel island and a parallel island, the difference island area includes at least one difference island, the parallel island area includes at least one parallel island, and the parallel island area includes at least one parallel island; A setting unit, used for setting constraint conditions, wherein the constraint conditions include difference island constraints, parallel island constraints, parallel island constraints and conventional constraints; An establishing unit, configured to establish an objective function based on a greedy algorithm model according to known quantities, the constraint conditions and initial decision variables, wherein the initial decision variables include machine allocation variables and workpiece sorting variables, and the objective function is a function of minimum waiting time; An adjusting unit, used for adjusting the initial decision variable, and when the objective function is a minimum value, determining the initial decision variable as a final decision variable; A calculation unit is used to calculate the total completion time according to the final decision variable, the known quantity and the constraint condition.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the method for island assembly production scheduling as described in any one of claims 1 to 7.

10. An electronic device, characterized in that: include: One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, and the one or more programs are used to execute a method for island assembly production scheduling as described in any one of claims 1 to 7.

Images