EP1591024B2 - Method and system to follow up product data of a mass flow of products in a transport and storage section in the tobacco processing industry - Google Patents

Abstract

The method involves producing product data sets, where each set corresponds to approximately equal portions of a product mass flow entering a transport section (12). The product data sets are written into corresponding memory units of a first-in-first-out stack memory. The product data sets corresponding to the product mass flow emerging from the transport section are read from the memory. An independent claim is also included for a system for tracking product data for a product mass flow in a transport storage section of a tobacco-processing industry.

Description

The invention relates to a method and a system for tracking product data, for example quality data, brand information, production machine identification, production time, in a transport storage section of the tobacco processing industry.

From the DE 102 16 069 A1 For example, there is known a method and apparatus for tracking product data of individual products in a tobacco processing machine that operates on a particular machine cycle, ie processes a certain number of individual products per minute. The assignment of the product data to the individual products is based on the exact knowledge of the machine cycle and the distance traveled by the product in the machine. This method can not be transferred to a product mass flow with a plurality of disordered individual products, such as in a conveyor line between a cigarette production machine and a packing machine, since the allocation of product data is lost to the individual products. This problem is compounded when the path length in the transport storage path is variable, such as when using a variable cigarette storage.

The object of the invention is to provide a method and a system for tracking product data of a product mass flow in a transport storage line of the tobacco processing industry.

The invention solves this object by a method having the features of claim 1 and by a system having the features of claim 12. The invention is particularly based on the virtual portioning of the product mass flow and the generation and storage of product data records that correspond to the individual product portions. By means of this subdivision, tracking according to the invention via a product portion of averaged product data is possible.

The data memory has a memory input and a memory output, wherein the product data records are written into the memory means via the memory input and stored there in a fixed order, and the product data records written in the memory means in an order corresponding to the order of the corresponding product portions in the transport memory segment , are read out of the storage means via the output.

The transport storage line is a system for automatically transporting and / or storing the product mass flow. Preferably, the data storage logically maps the transport storage path. If, for example, the transport storage path comprises a pure transport path or a FIFO storage in which the product mass flow enters an entrance and exits at an exit in the same sequence, the data storage expediently comprises a corresponding FIFO data storage (first in-first out principle). , If, for example, the transport storage section comprises a bag store into which the product mass flow enters and out of which the product mass flow emerges in the reverse order, the data store expediently comprises a corresponding FILO or LIFO data memory (first in-last out or last in-first) out principle).

A preferred implementation of a FIFO data memory is a ring memory, each with a movable read and write pointer. Preferably, their position is moved after writing a product data record or after the emergence of a product portion of the transport path to a logically adjacent memory unit.

Further preferably, the position of the read or write pointer is held in the event of an interruption of the product mass flow entering the transport path or the product mass flow exiting the transport path.

Another preferred implementation of a FIFO data memory is a FIFO stack (FIFO stack). Product data sets of product mass flow entering the transport path are written to the FIFO stack and product data sets of product mass flow exiting the transport path are read from the FIFO stack.

A preferred implementation of a FILO data memory is accordingly a FILO stack (FILO stack).

The invention is not limited to the aforementioned implementations of FIFO or FILO data memories. The use of, for example, shift registers is also encompassed by the invention.

The portioning is carried out in uniform lengths of the product mass flow in the transport direction, since this size is particularly easy to determine from the conveying speed. However, other types of portioning are also conceivable, for example in portions with an approximately equal number of individual products, or in portions of approximately the same weight.

Preferably, the length of the product portions is adjustable to allow for adaptation to different requirements. The product data sets are set up to store the length of the product portion in the transport direction. This can be expedient in particular for transport storage sections with several conveyor sections of different conveying speed, since the length of the product portions varies here. The product data sets are preferably set up for storing a product occupancy identifier, which indicates whether the transport segment corresponding to the product data record is occupied by product. This may be useful to mark a missing or otherwise occupancy of transport sections.

For detecting product mass flow entering or leaving the transport storage section, the product data tracking system preferably comprises corresponding input or output sensors.

In the case of a plurality of conveying sections or conveying devices in the conveying path, it may be expedient to associate a partial data store with each conveying section or each conveying device. For example, each sub-store may be a ring store with a read and write pointer as described above. Each sub-memory can for example also be designed as a FIFO or FILO stack.

Fig. 1:

eine schematische Übersicht eines Produktdatenverfolgungssystems für eine Förderstrecke zwischen einer Zigarettenproduktionsmaschine und einer Packmaschine;

Fig. 2:

eine schematische Darstellung eines Produktdatensatzes;

Fig. 3A:

eine schematische Darstellung eines durch die Transportstrecke transportierten Zigarettenmassenstroms zu unterschiedlichen Zeitpunkten;

Fig. 3B:

eine schematische Darstellung eines Ringspeichers als Datenspeicher zu den Zeitpunkten gemäß Fig. 3A; und

Fig. 3C:

eine schematische Darstellung eines FIFO-Stapelspeichers als Datenspeicher zu den Zeitpunkten gemäß Fig. 3A.

Further advantageous features will become apparent from the dependent claims and the following description of advantageous embodiments with reference to the accompanying drawings. Show it:

Fig. 1:

a schematic overview of a product data tracking system for a conveyor line between a cigarette production machine and a packing machine;

Fig. 2:

a schematic representation of a product data record;

Fig. 3A:

a schematic representation of a transported through the transport path cigarette mass flow at different times;

Fig. 3B:

a schematic representation of a ring memory as a data store at the times according to Fig. 3A ; and

3C:

a schematic representation of a FIFO stack as data storage at the times according to Fig. 3A ,

From a cigarette production machine 10 cigarettes come out and are promoted in the form of a disordered cigarette stream 11 in the order of 1000 cigarettes per meter conveyor in the direction of arrow by means of a conveyor line 12 to a packing machine 13. The conveyor line 12 comprises a plurality of conveyor devices 14-17, which are drawn purely schematically as conveyor belts in the figures, but are by no means limited thereto. The conveyor line 12 includes, inter alia, a FIFO cigarette storage 16 with a conveyor 18 whose length is variable depending on the storage space, as in Fig. 1 indicated by dashed lines.

In the cigarette production machine 10, there are product data on the produced cigarettes, such as cigarette quality data, brand information, production machine 10 marking, date and time of production, etc. The product data tracking system comprises a data processing unit 20 having a control means 21 and a storage means 22. The control means 21 requests production data from the cigarette production machine 10 and periodically writes respective production data sets 30a, 30b, 30c, ... into the storage means 22. As a result, the product mass flow 11 is virtually divided into product portions 11a, 11b, 11c, ... divided as in Fig. 1 indicated by the dotted lines. If the conveying speed of the cigarette mass flow 11 through the conveying path 12 is, for example, 20 cm / s and the control means 21 writes production data requested once per second by the cigarette production machine 10 as production data records 30a, 30b, 30c,... Into the storage means 22, this corresponds to one virtual portioning of the product mass flow 12 in product portions 11a, 11b, 11c, ... with a certain length, in this example a portion length of 20 cm. The production data record expediently contains production data averaged over a storage period.

An exemplary format of a production record 30 is shown in FIG Fig. 2 shown. A production record 30 includes, for example, a field 31 for storing the cigarette brand, a field 32 for storing the label of the cigarette production machine 10, a field 33 for storing production date and time, a field 34 for storing the portion length (here in cm), and fields 35, 36, ... for storing cigarette quality data, such as mean weight, mean weight standard deviation, etc. The designation "1" in the product occupancy label field 40 indicates that the dataset 30 is a product portion and not, for example, an empty portion due to an interruption of the product mass flow 11 corresponds.

Preferably, a writing of production data sets in the storage means 22 takes place only when entering the conveyor line 12 product. For this purpose, the input sensor 23 is provided, which sends a corresponding signal to the control means 21 when entering into the conveyor line 12 to activate the writing or, in an interruption of entering the conveyor line 12 product mass flow, by means of a corresponding signal the Write interrupt.

In a preferred embodiment, the storage means 22 comprises at least one FIFO stack 26 in which the product data sets 30a, 30b, 30c,... Are stored in a fixed sequence in the form of a stack, wherein the product data sets 30a, 30b, first deposited on the stack, 30c, ... in the same order 30a, 30b, 30c, ... are read out again by ablation of the stack (FIFO principle).

