Device and computer-implemented method for analyzing, in particular optimizing or controlling, a sequence at stations in a work system, in particular in a production facility

Abstract

The invention relates to a device (102) and a computer-implemented method for analyzing, in particular optimizing or controlling, a sequence at stations (104-1,..., 104-n) in a work system (103), in particular in a production facility, in order to determine a bottleneck, characterized in that the sequence is carried out with a data structure and is in particular controlled on the basis of the data structure, wherein: the data structure comprises blocks; the blocks each encode a sequence type (200) in a data field and are each associated with a duration for a part of the sequence; the sequence type (200) defines a process at or on the station (104-1,..., 104-n); the process either is to be carried out cyclically and manually and is time-determining for the sequence of the machine and a user of the machine (204), or is to be carried out cyclically and manually and is not time-determining for the sequence of the machine and is time-determining for the sequence of the user (206), or is to be carried out cyclically and automatically and is time-determining for the sequence of the machine and is not time-determining for the sequence of the user (208), or is to be carried out periodically in a plurality of cyclic sequences and automatically and is not time-determining for the sequence of the user (210), or is to be carried out periodically in a plurality of cyclic sequences and manually and is time-determining for the sequence of the machine and of the user (212), or is to be carried out periodically in a plurality of cyclic sequences and manually and is not time-determining for the sequence of the machine (214); and, on the basis of the durations associated with blocks for processes that are time-determining, a bottleneck is determined, or a bottleneck modified with additions or factors is determined.

Description

[0001] Description

[0002] title

[0003] Device and computer-implemented method for analysis, in particular for optimising or controlling a process at stations of a work system, in particular in a production facility

[0004] State of the art

[0005] The invention relates to a device and a computer-implemented method for analyzing, in particular for optimizing or controlling, a process at stations of a work system. The work system can be set up in particular in a factory, a plant, or generally in a production facility. Furthermore, the invention relates to a data structure for the method and a work system set up for the process.

[0006] Disclosure of the invention

[0007] A computer-implemented method for analyzing, in particular for optimizing or controlling, a process at stations of a work system, in particular a production facility, provides that the process is carried out using a data structure and is controlled in particular depending on the data structure, wherein the data structure comprises modules, wherein the modules each encode a process type in a data field and are associated with a time duration for a part of the process, wherein the process type defines a process at or on the station, wherein the process is either to be carried out cyclically and manually and is time-determining for the process of the machine and a user of the machine, or is to be carried out cyclically and manually and is not time-determining for the process of the machine and is time-determining for the process of the user, or is to be carried out cyclically and automatically and is time-determining for the process of the machine and is not time-determining for the process of the user,or is to be executed periodically after several cyclical processes and automatically and is not time-determining for the user's process, or is to be executed periodically after several cyclical processes and manually and is time-determining for the machine and user's process, or is to be executed periodically after several cyclical processes and manually and is not time-determining for the machine's process, whereby a bottleneck is determined depending on the time durations associated with building blocks for processes that are time-determining, or a bottleneck modified with surcharges or factors is determined.

[0008] The stations, types of processes and durations taken into account for the procedure are based in particular on real technical conditions, in particular on the actual technical conditions of the production facility and / or the work system.

[0009] Preferably, the time durations are entered and associated with building blocks in a first level of a database structure, wherein building blocks of a second level of the database structure are associated with a total time duration determined as a function of the time durations associated with the building blocks of the first level that are assigned to the same station and the same process type, and wherein building blocks of a third level of the database structure are associated with a total time duration determined as a function of the time durations associated with the building blocks of the second level that are assigned to the same station or the same user, wherein building blocks of a fourth level of the database structure are associated with a result of a comparison of the total time durations, in which a total time duration associated with a building block of the third level that is assigned to a user and a total time durationwhich is associated with a third-level building block assigned to a station, or in which two total durations are compared, each associated with a third-level building block without a user or user loop assignment, and the bottleneck is determined based on the results associated with the fourth-level building blocks. The result of the respective comparison preferably includes the largest total duration. This is more relevant with regard to the bottleneck than other total durations.

