Method and processing equipment for manufacturing a product

Abstract

In order to improve the planning and implementation of product processing in a processing device, it is stipulated that: the processing device (12) is modeled using a machine network diagram (M), which models the processing device (12) as a network of processing nodes (1), and the product to be processed is modeled using a product synthesis diagram (S), which models the hierarchical structure of the product in the form of a tree of product synthesis nodes (2). The machine network diagram (M) and the product synthesis diagram (S) are interrelated based on software to form a processing sequence (F) in such a way that for each operation node (O) of the product synthesis diagram (S), a processing node (1) of the machine network diagram (M) is selected, and the processing node implements the processing process steps to be implemented on the corresponding operation node (O). The processing sequence (F) is implemented using a device controller (11) in order to manufacture a product on the processing device (12).

Description

Technical Field

[0001] The present invention relates to a method for manufacturing a product in a processing device, in which the product is processed in a plurality of processing stations in the processing device and the product is moved between successive processing stations by means of a transport unit, and also relates to a corresponding processing device. Background Art

[0002] Products are generally processed in processing devices today. Here, the products pass through a plurality of processing stations until the products are processed. Processing each product individually (batch size of one) has become the standard today. In order to process (intermediate) products by means of a processing device, the transport paths of the products through the individual processing stations must be planned. Selecting the processing stations from the available processing stations and the transport paths of the products through the individual processing stations are planned and programmed by the application developer. The current topology of the processing device during processing is always linear, i.e., the (intermediate) products pass through successive processing stations serially. Parallel formation of the processing process is an exception to achieve load distribution, and thus the parallel-guided lines typically implement the same processing process. Each processing station and the transport paths therebetween are controlled by a line controller, which is manually programmed by the application developer, so that the desired product is produced at the end. However, this process is very time-consuming, lacks flexibility, and always requires a programmer.

[0003] Especially in the case of complex products with a plurality of processing steps assigned to different processing stations, programming the processing device is very time-consuming, and unforeseen problems, such as bottlenecks (so-called blockages), may occur during the implementation of the programming process, which results in: products piling up at a certain position of the processing device or the processing stations being temporarily unable to produce. Such bottlenecks are naturally undesirable. The current identification of "bottlenecks" in the processing line is achieved through time-consuming simulation. Thus, the elimination of "bottlenecks" is carried out by the application developer changing the application logic at great expense or by adding parallel processing lines at high cost or by replacing the processing stations or the transport system with more efficient machines.

[0004] Such a programmed processing line is also inflexible because the processing line is highly coupled to the product through programming. The conversion of the processing device from one product to another must be reprogrammed manually in a time-consuming manner. If a part of the processing line (such as the transport path or the processing station) fails, this may lead to the shutdown of the entire processing line and thus to high processing failures. Summary of the Invention

[0005] Therefore, the object of the present invention is to improve the planning and implementation of product processing in a processing device.

[0006] The object is achieved by the features of the independent claims. By means of the method according to the invention, manual programming of the device controller is no longer required. In addition, any arbitrarily complex machine network of a processing device can be used, since the machine network can be fully utilized by means of the association. This can be done for each individual product, thereby increasing the flexibility of the processing. In addition, by means of the association, an optimized product flow through the machine network, the priority of the product during manufacturing and / or the load distribution of the processing nodes in the machine network can be achieved in a simple manner. Thus, the hitherto common rigid processing lines for products are broken up, and the processing is made flexible at the product level.

[0007] Another important advantage of the invention is that the manufacture of products can also be simulated. Thus, it is not necessary to manufacture real products, but it is also possible to manufacture only virtual products. Appropriate simulation models of the processing nodes of the machine network diagram are used for simulating the manufacture. Thereby, it is possible to better plan new processing equipment or optimize the current processing equipment with respect to the processing of a defined product (product synthesis diagram). Thus, a feasibility analysis can also be carried out, i.e., it can be determined whether a defined product can actually be processed on the current (possibly very complex) machine network diagram.