At the exit-side end of the conveying path 12, an output sensor 24 is preferably provided in order to detect product emerging from the conveying path 12. When exiting from the conveyor line 12 product may, if necessary, the control means 21 read the associated product data set from the storage means 22 and provide for further use, for example, to the packing machine 13 transmit. This happens when using a FIFO stack simply by periodically removing a product record from the stack. Due to the defined order within the stack and the FIFO principle, it is ensured that the product data records 30a, 30b, 30c,... Are correctly assigned to the product portions 11a, 11b, 11c, 11d,... Exiting the conveyor line 12, and Although regardless of the respective length of the transport path 12, for example, in the cigarette memory 16. The readout period is suitably adapted to the exit period of the exiting product portions 11a, 11b, 11c, 11d, ..., with the length of the exiting product portions 11a, 11b, 11c , 11d, ... is related. With a constant length of the exiting product portions 11a, 11b, 11c, 11d,... And unchanged conveying speed over the entire transport path 12, the read-out period expediently corresponds to the storage period.

It is not necessarily a separate input sensor 23 may be provided. The information about entering the conveyor line 12 product may, for example, from one of the conveying section 12 upstream component, here the cigarette production machine 10 are related, if there is a product serving characterizing information. The same applies to the output sensor 24, which can be dispensable if the information characterizing a product portion, for example, from a downstream of the conveyor section 12 component, here the packing machine 13 can be obtained.

It is not excluded to write product data sets into the storage means 22 even if the product mass flow entering the conveyor line 12 is interrupted. These then expediently have a corresponding identification, for example "0", in a product occupancy identification field 40 of the production data record 30 (see FIG Fig. 2 ).

The Figs. 3A to 3C serve to explain the storage and read operation for a ring buffer and a FIFO stack. In Fig. 3A is shown schematically passing through a cigarette mass flow through the conveyor line 12, wherein of top to bottom consecutive times are shown. The vertical line "E" designates the input, the vertical line "A" the output of the conveying path 12. A product portion arranged above the line "E" is detected by the input sensor 23, a product portion arranged above the line "A" by the output sensor 24. In Fig. 3B in each case the corresponding memory state of a ring memory 25 in the memory means 22 for storing the product data sets 30a, 30b, 30c, ... is shown. In Fig. 3C Alternatively, the corresponding memory state of a FIFO stack 26 is shown in the storage means 22 for storing the product data sets 30a, 30b, 30c, ..., respectively. The memory units 25a, 25b, 25c,... Of the ring memory 25 and the memory units 26a, 26b, 26c,... Of the FIFO stack 26 respectively serve to store a product data record 30. The ring memory 25 has a write pointer 27 and a read pointer 28 on. The FIFO stack 26 has a stack input 50 and a stack output 51.

First, the embodiment according to Fig. 3B described with a ring buffer. At the time t1, for example when starting up the conveyor line 12, the product mass flow 11 has not yet entered the conveyor line 12. Write pointer 27 and read pointer 28 are set to the same memory unit 25a of the ring memory 25. At time t2, product entering the conveyor line 12 is detected by the input sensor 23, a corresponding product data record "1" is generated by the control means 21 and written into the memory unit 25a designated by the write pointer 27. Thereafter, the write pointer 27 is moved a storage unit while the read pointer 28 is held, since no emerging from the conveyor line 12 product is detected. At time t3, product entering the conveyor line 12 is detected by the input sensor 23, a corresponding product data record "2" is generated by the control means 21 and written into the memory unit 25b indicated by the write pointer 27. Thereafter, the write pointer 27 is again shifted by a memory unit. Similarly, at time t4, the product data set corresponding to the product portion "3" is written into the memory unit 25c designated by the write pointer 27, and the write pointer 27 is again shifted by a memory unit. At time t5, the input sensor 23 determines that the product mass flow 11 entering the transport path 12 is interrupted, and therefore interrupts the writing of product data records into the ring memory 25. At time t6, the output sensor 24 determines that product exits the transport path 12. Therefore, it reads the product data set "1", to which the read pointer 28 refers, from the ring memory 25, which the Exiting product serving "1" corresponds. Thereafter, the read pointer 28 is shifted by a memory unit. At time t7, the product record "4" is written in the memory unit 25d indicated by the write pointer 27, the write pointer 27 is shifted by one memory unit, and the product record "2" is read from the memory unit 25b indicated by the read pointer 28 and the read pointer 28 is read by a memory unit postponed. At time t8, the product data set "3" is read from the memory unit 25c identified by the read pointer 28 and the read pointer 28 is shifted by one memory unit. At time t9, the output sensor 24 detects that the product mass flow 11 exiting the transport path 12 is interrupted, and therefore interrupts the reading of product data sets from the ring memory 25. At time t10, the output sensor 24 determines that product exits the transport path 12. Therefore, the product record "4" is read from the memory unit 25d indicated by the read pointer 28, and the read pointer 28 is shifted by one memory unit. At time t11, the transport path 12 is empty and the ring memory 25 is in a state as at time t1. Since the write and read pointers 27, 28 are shifted along the memory units in this embodiment, the memory is designed as a ring memory 25, so that after a certain final memory unit, the write and read pointers 27, 28 are moved to an initial memory unit (see time t11 ).