[0010] The bottleneck preferably encompasses the largest total time period. This determines a frequency. To achieve the highest possible frequency, the smallest possible bottleneck is sought.

[0011] It can be provided that the building blocks each comprise the level to which the building block is assigned in the database structure in a data field, whereby the building blocks of the first level, the second level, the third level, or the fourth level are recognized depending on the data field that contains the level. The building blocks of the first level are entered, and the building blocks are automatically recognized in the data field that contains the level and processed accordingly.

[0012] It can be provided that the modules each comprise a data field that identifies a station, whereby the modules assigned to the same station are determined depending on the data field that identifies the station. The modules are automatically recognized by the data field that identifies the station and processed accordingly.

[0013] To optimize or control the process, it may be provided that at least part of the process is changed to reduce the bottleneck. This automatically adapts the process. For example, changing part of the process may include a change in the work sequence, a change in one or more work positions, a change in the allocation of production resources to stations, and / or a change in the users for one or more work processes or parts thereof, in particular a change in the assignment of users to stations or, in particular, to manual parts of work processes.

[0014] To optimize or control the process, it can be provided that an actual bottleneck is determined based on the actual total durations, i.e., the measured durations. If the actual bottleneck is greater than the bottleneck, at least part of the process is modified to reduce the actual bottleneck. This automatically adapts the process to the actual bottleneck. This has the advantage that the method can be implemented, particularly in real time, for monitoring the process at the stations.

[0015] Preferably, the work system is controlled with a process that is optimized depending on the bottleneck.

[0016] A device for analysis, in particular for optimizing or controlling a process at stations of a work system, comprises at least one processor and at least one memory, wherein the at least one memory comprises instructions executable by the at least one processor, upon execution of which instructions by the at least one processor the device carries out the method, and wherein the at least one processor is designed to execute the instructions.

[0017] A computer program comprises instructions that can be executed by a computer and, when executed by the computer, the method is carried out.

[0018] A work system, in particular of a production facility, comprises stations and is configured for a process at the stations optimized according to a method described above. Preferably, the work system is configured to be controlled based on the optimized process. According to one embodiment, the work system further comprises the above-described device for analyzing, in particular for optimizing or controlling a process at stations of the work system.

[0019] Further advantageous embodiments can be found in the following description and the drawing. The drawing shows:

[0020] Fig. 1 is a schematic representation of a device for analyzing a process at stations of a work system,

[0021] Fig. 2 is a schematic representation of the flow types of the process,

[0022] Fig. 3 a schematic representation of a data structure for analyzing the process,

[0023] Fig. 4 is a schematic representation of levels in a database structure, Fig. 5 is an exemplary result of a method for analyzing the process, Fig. 6 is a flow chart with steps of the method for analyzing the process.

[0024] Figure 1 schematically illustrates a device 102 for analyzing a process at stations 104-1, ..., 104-n of a work system 103. The work system 103 with the stations 104-1, ..., 104-n can be set up, for example, in a production facility, i.e., a plant or factory.

[0025] The device 102 includes at least one processor 106 and at least one memory 108.

[0026] The at least one memory 108 includes instructions executable by the at least one processor 106. The at least one processor 106 is configured to execute the instructions.

[0027] The device 102 is designed to carry out a method for analyzing the sequence when the instructions are executed by the at least one processor 106.

[0028] In the example, the work system 103 comprises several stations 104-1, ..., 104-n. A station can comprise a machine or a manual workstation.

[0029] In the example, the process includes various process types.

[0030] Figure 2 schematically illustrates the sequence types 200 for parts of the process. The sequence types 200 can be executed either manually by a user or automatically by a machine.