[0008] In a particularly advantageous design, a processing cost value is assigned to each processing node of the machine network diagram, and an optimization criterion is determined, and the processing cost is determined, which is the sum of the processing cost values of the processing nodes participating in the processing sequence. Thus, it is possible to simply take into account quality criteria in manufacturing already during the association. Thus, a processing sequence that meets defined quality criteria can be selected for the product. Thus, different processing sequences can also be generated according to the desired quality criteria. If weights are assigned to the processing cost values, the flexibility can be further increased here. The processing cost values can also change over time. For example, the time required for a processing process step can increase with the wear of the processing station (e.g., the wear of the cutting tool of a machine tool) to ensure that the quality remains constant.

[0009] It is completely particularly advantageous to re-determine the processing sequence for the product by re-associating the product synthesis diagram with the machine network diagram during or after the implementation of the processing process steps at the processing nodes of the processing sequence, and to carry out the subsequent manufacture of the product with the new processing sequence. In this way, it is possible to react during the manufacture of the product to changes in the machine network, such as the failure of a processing node (also due to maintenance), the changing load situation of the processing nodes, etc. Thus, the fault tolerance of the processing can be increased. Description of the Drawings

[0010] The following refers to Figures 1 to 10The present invention will be described in more detail. The figures show, by way of example, schematically and non - restrictively, advantageous embodiments of the present invention. In the figures:

[0011] Figures 1 to 4 An example of a machine network diagram is shown;

[0012] Figure 5 and 6 An example of a product synthesis diagram is shown;

[0013] Figure 7 The association between the machine network diagram and the product synthesis diagram is shown;

[0014] Figure 8 The association and use for controlling the processing sequence of the processing equipment are shown;

[0015] Figure 9 An example of the association between the machine network diagram and the product synthesis diagram is shown; and

[0016] Figure 10 The implemented processing sequence is shown. Detailed Description of the Invention

[0017] The present invention is based on manufacturing a final product in a processing device by performing a series of processing process steps (assembly steps, conversions, etc.) on intermediate products at each processing station. The transportation of the intermediate products between successive processing stations is carried out by a transportation unit. Hereinafter, the term "product" is often used only repeatedly, where "product" includes not only the intermediate products during passage through the processing device, but also the finally manufactured final product.

[0018] According to the present invention, the processing of the product is modeled using a product synthesis diagram S and a machine network diagram M.

[0019] The machine network diagram M models the processing equipment, i.e., the processing hardware available for processing. It should be noted here that a factory can contain multiple processing devices, and thus the entire factory can also be mapped by multiple machine network diagrams M. The machine network diagram M is modeled as a network of processing nodes 1, where the processing nodes 1 represent processing stations and / or transport units. For example, by performing at least one processing process step on a product, an impact is exerted on the product at the processing station and it is changed. The transport unit realizes the transport function in order to move the product through the processing equipment. The processing stations of the machine network diagram M can also contain transport units and realize the transport function in such a way that the processing station realizes the continued movement to the next processing node 1 or realizes the picking up of the product from the previous processing node 1. The transport unit can also perform the following processing process steps, such as the step of cooling the product during transport. The processing nodes 1 of the machine network diagram correspond to the possible flow of the product through the processing equipment through the connection of edges, where the possible movement directions are shown as arrows of the edges. The edge between two processing nodes 1 means that the product can move between these processing nodes 1 either in a certain direction or in both directions. The transport unit can be, for example, a conveyor belt, a robot, a linear transport system (such as a long-stator linear motor), an automated guided vehicle (AGV), a planar motor, etc., and thus in particular such a transport system that can realize the product flow. If the processing node 1 can change the product, merge or split the product, it is also called a process node P (processing station or processing station with a transport unit or transport unit with a processing process step). If the processing node 1 satisfies the pure transport function, it is also called a transport node T.

[0020] In Figure 1 an example of a simple machine network diagram M is shown. This example shows the machine network for packaging bottles in a bottle packaging device. The transport node T1 introduces the filled bottles into the process node P1, in which the bottles are labeled. In addition, labels are introduced into the process node P1 from another transport node T2. The labeled bottles are transferred to a packaging machine as the process node P2, in which the labeled bottles are packaged. In addition, empty cartons are introduced into the process node P2 from the transport node T3. The completed packages are exported from the processing equipment through the transport node T4.