In one embodiment with FIFO stack 26 according to FIG Fig. 3C the stack 26 is empty at time t1. The stack memory 26 has a stack input 50 and a stack output 51. At the time t2 incoming product in the conveyor line 12 is detected by the input sensor 23, a corresponding product data set "1" generated by the control means 21 and placed on the stack, that is written by the stack input 50 in the stack 26. At time t3, product entering the conveyor line 12 is detected by the input sensor 23, a corresponding product data record "2" is generated by the control means 21 and written to the stack memory 26. Analogously, the product data set "3" corresponding to the product portion "3" is written into the stack memory 26 at the time t4. At time t5, the input sensor 23 determines that the product mass flow 11 entering the transport path 12 is interrupted, and therefore discontinues writing product data records to the stack memory 26. At time t6, the output sensor 24 determines that product exits the transport path 12. Therefore, it takes the product record "1" from the stack, ie it reads the product record "1" the stack output 51 of the stack 26 from. At time t7, the product record "4" is written to the stack memory 26, and the product record "2" is read from the stack memory 26. At time t8, the product record "3" is read from the stack memory 26. At time t9, the output sensor 24 detects that the product mass flow 11 exiting the transport path 12 is interrupted, and therefore stops reading product data sets from the stack memory 26. At time t10, the output sensor 24 determines that product exits the transport path 12. Therefore, the product record "4" is read from the stack memory 26. At time t11, the transport path 12 and therefore also the stack memory 26 is empty.

Each conveyor 14-17 of the transport path 12 may be a separate partial data memory, in particular a ring memory 25 each with write and read pointers 27, 28, or in each case a FIFO (or optionally FILO) stack memory 26, be assigned. This makes it possible to transfer product data records from one partial store to a next partial store during the transfer of the corresponding product portions from one conveyor device to the next conveyor device. In particular, the product records can be changed appropriately when they are handed over. This can be advantageous in particular when different conveying speeds occur in the transport path 12.

In the example of Fig. 1 Let it be assumed that the conveyor 14 moves at 20 cm / s, the conveyor 15, however, at 25 cm / s and the product portions have a length L of 20 cm when entering the conveying path 12. After the transfer of the product portions from the conveyor 14 to the conveyor 15, they become longer and shallower due to the speed increase; more precisely, they have a length determined by the ratio of the conveying speeds of 25 cm. If, for example, by means of a transfer sensor between the conveyors 14, 15 it is determined that a certain product portion exits the conveyor 14, then the corresponding product data record is read from the conveyor 14 corresponding to the partial memory of the storage means 22, the length specification in box 34 of the product data set accordingly changed the ratio of the conveyor speeds and written the changed product data set in the sub-memory of the subsequent conveyor 15.

However, it is not absolutely necessary that in the case of a plurality of conveying devices 14-17 or when different conveying speeds occur in the transport path 12, each conveying device or each transport section is assigned its own partial data store. A single data store for the entire transport storage distance can then be sufficient.

Claims (19)