[0031] A process type 200 defines a process that a user or a machine performs that takes place at or on the respective station 104-1, ..., 104-n.

[0032] In the example, the following processes and time relationships are provided for the machine and the user at the station level. The assignment of time-determining and non-time-determining refers only to the corresponding part of the process that the user performs at a station, or to the part of the process that runs on the machine at that station. The time relationships for the entire workstation 103 are determined automatically via logical linking and aggregation.

[0033] 204 cyclical and manual and time-determining for the machine and the user,

[0034] 206 cyclical and manual and not time-determining for the machine's operation and time-determining for the user's operation,

[0035] 208 cyclical and automatic and time-determining for the machine's operation and not time-determining for the user's operation,

[0036] 210 periodically after several cyclical processes and automatically and time-determining for the process of the machine and not time-determining for the process of the user,

[0037] 212 periodically after several cyclical processes and manually and time-determining for the process of the machine and the user,

[0038] 214 periodically after several cyclical processes and manually and time-determining for the user's process and not time-determining for the machine's process.

[0039] 216 Path of the user between the stations 104-1 , ... , 104-n, time-determining for the user's process and not time-determining for the machine's process.

[0040] The example shows two stations 104-1, ..., 104-n, which are operated by one user. Not every station 104-1, ..., 104-n needs to be suitable or intended for each of the process types 200. One user can be provided for each station 104-1, ..., 104-n, i.e., process type 216 (Path) is omitted.

[0041] In the example, a distinction is made between cyclic processes 218 and periodic processes 220.

[0042] Not every station 104-1, ..., 104-n must be intended or suitable for cyclic operations 218 or periodic operations 220.

[0043] Examples of process types: An example of a cyclic process 218 is the installation of a steering nut in each steering assembly being machined on the machine. An example of a periodic process 220 is the replacement of a crate that initially contains 100 steering nuts, e.g., after 100 steering assembly processes have been completed.

[0044] An example of a periodic process 210 that runs automatically is the automatic dressing of a wheel.

[0045] An example of a periodic process 212 is manual dressing of a wheel.

[0046] An example of a periodic process 214 is manually preparing a tool outside the machine.

[0047] An example of a manual cyclic process 204 is inserting a part into a machine. This means the machine must rest for a certain period of time, then the machine is started, for example, by pressing a button.

[0048] An example of a manual cyclic operation 206 is picking up a part from outside the machine. This means the machine could continue running during this manual operation.

[0049] An example of an automatically executed cyclic operation 208 is an automatic process that the machine executes automatically. During the automatic process, the station operator can perform manual operations that do not require machine intervention in parallel with the automatic process.

[0050] The total time duration of the station is the sum of the time durations of the processes 204, 208, 210 and 212 that determine the time for the machine to run and is determined for each station 104-1 - 104-n.

[0051] A user can operate one or more stations 104-1, ..., 104-n in the work system. If more than one station 104-1, ..., 104-n is assigned to the user, this is referred to as a user loop in the work system. The total time spent by a user with only one assigned station is the sum of the time spent by the user's time-determining operations 204, 206, 212, and 214.

[0052] The total time duration of the user with more than one assigned station, ie the total time duration of the user loop, is the sum of the time durations of the processes 204, 206, 212 and 214 that determine the time for the user across all stations 104-1 - 104-n assigned to him, including the time durations of the paths 216 between the stations 104-1 - 104-n assigned to the user.

[0053] The total duration of work system 103 is the largest value from the comparison of the total duration of stations 104-1 - 104-n and the total duration of the users or user loops required for work system 103 across stations 104-1 - 104-n. This value is also referred to as the bottleneck and describes a frequency with which work system 103 can produce with respect to cyclical and periodic activities. The bottleneck multiplied by the number of required users or user loops results in the resource utilization, i.e., the personnel, required to achieve this frequency.

[0054] Figure 3 shows a schematic representation of a data structure 300 for analysis, in particular for controlling or optimizing the work system 103.