[0021] The machine network diagram M according to Figure 1The example is naturally very simple. The machine network diagram M can naturally be significantly more complex depending on the manufacturing equipment. In particular, there can also be multiple process nodes P, which can perform the same processing process step. The transport nodes T and the process nodes P do not always have to alternate either. Not every existing process node P in the machine network diagram M has to be used for processing the product. The process node P can also be set up to perform different processing steps for different products as well. It is also possible to incorporate manual workstations into the machine network as process nodes P. In this case, the process steps are carried out by personnel, possibly with the support of robots or machines, where the instruction list together with the processing parameters can be automatically created by the system. The process node P also seems to be able to be implemented in different ways or via different transport nodes T. The machine network diagram M can also be applicable to the manufacture of different products. Usually, multiple products, even different products, are processed simultaneously in the machine network of the processing equipment.

[0022] In Figure 2 a slightly more complex machine network diagram M for bottle packaging is shown. In this example, parallelization of the packaging is provided, where two process nodes P2, P3 are provided as packaging machines. Each of these process nodes P2, P3 is configured with a conveying package, such as a cardboard box, by the configured transport nodes T4, T5. The transport node T3 effects the division of the product flow of the labeled bottles from the process node P1. The finished packaged bottles are exported from the common transport node T6. Instead of the parallel process nodes P2, P3, the process nodes can also be arranged serially with a suitable transport unit, such as a long-stator linear motor or a planar motor.

[0023] In Figure 3 another example of the machine network diagram M is shown by way of the example of the packaging of bottles. The labeled bottles in the process node P1 are conveyed to the process node P2, in which an inspection of the bottles takes place. In the case of the labeling of the bottles, the transport node T4 conveys the bottles to the process node P3, in which packaging takes place. The unlabeled bottles are merged via the transport node with the inflow of unlabeled bottles from the transport node T2. Thus, the process node does not necessarily have to physically change something on the product (e.g., inspection), but can, for example, only change the data image of the product (e.g., store the result of the inspection of the product). Figure 3 The processing nodes P1, P2, T3, T4 here can also be understood as the following processing nodes (dashed boxes) in which different processes take place.

[0024] It is also conceivable that a transport node T is used for multiple process nodes P, that is, the same transport unit is used to move products between different process nodes P. This can be achieved, for example, using a long-stator linear motor, a circulating conveyor or a planar motor as the transport unit. An example of this is shown in Figure 4 as follows.

[0025] In Figure 4 the transport node T2 is, for example, a transport unit in the form of a long-stator linear motor, which connects the process nodes P2, P3, P4. Products are transported through the transport node T1 and processed at the first process node P1. The products then move from there via the transport node T2 to the second process node P2, then to the third process node P3, and then to the fourth process node P4. The fourth process node P4 also implements the transport function to the next process node P5. Alternatively, the process node P5 can also implement the transport function in order to pick up products from the previous process node P4. From the process node P5, the products can be transported away by another transport node T3 (for example a robot).

[0026] The modeling of the processing equipment by means of the machine network diagram M as a network of processing nodes 1 and edges can also achieve the nesting of the machine network diagram M. For example, a machine network diagram M can be hidden again after the process node P. This is shown in Figure 3 where the processing node 1 enclosed by the dashed line can represent the process node P4, and the process node P4 in turn will be the machine network diagram M. In this way, the processing equipment can also be clearly hierarchically modeled. This facilitates the processing of particularly large machine network diagrams M, where the nested machine network diagrams M are naturally ultimately also just a single machine network diagram M.

[0027] The product synthesis diagram S describes the hierarchical structure of the product itself, in particular the final product, which results from the processing of the individual intermediate products, which are combined in the chain of the respective processing process steps. Thus, the product synthesis diagram S describes in which sub-steps and when which sub-products are combined to manufacture the product. There is a product synthesis diagram S for each different product that is to be processed in the processing equipment or on the machine network diagram M. Naturally, the same product can use the same product synthesis diagram S.