1. Method for tracking product data for a product mass flow emerging from a cigarette production machine (10) in the form of an unordered stream of cigarettes (11) in the order of 1,000 cigarettes per metre of transport section in a transport storage section of the tobacco-processing industry, wherein the stream of cigarettes (11) is conveyed by means of a transport section (12) to a packing machine (13), having the steps: production of product data sets (30a, 30b, 30c, ...) which each correspond to approximately equal portions (11a, 11b, 11c, ...) of the product mass flow entering the transport storage section and to approximately a certain length of the product mass flow (11) in the transport direction, writing the product data sets (30a, 30b, 30c, ...) into corresponding memory units (25a, 25b, 25c, ...; 26a, 26b, 26c, ...) of a data memory (25; 26) and reading the product data sets corresponding to the product mass flow emerging from the transport storage section (12) from the data memory (25; 26).
2. Product data tracking method according to claim 1, characterised in that the length of the product portions (11a, 11b, 11c, ...) is adjustable.
3. Product data tracking system according to claim 1 or 2, characterised in that the product data sets (30a, 30b, 30c, ...) have a field (34) for storing the length of the product portion (11a, 11b, 11c, ...) in the transport direction.
4. Product data tracking method according to one of claims 1 to 3, characterised in that the product data sets (30a, 30b, 30c, ...) have a field (40) for storing a product occupancy designator.
5. Product data tracking method according to one of claims 1 to 4, characterised in that the product data sets (30a, 30b, 30c, ...) are each written into a memory unit (25a, 25b, 25c, ...; 26a, 26b, 26c, ...) identified by a displaceable write pointer (27).
6. Product data tracking method according to claim 5, characterised in that after a product data set (30a, 30b, 30c, ...) has been written the write pointer (27) is shifted to a logically adjacent memory unit (25a, 25b, 25c, ...; 26a, 26b, 26c, ...).
7. Product data tracking method according to claim 5 or 6, characterised in that in the event of an interruption of the product mass flow (11) entering the transport storage section (12) the write pointer (27) is held in position.
8. Product data tracking method according to one of claims 1 to 7, characterised in that the product data sets (30a, 30b, 30c, ...) are each read from a memory unit (25a, 25b, 25c, ...; 26a, 26b, 26c, ...) identified by a displaceable read pointer (28).
9. Product data tracking method according to clam 8, characterised in that after a product portion (11a, 11b, 11c, ...) has come out of the transport storage section (12) the read pointer (28) is shifted to a logically adjacent memory unit (25a, 25b, 25c, ...; 26a, 26b, 26c, ...).
10. Product data tracking method according to claim 8 or 9, characterised in that in the event of an interruption of the product mass flow (11) emerging from the transport storage section (12) the read pointer (28) is held in position.
11. Product data tracking method according to claim 9, characterised in that on start-up of the transport storage section (12) the write pointer (27) and the read pointer (28) are set to the same memory unit (25a, 25b, 25c, ...; 26a, 26b, 26c, ...).
12. System for tracking product data for a product mass flow emerging from a cigarette production machine (10) in the form of an unordered stream of cigarettes (11) in the order of 1,000 cigarettes per metre of transport section in a transport storage section of the tobacco-processing industry, wherein the stream of cigarettes (11) is conveyed by means of a transport section (12) to a packing machine (13), having a storage means (22) comprising a data memory (25; 26) for storing the product data, a write control means (21) for controlling the writing of product data of the product mass flow entering the transport storage section (12) into the data memory (25; 26) and a read control means (21) for controlling the reading of product data of the product mass flow (11) coming out of the transport storage section (12) from the data memory, wherein the write control means (21) is equipped for generating product data sets (30a, 30b, 30c, ...) which each correspond to approximately equal portions (11a, 11b, 11c, ...) of the product mass flow (11) entering the transport storage section (12) and to approximately a certain length of the product mass flow (11) in the transport direction and for writing the product data sets (30a, 30b, 30c, ...) into the data memory (25; 26).
13. Product data tracking system according to claim 12, characterised in that an entry sensor (23) for detecting a product portion (11a, 11b, 11c, ...) running into the transport storage section (12) is provided.
14. Product data tracking system according to claim 12 or 13, characterised in that an exit sensor (24) for detecting a product portion (11a, 11b, 11c, ...) coming out of the transport storage section (12) is provided.
15. Product data tracking system according to one of claims 12 to 14, characterised in that the data memory (25; 26) logically maps the transport storage section (12).
16. Product data tracking system according to one of claims 12 to 15, characterised in that the data memory (25; 26) comprises at least one FIFO data memory.
17. Product data tracking system according to claim 16, characterised in that the FIFO data memory is a ring memory (25).
18. Product data tracking method according to claim 16 or 17, characterised in that the FIFO data memory is a FIFO stack memory (26).
19. Product data tracking system according to one of claims 12 to 18, characterised in that the data memory (25; 26) comprises at least one FILO data memory.

Images