[0055] The data structure 300 comprises building blocks 302.

[0056] In the example, the blocks 302 include the following data fields:

[0057] 304 Standard Operating Plan,

[0058] 306 plan group counters,

[0059] 308 level,

[0060] 310 Classification,

[0061] 312 Cycle number (user / user loop)

[0062] 314 station number,

[0063] 316 station index,

[0064] 318 Working position, 320 Working sequence.

[0065] The defined data fields result in a unique coding for the identification and use of the 302 modules.

[0066] The data fields 304, standard work plan, and 306, task list group counter, encode the work system and time data variant to which the module 302 is assigned. For example, when creating a layout for the work system 103, the standard work plan 304 and the task list group counter 306 are automatically encoded in all modules 302 for this work system 103 by entering them once in the layout.

[0067] The data field 308 Level encodes which level the block 302 is assigned to.

[0068] The data field 310 Classification codes which process 204 to 216 the module 302 is assigned to.

[0069] The data field 312 cycle number encodes which user or user loop the block 302 is assigned to.

[0070] The data field 314 station number encodes which station 104-1, ..., 104-n the module 302 is assigned to.

[0071] The data field 316 station index encodes the station index to which the block 302 is assigned. The station index is used to assign a block 302 to one of several stations with the same processing process to reduce the cycle time.

[0072] The data field 318, Work Position, encodes which work position in a station the module 302 is assigned to. The work position is used to distinguish between different work positions within a station, if necessary.

[0073] In the example, a module 302 is assigned to each station 104.1 - 104.n of the workstation 103 for each process type. Whether a module 302 is used at a station or not is coded in the example by assigning a time duration to a used module 302 and no time value to an unused module 302. The example provides for a station to be created in the database structure, and the modules 302 to be automatically assigned to the station.

[0074] Data field 320 encodes the position in a processing or execution sequence to which block 302 is assigned. For example, block 302 assigned to the user who inserts the part is arranged before block 302 assigned to the user who removes the part.

[0075] Figure 4 shows a schematic representation of levels in the database structure.

[0076] The following levels are planned:

[0077] First level 402, second level 404, third level 406, fourth level 408, fifth level 410, sixth level 412.

[0078] A building block 302 assigned to the first level 402 is associated with a time duration of a process of a process type of a station 104-1, ..., 104-n, ie a part of the processes on the station 104-1, ..., 104-n.

[0079] A module 302 assigned to the second level 404 is associated with a total duration of similar sequence types of a station 104-1, ..., 104-n in a cycle.

[0080] A building block 302 assigned to the third level 406 is associated with a total time duration of a user or user loop or the total time duration of a station in the cycle. A building block 302 assigned to the fourth level 408 is associated with a result of a comparison between the total time duration of a station 104-1, ..., 104-n associated with a building block 302 assigned to the third level 406 and a total time duration of a user or user loop associated with a building block 302 assigned to the third level 406.

[0081] A building block 302 assigned to the fifth level 410 is associated with the bottleneck. The bottleneck is the result of an evaluation of the results of the comparisons associated with the building blocks 302 assigned to the fourth level 408.

[0082] A building block 302 assigned to the sixth level 412 is associated with the bottleneck modified by surcharges or factors.

[0083] In Figure 5, the process assignment of the individual stations 104-1,..., 104-n and users or user loops is graphically represented as an example for the work system 103 using the described method.

[0084] Figure 5 shows bars representing a time duration and total time duration for various work positions p and station indices i and m. In Figure 5, these are displayed in pim format, where the numerical values ​​of p, i, and m correspond to the values ​​in the corresponding data fields of the evaluated blocks 302. This means that the blocks 302 are associated with the time duration or the total time duration.