[0028] The product synthesis graph S is composed of a tree of product synthesis nodes 2. The product synthesis nodes 2 of the tree can be product nodes I or operation nodes O. The product nodes represent products (intermediate products, final products), and the operation nodes convert one product or multiple products into one other product or multiple other products through processing process steps. The edges in the tree (connections between nodes) represent the relationships between product synthesis nodes 2 and can also be added with numbers to indicate how many products of the same type use an operation node O to produce new products.

[0029] The product synthesis graph S can start and end with a specific operation node O. The product synthesis graph S preferably starts with at least one operation source for introducing products. Such an operation node O does not have an input end but only has an output end for the introduced products. The product synthesis graph S preferably ends with at least one operation outlet (Operationssenke), which represents the manufactured final product. Such an operation node O does not have an output end but only has an input end. The use of operation sources and operation outlets allows for the nesting of product synthesis graphs S. Here, an operation source or an operation outlet can, for example, again have a product synthesis graph S, such as how to manufacture bottles or print and punch labels or how to reprocess the manufactured packaging.

[0030] In Figure 5 an example of the product synthesis graph S is shown, which includes multiple product synthesis nodes 2 that are connected by edges. This example shows the product synthesis graph S for a six-pack of bottles with labels. The operation nodes O1, O2, O4 are operation sources, and the operation node O6 is an operation outlet. The operation node O3 takes the bottles provided via the product node I1 from the operation source O1 and takes the labels provided via the product node I2 from the operation source O2. The operation node O3 produces labeled bottles, which are available for the product node I3. The operation node O5 produces a package from six labeled bottles from the product node I3 and the packaging of the product node I4 (which is provided by the operation source O4). This package exists at the product node I5 and via the operation outlet O6.

[0031] According Figure 5 to, the product synthesis graph S can naturally be represented equivalently in other ways, such as shown in Figure 6 . Here, the operation node O7 replaces the operation nodes O3, O5 of the product synthesis graph S in Figure 5 .

[0032] The product synthesis graph S also offers additional advantages. If the product synthesis graph S is executed backwards, that is, for example, starting from the operation outlet, then a parts list of the product is obtained, that is, all the initial products required for manufacturing the product.

[0033] The machine network diagram M and / or the product synthesis diagram S can be created by the application developer. For the machine network diagram M, it is natural to understand the processing equipment, and it can be modeled accordingly by processing nodes 1 and edges in the form of a network. (For example, again by the application developer) The product synthesis diagram S can be created for each product to be produced. It is also possible to store prefabricated product synthesis diagrams S for different products, which can be called when needed. The cost for creating the machine network diagram M and the product synthesis diagram S thus occurs only once in principle.

[0034] An important step for the present invention lies in the automated, especially software-based, association of the machine network diagram M and the product synthesis diagram S. In the case of this association, the operation nodes O of the product synthesis diagram S are configured to the available processing nodes 1 of the machine network diagram M, especially the transport nodes T and the process nodes P, as shown by the arrows between the machine network diagram M according to Figure 7 and the product synthesis diagram S according to Figure 3 in Figure 5 . In the case of this association, each operation node O is naturally configured with a processing node 1 that can perform the processing process steps required for the product on the corresponding operation node O. In the case of this association, only such processing nodes 1 in the machine network diagram M are used, which can achieve a continuous product flow in the processing equipment through the machine network diagram M with available transport units (transport nodes T or process nodes P with transport units). This basically means that: the processing nodes 1 selected in the association form a network again, and the processing nodes 1 of this network are connected by edges. The result of the association is a processing sequence F as a network of processing nodes 1 and edges, where the processing sequence F is a sub-network of the machine network diagram M. Each processing node 1 of the processing sequence F is connected to at least one other processing node 1 by at least one edge. Therefore, the processing sequence F is a sequence of processing stations and transport units of the processing equipment modeled by the machine network diagram M, and the product is executed according to this sequence in order to manufacture the product in the processing equipment. In the most general but in practice uncommon case, the processing sequence F corresponds to the machine network diagram M. Usually, the processing sequence F is a sub-network of the machine network diagram M.