[0085] Figure 5 shows planned durations of the time-determining manual processes 502 to be executed periodically at station 104-1,..., 104-n, the time-determining manual processes 504 to be executed cyclically at station 104-1,..., 104-n, the time-determining automatic processes 506 to be executed cyclically at station 104-1,..., 104-n, the total duration of the user or user loops for the stations 508 assigned to him, and a separately recorded actual total duration 510 (automatically determined, i.e. measured, from machine and equipment data). A waiting time 513 of the user or user loop or an idle time 512 of a station 104-1,...,104-n is caused by a bottleneck 514, which in the example occurs at a station with the longest total time duration.

[0086] Figure 6 shows a flow chart with steps of the process.

[0087] The procedure is based on the data structure 300 and the database structure.

[0088] The data structure 300 comprises building blocks 302 of the first level 402. The building blocks 302 of the first level 402 each encode the process type 200 in a data field 310 and are associated with a time duration for a portion of the process. The time duration associated with a building block 302 indicates how long the process encoded with the process type 200 lasts.

[0089] The building blocks 302 each comprise in a data field 308 the level to which the building block 302 is assigned in the database structure.

[0090] The method includes a step 602.

[0091] In step 602, the building blocks 302 associated with the time periods are recorded in the first level 402 of the database structure. In the first level 402, the data fields of the building blocks 302 assigned to the first level 402 are populated for each station 104-1, ..., 104-n, and the routes 216. The input is made, for example, at a database interface.

[0092] In the example, the cyclic and periodic time periods are entered exclusively in step 602 or in the first level 402.

[0093] The method includes a step 604.

[0094] In step 604, the time durations for each process type 200 are aggregated for each station. In the example, the time durations associated with the modules 302 from the first level 402 that are assigned to the same station and the same process type 200 are aggregated. This means that the processes of a station 104-1, ..., 104-n are aggregated and recorded in the second level 404 of the database structure. The method includes a step 606.

[0095] In step 606, the time-determining modules 302 of the stations 104-1,..., 104-n assigned to the user or user loop and the associated routes from the second level 404 are aggregated for the user or user loop, and a total time duration per user or user loop is determined.

[0096] The building blocks 302 associated with the user's total time duration are recorded in the third level 406 of the database structure.

[0097] In step 606, the time-determining building blocks 302 of the station from the second level 404 are aggregated for each station 104-1,... 104-n and a total time duration for each station 104.1,... 104-n is determined.

[0098] The building blocks 302 associated with the total duration of stations 104.1,..., 104-n are recorded in the third level 406 of the database structure. The building blocks 302 of the third level 406 can be determined with or without user or user loop assignment. Building blocks 302 for processes that run purely automatically are determined without user or user loop assignment.

[0099] The method includes a step 608.

[0100] In step 608, for each user or user loop and each station, the result of a comparison of a total time duration associated with a building block 302 of the third level 406 assigned to the respective user or user loop and a total time duration associated with a building block 302 of the third level 406 assigned to the respective station is determined. Additionally, a result of a comparison of the total time durations associated with a building block 302 of the third level 406 without a user or user loop assignment is determined.

[0101] The building blocks 302 with the largest total duration determined by comparing each user or user loop and the station 104.1,..., 104-n assigned to it are recorded in the fourth level 408 of the database structure. The building blocks 302 associated with the largest total duration of the total durations determined by comparing the total durations of all stations 104.1,..., 104-n without user or user loop assignment are recorded in the fourth level 408 of the database structure.

[0102] The method includes a step 610.

[0103] In step 610, the result of a comparison of the total time durations associated with the building blocks 302 from step 608 is determined.

[0104] A building block 302 with the largest total duration, which is determined by comparing the total durations of the building blocks 302 from step 608, is recorded in the fifth level 410 of the database structure.

[0105] The result from step 610 corresponds to the bottleneck of the work system 103 for cyclic and periodic content. The bottleneck can be defined by one or more building blocks 302 associated with the same total time duration. The difference between the bottleneck and the total times of the remaining stations 104.1,...,104.n corresponds to the idle time of a machine at a station 104-1,...,104-n or the waiting time of a user at one or more stations 104-1,...,104-n.

[0106] The method includes a step 612.

[0107] In step 612, the bottleneck modified with surcharges or factors is determined. This means that the bottleneck determined in step 610 is modified with surcharges or factors.

[0108] For the work system 103, a building block 302 is determined which is assigned to the sixth level 412 and which is associated with the modified bottleneck.

[0109] The surcharges or factors take into account, for example, specified distribution times.

[0110] The method includes a step 614. In step 614, for example, the bottleneck is checked or investigated to determine whether or how the bottleneck can be reduced. For example, a building block 302 associated with the bottleneck is identified, and parts of the process underlying the building block 302 are optimized to reduce the bottleneck.

[0111] In step 614, for example, a leveling of the waiting times is investigated to determine whether and how the manual parts of the process can be distributed among fewer users in order to reduce the waiting times to a minimum.

[0112] In step 614, the process for reducing the bottleneck and leveling the waiting times is optimized in order to determine a number of users or machines and an assignment of users to stations that achieve a desired, e.g., as high as possible, in particular highest, frequency of the work system 103 with a desired, e.g., as low as possible, in particular a lowest, number or a minimum number of users.

[0113] The selection is made, for example, at the database interface. It can be provided that the database interface, as shown in Figure 5, visualizes the durations of the individual periods and the separately recorded actual total duration 510.

[0114] In the example, machine and resource data are automatically recorded, i.e. measured, at the stations, and the actual total time durations 510 are automatically determined from the machine and resource data.

[0115] Depending on the actual total durations 510, an actual bottleneck is identified, in the example the largest of the actual total durations 510.

[0116] In the example, if the actual bottleneck is larger than the bottleneck, the process is changed to reduce the actual bottleneck.

[0117] The method comprises a step 616. In step 616, the workstation 103 is controlled using the optimized process. The process is controlled based on a data structure 300. In the example, the modules 302 from the first level 402 define the intended process. The optimized process is used, for example, as a basis for repeating the process to identify a bottleneck and optimize the process again. The optimized process is executed to determine the actual bottleneck on the workstation 103.

Claims

Claims 1 . Computer-implemented method for analysis, in particular for Optimization or control of a process at stations (104-1, 104-n) of a work system (103), in particular a production facility, in order to determine a bottleneck, characterized in that the process is carried out using a data structure (300) and is controlled (616) in particular as a function of the data structure (300), wherein the data structure (300) comprises modules (302), wherein the modules (302) each encode a process type (200) in a data field (310) and are associated with a time duration for a part of the process, wherein the process type (200) defines a process at or on the station (104-1, ..., 104-n), wherein the process is either to be carried out cyclically and manually and is time-determining for the process of the machine and a user of the machine (204), or is to be carried out cyclically and manually and is not time-determining for the process of the machine and is time-determining for the process of the user (206),or is to be executed cyclically and automatically and is time-determining for the machine's operation and not time-determining for the user's operation (208), or is to be executed periodically after several cyclical operations and automatically and is not time-determining for the user's operation (210), or is to be executed periodically after several cyclical operations and manually and is time-determining for the machine's and user's operation (212), or is to be executed periodically after several cyclical operations and manually and is not time-determining for the machine's operation (214), wherein a bottleneck is determined (610) or a bottleneck modified with surcharges or factors is determined (612) depending on the time durations associated with building blocks (302) for operations that are time-determining.