[0035] For each product to be manufactured, its own processing sequence F can be given. This means that the same product can be manufactured in different ways in the processing equipment, for example, with different processing stations or with different transport units. But it goes without saying that the same product can also be manufactured with the same processing sequence F.

[0036] If for each operation node O, the machine network diagram M exactly contains one transport node T or one process node P (as in Figure 7As shown in [reference], then this configuration is naturally simple. However, generally and essentially the object of the present invention is to enable a machine network diagram M to have a plurality of transport nodes T or process nodes P, which transport nodes or process nodes can be used for processing process steps in a product synthesis diagram S, that is, for operation nodes O (as shown in [reference]). Figure 9 As shown in [reference]. The processing process steps can be implemented, for example, by different available process nodes P of the machine network diagram M, or the process nodes P of the machine network diagram M can be implemented by different available transport nodes T. In this case, for each operation node O of the product synthesis diagram S, a processing node 1 (process node P or transport node T) of the machine network diagram M must be selected, and the processing node implements the corresponding processing process step. In this way, for each product, a separate line of the machine network available in the processing equipment is determined, and the machine network is modeled by the machine network diagram M. This line can also branch or consist of a plurality of consecutive branches, and thus generally forms a network. Then, this separate network represents a processing sequence F for manufacturing the product, and the processing sequence can then be implemented in the processing equipment 12. Therefore, the processing sequence F created in this way no longer has to be a line as has been common so far, but can be any network in the available machine network.

[0037] This is illustrated schematically by Figure 8 The machine network diagram M and the product synthesis diagram S are fed to an association unit 10, in which the machine network diagram M is associated with the product synthesis diagram S as described. The association unit 10 is computer hardware and / or computer software. The result is a processing sequence F, which is used in the equipment controller 11 (computer hardware and / or computer software) of the processing equipment 12 to control the manufacture of the product on the processing equipment 12.

[0038] It should be noted here that for each processing node 1 of the machine network diagram M (for example, in the equipment controller 11 and / or directly in the processing sequence F), the required data is naturally also stored in order to be able to operate the processing node 1 for the corresponding product. Such data can be a control program, or process parameters (the process parameters can also be related to the corresponding product) or the like. Therefore, the equipment controller 11 can also access this data in order to control the processing equipment 12 accordingly. However, since the specific implementation of the equipment controller of the processing equipment 12 is not important and the possibilities thereof are well known enough, it will not be discussed in more detail here.

[0039] In an associated step, the association unit 10 can first detect whether the product synthesis graph S can actually be implemented on the machine network graph M. For this purpose, from the product synthesis graph S, for example, a parts list of all initial products (operation sources) required for manufacturing the product (operation outlet) can first be determined. Such a parts list can be determined, for example, by executing the product synthesis graph S backward, i.e., starting from the product (operation outlet). However, such a parts list can naturally already be stored together with the product synthesis graph S or already be stored in the product synthesis graph. Subsequently, it can be detected whether each operation source in the product synthesis graph S is provided by the processing node 1 in the machine network graph M. If this is not the case, then the product synthesis graph S cannot be implemented on the machine network graph M.

[0040] However, since not every processing node 1 in the machine network graph M must be implementable in any way and by every other processing node 1, this detection is usually insufficient. Therefore, it is also detected whether the processing process steps in the product synthesis graph S can be implemented on the processing node 1 of the machine network graph M considering the possible transport paths (edges in the network) in the machine network graph M. Here, for example, all possible mappings of the product synthesis graph S onto the machine network graph M can be tried out. This can be carried out automatically and software-supported, for example, with the help of a so-called known and available SMT (satisfiability modulo theories) solver (computer hardware and / or computer software). This determines all possible solutions of the association or confirms the non-implementability of the mapping. Then, one of the possible solutions can be selected as the processing sequence F.

[0041] Another possibility for implementing the association in the association unit 10 lies in propagating the product synthesis graph S backwards. Again, all possible mappings of the product synthesis graph S onto the machine network graph M are determined here. In this scenario, each intermediate step of the product synthesis graph S is considered individually. Each intermediate step includes an operation node O that processes a plurality of intermediate products (product nodes I upstream) in order to produce a product (product node I downstream). Since the product synthesis graph S is executed backwards, for each product to be produced using the operation node O, the subsequent processing node 1 (target node) in the machine network graph M is also known, as this has been confirmed in the previous step. Now, for each operation node O in the product synthesis graph S, it can be detected whether the intermediate products required for implementing the current process step of the operation node O for manufacturing the product can be manufactured in the machine network graph M, such that the target node in the machine network graph M can be reached simultaneously during manufacturing. Thus, it is detected whether the processing node 1 assigned to the operation node O can reach the known subsequent processing node 1, i.e., for example, it is detected whether there is an edge between them in the machine network graph M. Naturally, multiple possible implementation schemes can be given here. Known schemes (such as backtracking algorithms) allow for an exhaustive enumeration of all possibilities, and from these possibilities, the possible solution for the association can be selected as the processing sequence F.

[0042] In principle, any solution can be selected from the possible solutions of the association. However, it is also possible to select a solution optimized according to a determined optimization criterion from the possible solutions. To this end, the optimization criterion is confirmed, and the solution that best satisfies the optimization criterion is selected. The optimization criterion is typically a value, and the optimization criterion with the minimum or maximum value is selected.

[0043] In order to select possible solutions in the association unit 10, for example, a processing cost value can be assigned to each processing node 1 of the machine network diagram M. The processing cost value can be the time required to implement a process step or a transport step. However, the processing cost value can also be a cost value as follows, which gives the cost for a process step or a transport step. The cost value can be a monetary value or an abstract cost value. Compared with a high-efficiency machine, the cost value of manufacturing a product at a manual workstation may be lower, for example, but if the number of pieces is small, then the high-efficiency machine must be retrofitted for this purpose. The opposite may be true in the case of a large number of pieces. However, the processing cost value can also be an energy value as follows, which gives the energy to be consumed for a process step or a transport step, such as electrical energy. The processing cost value can also be the load value of a certain transport node T or process node S, for example, in order to reduce the maintenance interval or to evenly load the process node S. Naturally, multiple different processing cost values can also be considered simultaneously. Therefore, a certain processing route F of the machine network diagram M results in a processing cost that is the sum of the processing cost values of the participating processing nodes 1. If different processing cost values are considered, these processing cost values can be arithmetically associated in any way to determine the processing cost. For example, a weighted sum of different processing cost values can be calculated as the processing cost, where each processing cost value is assigned or predetermined a weight. Here, different processing nodes 1 can be weighted with different weights, and / or different processing cost values of the processing node 1 can be weighted with different weights. Then, a solution can be selected from the possible solutions, and this solution results in the minimum or maximum processing cost (optimization criterion).

[0044] The method is characterized in that it can manage a very complex topology of the processing device 12, that is, a very complex machine network diagram M, the processing device including a complex and variable processing sequence, and also including a transport path as follows, which has turns, branch tracks or freely selectable transport paths, and also including a large number of processing nodes 1. Therefore, it also deviates from the methods commonly used so far: the transport sequence in the processing device 12 always forms in a line. With the present invention, it is possible to more flexibly create a processing sequence F for manufacturing a product and especially to optimize it also in terms of certain criteria.

[0045] For the purpose of association, the association unit 10 can also consider information in the processing device 12 and / or the device controller 11, such as the current load or fault of the process node P or the transport node T.

[0046] The processing sequence F for manufacturing a product can be created once and subsequently implemented on the processing device 12 using the device controller 11. However, it is also conceivable to re-determine the processing sequence F or the remaining part of the processing sequence as described after each processing node 1 in the machine network diagram M, i.e., after the processing process step in the processing node 1 has ended or already during the processing process step in the processing node 1. In this way, it is possible to react in real time to the changed states of the participating processing nodes 1 (process nodes P or transport nodes T) of the machine network diagram M. If, for example, the load on the processing node 1 of the processing device 12 is too high, or if the processing node 1 fails, a bypass is automatically sought in this case in order to manufacture the product with the processing nodes 1 available in the processing device 12 using an adjusted processing sequence F. Thus, in the event of a fault, for example, the processing node 1 can be bypassed, so that no downtime occurs during processing.

[0047] using Figure 9 For another example, the correlation is illustrated. Again, a product synthesis diagram S as in Figure 5 is used for manufacturing a package consisting of six labeled bottles. However, in this case the machine network diagram M is more complex and includes parallel processing stations. For example, there are two labeling stations (process nodes P1, P2). The two labeling stations receive unlabeled bottles from the same transport node T1 and labels from different transport nodes T2, T3. There are also two packaging stations (process nodes P3, P4), which receive empty packages from the respectively assigned transport nodes T5, T6. The transport node T4 connects all the process nodes P1, P2, P3, P4. Such a transport node T4 is, for example, a transport unit in the form of a long-stator linear motor with a turnout, which connects different transport lines of the long-stator linear motor. The transport node T4 also transports the completed package to the transport node T7, at which the completed package is removed from the processing device.

[0048] By configuring a suitable processing node 1 in the machine network diagram M for each operation node O of the product synthesis diagram S (shown by the association unit 10). For example, the operation source O1 (which represents the introduction of unlabeled bottles) is configured to the transportation node T1 of the machine network diagram M (using the transportation node to convey unlabeled bottles). The same applies to the operation node O2 and the transportation node T2 for conveying labels. However, instead of the transportation node T2, the transportation node T3 that can complete the same task can also be selected. For the labeling processing step, two processing nodes P1 and P2 are considered, and both of the two processing nodes can implement the processing step. However, only the processing node P2 can be selected because the processing node P1 cannot be reached due to the already selected transportation node T2, because the transportation node T2 and the processing node P are not connected by an edge and thus there is no transportation path between the two processing nodes. For the operation nodes O4 and O5, different processing nodes, namely the transportation nodes T5, T6 and the processing nodes P3, P4, can be selected again. However, if the transportation node T6 is selected, then it is preferable to select the processing node P4 because this constitutes the shortest transportation path (which can be mapped by, for example, the corresponding processing cost values of the transportation time or the transportation path). Although the processing node P3 can also be used, but because the processing node is reachable from the transportation node T6 via the transportation node T4, it only means a longer transportation path and a longer transportation time. If the processing costs are determined for these two possibilities, then it is very likely to select the processing node P4. The result of the association is, for example, the processing sequence F shown in Figure 10 . This example illustrates that different processing sequences F can be given in the machine network diagram M for a product synthesis diagram S. Similarly, the processing sequence F can be changed in real time. If, for example, the processing node P4 fails or the load of the processing node P4 is too high, then the operation nodes O4, O5 can be mapped to the transportation node T5 and the processing node P3, for example. This can also be done for each individual product, whereby the product can be processed very flexibly.

[0049] However, the present invention can also be used for the simulation of the processing equipment 12, for example, in order to redesign the processing equipment 12, to optimize it by replacing the processing node 1, to detect whether a product can be manufactured in the existing processing equipment 12, to determine the cost of manufacturing a product in the processing equipment 12, etc. For the simulation, only the machine network diagram M and the product synthesis diagram S are required. The determined processing sequence F is not implemented on the real processing equipment 12 here and does not produce a real product, but produces a virtual product. Alternatively, the processing equipment can also be simulated (so-called digital twin) and the determined processing sequence F can be implemented on the simulated processing equipment. For this purpose, the processing nodes 1 participating in the manufacture of the product are mapped in the simulation by a suitable mathematical simulation model, and the mathematical simulation model imitates the real behavior of the processing node 1.

[0050] Therefore, the simulation can be used to manufacture virtual products in a virtual, simulated processing device. Here, the process is the same as in the case of manufacturing real products in a real processing device.

Claims

1. A method for manufacturing a product in a processing device (12), wherein, The product is processed in a plurality of processing stations in a processing device (12) and the product is moved between successive processing stations by means of a transport unit, characterized in that the processing device (12) is modeled by means of a machine network diagram (M), the machine network diagram (M) modeling the processing device (12) as a network of processing nodes (1), and the processing nodes (1) representing processing stations for carrying out processing process steps and / or transport units for moving the product, and the individual processing nodes (1) in the machine network diagram (M) are connected by edges, the product to be manufactured is modeled by means of a product synthesis diagram (S), the product synthesis diagram (S) modeling the hierarchical structure of the product in the form of a tree of individual product synthesis nodes (2), and a product synthesis node (2) constitutes an operation node (O) or a product node (I), on which the product is changed by means of a processing process step, and the individual product synthesis nodes (2) in the product synthesis diagram (S) are connected by edges, the machine network diagram (M) and the product synthesis diagram (S) are software-based interrelated to form a processing sequence (F) in such a way that for each operation node (O) of the product synthesis diagram (S) a processing node (1) of the machine network diagram (M) is selected which carries out the processing process step to be carried out on the respective operation node (O), each processing node (1) of the processing sequence (F) is connected by at least one edge to at least one further processing node (1), and the processing sequence (F) is carried out by means of a device controller (11) for manufacturing the product on the processing device (12).

2. The method according to claim 1, wherein All possible mappings of the product synthesis diagram (S) onto the machine network diagram (M) are determined software-based and one possible mapping is selected as the processing sequence (F).

3. The method according to claim 2, wherein An optimization criterion is defined for the processing sequence (F) and the processing sequence (F) which best satisfies the optimization criterion is selected as far as possible.

4. The method according to claim 3, characterized in that, A processing cost value is assigned to each processing node (1) of the machine network diagram (M) and the processing cost is determined as the optimization criterion, the processing cost being the sum of the processing cost values of the individual processing nodes (1) participating in the processing sequence (F).

5. The method according to claim 4, characterized in that, The processing cost value is time or a defined cost value.

6. The method according to claim 4, wherein The weighted sum of the processing cost values of the individual processing nodes (1) of the processing sequence (F) is determined as the processing cost.

7. The method according to any one of claims 1 to 6, characterized in that, During or after carrying out the processing process step on the processing node (1) of the processing sequence (F), the processing sequence (F) for the product is re-determined by re-relating the product synthesis diagram (S) to the machine network diagram (M), and the subsequent manufacture of the product is carried out with the new processing sequence (F).

8. The method according to claim 7, wherein The processing sequence (F) for the product is re-determined during or after carrying out the processing process step on each processing node (1) of the processing sequence (F).

9. Processing equipment for manufacturing products, wherein, There is provided a device controller (11), which controls a plurality of processing stations and a transport unit of a processing device (12) for manufacturing a product. It is characterized in that the processing device (12) is modeled by a machine network diagram (M), the machine network diagram (M) models the processing device (12) as a network of processing nodes (1), and the processing nodes (1) represent processing stations for implementing processing process steps and / or transport units for moving the product, and each processing node (1) in the machine network diagram (M) is connected by an edge. The product to be manufactured is modeled by a product synthesis diagram (S), the product synthesis diagram (S) models the hierarchical structure of the product in the form of a tree of product synthesis nodes (2), and a product synthesis node (2) is an operation node (O) or a product node (I). On the operation node (O), the product can be changed by processing process steps, and each product synthesis node (2) in the product synthesis diagram (S) is connected by an edge. There is provided an association unit (10), which software-interrelates the machine network diagram (M) and the product synthesis diagram (S) into a processing sequence (F). The method is such that the association unit (10) selects, for each operation node (O) of the product synthesis diagram (S), a processing node (1) of the machine network diagram (M), and the processing node implements the processing process step to be implemented on the corresponding operation node (O). Each processing node (1) of the processing sequence (F) is connected by at least one edge to at least one other processing node (1), and the device controller (11) controls the processing device (12) to implement the processing sequence (F) for manufacturing the product on the processing device (12).

Images