2. Method according to claim 1, characterized in that the time periods are entered and associated (602) with building blocks (302) in a first level (402) of a database structure, wherein building blocks (302) of a second level (404) of the database structure are associated (604) with a total time duration that is determined depending on the time durations associated with the building blocks (302) of the first level (402) that are assigned to the same station and the same process type (200), and wherein building blocks (302) of a third level (406) of the database structure are associated (606) with a total time duration that is determined depending on the time durations associated with the building blocks (302) of the second level (404) that are assigned to the same station or the same user, wherein building blocks (302) of a fourth level (408) of the database structure are associated with a result of a comparison of the total time durations, in which a total time duration that is associated with a building block (302) of the third level (406) that is assigned to a user and a total time duration that is associated with a building block (302) of the third level (406) that is assigned to a station,are compared or in which two total time periods are compared, each associated with a building block (302) of the third level (406) without user or user loop assignment, and wherein the bottleneck is determined (610) depending on the results associated with the building blocks of the fourth level (408).

3. Method according to claim 2, characterized in that the result of the respective comparison comprises the largest total time period.

4. Method according to claim 3, characterized in that the bottleneck comprises the largest total time period.

5. Method according to one of claims 2 to 4, characterized in that the building blocks (302) each comprise in a data field (310) the level to which the building block (302) is assigned in the database structure, wherein the building blocks (302) of the first level (402), the second level (404), the third level (406) or the fourth level (408) are recognized depending on the data field (319) comprising the level.

6. Method according to one of claims 2 to 5, characterized in that the modules (302) each comprise a data field (314) which identifies a station (104-1, ..., 104-n), wherein the modules (302) which are assigned to the same station are assigned, depending on the data field (314) that identifies the station (104-1, ..., 104-n).

7. Method according to one of the preceding claims, characterized in that at least part of the process is changed to reduce the bottleneck (614).

8. Method according to one of the preceding claims, characterized in that an actual bottleneck is determined as a function of actual total time periods (510), wherein if the actual bottleneck is greater than the bottleneck, at least part of the process is changed to reduce the actual bottleneck (614).

9. Method according to one of the preceding claims, characterized in that the process is optimized depending on the bottleneck and preferably the work system (103) is controlled with the process optimized depending on the bottleneck (616).

10. Device (102) for analysis, in particular for optimizing or controlling a process at stations (104-1, ..., 104-n) of a work system (103), in particular of a production site, in order to determine a bottleneck, characterized in that the device (102) comprises at least one processor (106) and at least one memory (108), wherein the at least one memory (108) comprises instructions executable by the at least one processor (106), upon execution of which instructions by the at least one processor (106), the device carries out a method according to one of claims 1 to 9, and wherein the at least one processor (106) is designed to execute the instructions.

11. Data structure (300) for analysis, in particular for optimization or control (616) of a process at stations (104-1, ..., 104-n) of a work system (103), in particular of a production site, in order to determine a bottleneck, characterized in that the data structure (300) comprises modules (302), wherein the modules (302) each code a process type (200) in a data field (310) and are associated with a time duration for a part of the process, wherein the process type (200) defines a process at or on the station (104-1, ..., 104-n), wherein the process is to be carried out either cyclically and manually and for the process the machine and a user of the machine is time-determining (204), or is to be executed cyclically and manually and is not time-determining for the operation of the machine and is time-determining for the operation of the user (206), or is to be executed cyclically and automatically and is time-determining for the operation of the machine and is not time-determining for the operation of the user (208), or is to be executed periodically after several cyclical operations and automatically and is not time-determining for the operation of the user (210), or is to be executed periodically after several cyclical operations and manually and is time-determining for the operation of the machine and the user (212), or is to be executed periodically after several cyclical operations and manually and is not time-determining for the operation of the machine (214), wherein depending on the time periods associated with modules (302) for operations that are time-determining,a bottleneck is determined (610) or a bottleneck modified with surcharges or factors is determined (612).

12. Work system (103), in particular of a production facility, comprising stations (104-1, ..., 104-n), characterized in that the work system (103) is set up for a process at the stations (104-1, ..., 104-n) optimized according to a method of claims 1 to 9.

13. A computer program, characterized in that the computer program comprises computer-executable instructions, the execution of which by the computer results in a method according to one of claims 1 to 9.

Images