EP1338542B1 - Installation and method for the selective production of stacks of printed matter - Google Patents

Installation and method for the selective production of stacks of printed matter Download PDF

Info

Publication number
EP1338542B1
EP1338542B1 EP03075501A EP03075501A EP1338542B1 EP 1338542 B1 EP1338542 B1 EP 1338542B1 EP 03075501 A EP03075501 A EP 03075501A EP 03075501 A EP03075501 A EP 03075501A EP 1338542 B1 EP1338542 B1 EP 1338542B1
Authority
EP
European Patent Office
Prior art keywords
batch
sequence
variable
feeder
overs
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP03075501A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP1338542A1 (en
Inventor
Ellen Johanna Pothof-Kooi
Johannes Stephanus Maria Geeraerts
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PTT Post Holdings BV
Original Assignee
Koninklijke PTT Post BV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke PTT Post BV filed Critical Koninklijke PTT Post BV
Publication of EP1338542A1 publication Critical patent/EP1338542A1/en
Application granted granted Critical
Publication of EP1338542B1 publication Critical patent/EP1338542B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65H—HANDLING THIN OR FILAMENTARY MATERIAL, e.g. SHEETS, WEBS, CABLES
    • B65H39/00—Associating, collating, or gathering articles or webs
    • B65H39/02—Associating,collating or gathering articles from several sources
    • B65H39/04—Associating,collating or gathering articles from several sources from piles
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65H—HANDLING THIN OR FILAMENTARY MATERIAL, e.g. SHEETS, WEBS, CABLES
    • B65H39/00—Associating, collating, or gathering articles or webs
    • B65H39/02—Associating,collating or gathering articles from several sources
    • B65H39/04—Associating,collating or gathering articles from several sources from piles
    • B65H39/043—Associating,collating or gathering articles from several sources from piles the piles being disposed in juxtaposed carriers
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65H—HANDLING THIN OR FILAMENTARY MATERIAL, e.g. SHEETS, WEBS, CABLES
    • B65H39/00—Associating, collating, or gathering articles or webs
    • B65H39/02—Associating,collating or gathering articles from several sources
    • B65H39/06—Associating,collating or gathering articles from several sources from delivery streams
    • B65H39/075—Associating,collating or gathering articles from several sources from delivery streams by collecting in juxtaposed carriers
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65H—HANDLING THIN OR FILAMENTARY MATERIAL, e.g. SHEETS, WEBS, CABLES
    • B65H2513/00—Dynamic entities; Timing aspects
    • B65H2513/50—Timing
    • B65H2513/51—Sequence of process
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65H—HANDLING THIN OR FILAMENTARY MATERIAL, e.g. SHEETS, WEBS, CABLES
    • B65H2557/00—Means for control not provided for in groups B65H2551/00 - B65H2555/00
    • B65H2557/20—Calculating means; Controlling methods
    • B65H2557/24—Calculating methods; Mathematic models

Definitions

  • the present invention relates to an installation for collating stacks of printed products comprising a gathering machine, a predetermined number of feeders and a computer, the feeders being equipped to feed printed products to the gathering machine and stacks of printed products being produced in batches, a batch consisting of a set of groups of stacks where all stacks within a group have the same composition of printed products, and the computer being equipped to determine a feeder schedule in which it is specified which feeder has to be activated, deactivated or changed over at what point in time.
  • the aim of the present invention is to provide an installation with which as few as possible new settings of the feeders are required during processing of the batches.
  • an installation as described in the preamble characterised in that the computer is equipped to carry out the following steps:
  • the present invention also relates to a method for the collation of stacks of printed products with the aid of a gathering machine, a limited number of feeders and a computer, stacks of printed products being produced in batches, a batch consisting of a set of groups of stacks where all stacks within a group have the same composition of printed products, and a feeder schedule being determined in which it is specified which feeder has to be activated, deactivated or changed over at what point in time, characterised in that the method comprises the following steps;
  • the invention relates to a computer program that can be loaded by a computer that forms part of an installation for the collation of stacks of printed products, further comprising a gathering machine and a predetermined number of feeders, the feeders being equipped to feed printed products to the gathering machine and stacks of printed products being produced in batches, a batch consisting of a set of groups of stacks where all stacks within a group have the same composition of printed products, and the computer being equipped to determine a feeder schedule in which it is specified which feeder has to be activated, deactivated or changed over at what point in time, characterised in that the computer is equipped to carry out the abovementioned steps a to k.
  • the invention relates to a data carrier provided with a computer program as described above.
  • FIG. 1 an installation 1 for the collation of stacks of printed matter such as can be used in the invention is shown.
  • the installation 1 comprises, inter alia, a gathering machine 2, which, for example, is a conveyor belt.
  • feeders 3 are present which feed printed products (hereinafter designated “folders") to the gathering machine 2.
  • the installation 1 furthermore comprises a computer 5 that via communication means 6 is linked to displays 7 and indicators 8 that are installed by the feeders 3.
  • the communication means 6 are shown as continuous lines, these means can consist of wireless links just as well as of cables.
  • the batch processing process starts with the determination of the optimum sequence of the batches, hereinafter designated batch sequence.
  • a batch is defined as a set of groups of stacks where all stacks within a group have the same printed matter composition.
  • a group corresponds to a specific residential area in which a delivery person delivers a stack to every house.
  • the computer 5 is loaded by an operator with information on the folders that make up the various batches and the number of stacks in a batch.
  • the computer 5 determines an optimum batch sequence on the basis of an algorithm.
  • the algorithm is preferably determined by a program stored in a memory (see Figure 7).
  • Feeder schedules belonging to this batch sequence are transmitted by the computer 5 to the various feeders 3.
  • This information is preferably stored in PLCs (programmable logic controllers) present in the feeders 3.
  • the feeders 3 are then filled with the folders 4 that make up the first batch. Filling is carried out by an installation operator on the basis of messages on the displays 7 and further directions on the indicators 8.
  • the computer 5 indicates on the displays 7 which folders have to be placed in the relevant feeders 3.
  • the indicators 8 preferably comprise an indicator, such as a warning lamp, that alerts the user. This warning lamp can, for example, have the following functions:
  • the feeder 3 After each (manual) change of folders, the feeder 3 must, if necessary, be mechanically adjusted to the new folders, after which a message that the feeder 3 is ready must be given.
  • the ready message is preferably given by means of a push button, not shown, that is present on each feeder 3. If the operator presses the push button this means that the feeder 3 is ready for use.
  • FIG. 2 a flowchart for the main procedure is shown.
  • the main procedure starts at step 20.
  • step 21 a starting sequence for the batches is determined.
  • This step is a procedure that is elaborated in Figure 3.
  • a specific batch sequence follows from step 21.
  • the next step is to determine a schedule for filling the feeders 3 on the basis of the batch sequence determined; step 22.
  • This step 22 is elaborated in Figure 4.
  • the number of change-overs of the feeders 3 that is needed to change from one batch to a subsequent batch follows from step 22.
  • the batch sequence is now subdivided into blocks. Each block is a part sequence of the complete batch sequence.
  • the size of a block (the number of batches) is determined by the "maximum number of change-overs" (MNC) variable. This variable is initialised in step 23 with an initial value MNC_init. A block ends where more change-overs are needed for the production of the following batch than the value that MNC indicates. A new block then starts. The start of the complete batch sequence is the start of the first block. The end of the complete batch sequence is the end of the last block.
  • MNC maximum number of change-overs
  • the batch sequence is divided into blocks in step 24. Because the block size is determined by the maximum number of change-overs of the feeders 3 from one batch to the subsequent batch, the blocks will differ in size.
  • step 25 The next step consists of a procedure for improving the batch sequence; see step 25.
  • This step is elaborated in Figure 5.
  • step 26 an assessment is made as to whether a better sequence has been found. A better sequence is that in which the total number of change-overs is less than that in the previous sequence. If a better sequence has been found, the procedure returns to step 24. If this is not the case, step 27 then follows.
  • step 27 a test is carried out to determine whether the variable MNC is greater than a minimum MNC (MNC_min), where MNC_min is an integer having, for example, the value 1 or 2. If this is the case, step 28 then follows in which MNC is reduced by 1. Following step 28, step 24 is repeated. If MNC is equal to MNC_min in step 27, the main procedure is terminated; step 29.
  • MNC_min MNC
  • step 21 for determining the starting sequence is shown in Figure 3.
  • step 31 the step for selecting the batch containing the most folders first follows; see step 31. If there are several batches containing the largest number of folders, the first batch of these that is found is then selected. This batch becomes the first batch in the sequence. The content of the feeders 3 is now determined. This is easy because all feeders 3 are empty at the start.
  • step 32 it is then investigated whether there are batches that can be run with the content of the feeders 3 determined in this way. These batches are placed in the sequence after the first batch. If it is found in step 33 that all batches can be placed in this way, the procedure is complete; see 38. If it is not possible to place all batches, step 34 follows.
  • step 34 a parameter v is initialised with the value one.
  • a search is then made in the batches that have not yet been placed to find a batch that can be run with v change-overs of the feeders 3; see step 35. If this is not successful, the parameter v is then increased by one in step 36. Step 35 is then repeated. If there is a batch that can be run with v change-overs of the feeders 3, step 37 then follows in which the content of the feeders 3 is determined in such a way that the new batch determined in step 35 can be run. In this context placing folders in empty feeders 3 is not regarded as relevant change-overs.
  • step 37 If folders have to be changed in step 37 in order to run the new batch, the choice of the feeders 3 to be changed is then arbitrary, provided the folders that are needed for the batch to be added are already in a specific feeder 3. This (these) feeder(s) 3 is (are) then not changed.
  • Step 32 is then carried out again, after which step 33 follows. If it is found in step 33 that all batches have been placed, the procedure is complete; see 38. If, on the other hand, it is found in step 33 that all batches have not yet been completed, the program then continues with steps 34, 35, 36, 37, 32 and 33 until all batches have been completed. The computer 5 has then determined a starting sequence and stored this in its memory.
  • step 40 The procedure 22 for determining the schedule for filling the feeders 3 is shown in Figure 4.
  • step 40 the folders for the first batch from the starting sequence as determined with the aid of the schedule in Figure 3 are (virtually) placed in the feeders 3 in the first step; see step 41.
  • a check is then made to determine whether there is a subsequent batch in the sequence; see step 42. If there is a subsequent batch, step 43 is then carried out.
  • step 43 the first folder of the batch is selected. This folder is termed the "current folder" in the chart.
  • step 44 it is investigated whether this current folder is already (virtually) present in a feeder. If this is not the case, the program proceeds to step 45.
  • step 45 a check is carried out to determine whether a feeder is free.
  • step 46 then follows in which the current folder is placed in an empty feeder.
  • the wording "filling a feeder with a folder” is used to denote that the feeder 3 is filled with a predetermined quantity of identical folders.
  • step 45 If it is found in step 45 that no feeder is free, it is then determined in step 49 which folder that is currently present in the feeders 3 is the last needed again for a later batch. This method is analogous to the known "keep tool needed soonest" algorithm. The folder determined in this way is removed from the feeder 3 in step 50. The current folder is then placed in this empty feeder 3 in step 46. If it is found in step 42 that all batches have been dealt with, the procedure is terminated, see 51, and the computer 5 has determined a schedule for filling the feeders 3. The computer 5 stores this schedule.
  • Figure 5 shows a flowchart for a procedure 25 for improving the sequence. This is necessary because the batch sequence that is associated with the schedule for filling the feeders 3, as determined on the basis of the flowchart in Figure 4, is not necessarily optimum.
  • the optimum batch sequence is that in which as few change-overs of the feeders 3 as possible are needed.
  • the first block of the sequence that followed from Figure 4 is selected in step 61.
  • the first possible location in the sequence in which a block can be inserted is now determined. Insertion locations are between the various blocks and right at the start and at the end of the sequence.
  • the first possible insertion location for the first block is between the second and the third block.
  • the first possible insertion location for the second block is right at the front of the sequence.
  • restrictions with regard to the time of production are taken into account when determining the possible insertion location; certain batches have, for example, to be produced before others.
  • step 62 the block from step 61 is moved to the insertion location from step 61.
  • step 63 the schedule for the feeders 3 is then determined with the aid of the procedure from Figure 4.
  • step 64 it is determined whether the new sequence has a lower total number of change-overs. If this is the case this is regarded as a better sequence and the next block is selected in step 67 (provided there is still a block; this is checked in step 66).
  • step 62 is carried out again with the new block and the first possible insertion location. If it follows from step 64 that the new sequence is not an improvement, the next insertion location is then determined in step 68 (provided there is still an insertion location; this is checked in step 65). After step 68, step 62 is then carried out again with the same block and a new insertion location. If it is found in step 66 that the final block has been reached, the procedure is terminated in step 69.
  • FIG. 6A a table has been drawn in which the columns correspond to five feeders called F1, ..., F5.
  • the number of hard change-overs, the number of soft change-overs and the total number of change-overs, respectively, are given in the last three columns.
  • the rows in the table correspond to a number of batches, i, e, B1, ..., B12.
  • a batch Bx consists of a sub-set of the total number of products (read folders) P1, ..., PN.
  • N 12, but N can be any arbitrary other integer. In this example a batch does not contain more than four products.
  • step 21 in Figure 2 it is first determined which batch contains the most folders; see step 31 in Figure 3.
  • This batch is called B1 with, as content, the products P1, P2, P3, P4.
  • the batches that can be run with the current content of the feeders 3 are now added in step 32.
  • the parameter v is then initialised with the value one in step 34.
  • the content of the feeders 3 is then determined in step 37 so that batch B3 can be run.
  • Figure 6A the products for batch B3 can be (virtually) placed in the feeders F3, F4, F5.
  • the first two products of batch B3 were already in the feeders 3.
  • Product P5 is placed in an empty feeder F5.
  • the product P1 remains in feeder F1 but feeder F1 is switched to the stop position.
  • Batch B4 meets these criteria and has P3, P5, P6 as content.
  • the products P3, P5 are already in the machine in feeders F3 and F5, respectively, but the other product P6 is placed in feeder F1, which thus has to be changed-over for this purpose. Since product P6 can be placed in the feeder F1 in advance, there is a soft change-over here.
  • Batch B5 can be run with the current feeder content and is thus the next batch in the sequence. There are no further batches that can be run with the current feeder content, so that, once again, the value for v is initialised at 1 in step 34.
  • batch B6 which can be run by placing product P7 in the feeders 3.
  • Feeder F3 is not in use, so the product P10 can be placed in feeder F3 in advance, as a result of which this is a soft change-over.
  • the hard change-overs are indicated by an "*" and the total number of change-overs is shown in the column with the heading "Total”. It would also have been possible to place the products P8, P9, P10 in feeder F4. At this point in time it is not yet known what the best choice is. Note: in Figure 6A, the products that can optionally remain in the feeder(s) 3 after running a batch are not shown.
  • Batch B9 can be run with one change-over, so that the product P4 is removed from feeder F4 in favour of product P11. It would also have been possible to choose to remove product P5, but at this point in time it is not yet known what is the best choice.
  • step 32 No batch that can be run without change-overs is found with the aid of step 32, so once again the value for v is initialised at 1 in step 34. No batches that can be run are found in step 35, so in step 36 the value for v is increased to 2.
  • the schedule for the feeders 3 is then determined in step 22 on the basis of the procedure shown in Figure 4. This gives the feeder schedule as shown in Figure 6B. Only the functioning of step 49 is explained here.
  • the product P6 In Figure 6B it can be seen that the content of the feeders 3 has been changed for running batch B4.
  • the product P6 In order to be able to run batch B4, the product P6 must be placed in a feeder.
  • the product P1 is in feeder F1 and product P4 in feeder F4.
  • Product P1 is used in batch B10 and product P4 in batch B5, whilst product P2 is used in batch B12.
  • Product P2 is thus needed again later than product P1 and P4 and therefore product P2 is removed from feeder F2.
  • the required product P6 is now placed in feeder F2.
  • Batch B5 can be produced because all products for batch B5 are already in the feeders 3. At the start of batch B6 product P7 has to be placed in the feeders 3. Since the product P3 is the last needed (i.e. in batch B11), this is removed from feeder F3 and replaced by product P7 (hard change-over).
  • step 23 The next step that is carried out is step 23 in Figure 2.
  • MNC_init is tw and MNC_min is zero.
  • step 24 the batch sequence is divided into blocks.
  • the second block S2 consists of batch B7 to B12 because there is always at most only one change-over between these batches.
  • Step 25 in which the batch sequence is improved, follows after step 24.
  • This improvement procedure is shown in Figure 5.
  • step 61 the first block is selected. This is block S1.
  • a first insertion location is also chosen. This is the location after S2 (in this example there is no other possibility).
  • step 62 block S1 is now removed and inserted in the insertion location concerned. This gives the batch sequence as is shown in Figure 6C. Here again “*" indicates where the hard change-overs take place. The total number of change-overs now amounts to ten.
  • step 63 The schedule for the feeders is now determined in step 63 in Figure 5.
  • the procedure is not discussed again here.
  • the end result of step 63 can be seen in Figure 6D.
  • the number of change-overs is eight. This is a better sequence than that shown in Figure 6B. (Note: the number of change-overs is also shown in Figures 6A and 6C, but is actually superfluous and not of importance for the decision in step 64.) Because the response to the question in step 64 is in the affirmative and all possible block sequences have been investigated for improvements, the scheme in Figure 5 is exited via step 66 and step 69.
  • step 26 the answer in step 26 is "no". Therefore the program now proceeds to step 28 where MNC is reduced to one; see Figure 2.
  • the division into blocks follows in step 24. This gives the blocks S1' and S2', where S1' consists of the batches B8 and B9, whilst S2' is determined by the batches B10 to B7; see Figure 6D.
  • the procedure now continues with steps 25 and 26. After a number of iterations no further improvement will be found, so that the procedure will be terminated; see step 29.
  • Figure 7 shows a computer installation 5 with a processor 101 for carrying out mathematical processing such as is used in one embodiment.
  • the processor 101 is connected to a number of memory components including a hard disc 105, read-only memory (ROM) 107, electrically erasable programmable read-only memory (EEPROM) 109 and random access memory (RAM) 111. Not all of these types of memory necessarily have to be present. Moreover, they do not have to be physically located close to the processor 101. They can also be located remotely.
  • ROM read-only memory
  • EEPROM electrically erasable programmable read-only memory
  • RAM random access memory
  • the processor 101 is also connected to means for the input of instructions, data, etc. by a user, such as a keyboard 113 and a mouse 115.
  • a user such as a keyboard 113 and a mouse 115.
  • Other input means such as a touch screen, a trackball and/or speech converter, which are known to those skilled in the art, can also be used.
  • a reader 117 connected to the processor 101 is provided.
  • the reader 117 is equipped to read data from, and optionally to store data on, a data carrier, such as a floppy disc 119 or a CD-ROM 121.
  • a data carrier such as a floppy disc 119 or a CD-ROM 121.
  • Other data carriers can be, for example, DVDs as is known to those skilled in the art.
  • the processor 101 is also connected to a printer 123 for printing output data on paper, as well as to a display unit 103, for example a monitor or LCD (liquid crystal display) screen, or any other type of display unit known to those skilled in the art.
  • the processor 101 is equipped to communicate with the PLCs, optionally with the displays 7 or with the indicators 8 that are installed by the feeders 3, by means of input/output means 125 and via the communication means 6.
  • the processor 101 can have been implemented as a stand-alone system or as a number of processors operating in parallel, each of which is equipped to carry out sub-tasks of a larger program, or as one or more main processors with various sub-processors.
  • the optimisation process is carried out by a computer that is not connected to the feeders 3.
  • the result of the optimisation process is then stored on, for example, a data carrier and the data are then read in by the computer 5 that communicates with the feeders 3.
  • the invention can also be used when sorting other printed products, such as, for example, newspapers, instead of folders.
  • the invention can, moreover, be applied to the sorting of products of a more general nature. Consideration can be given to the (optionally free) production and distribution of stacks of CDs. Yet another possibility is the distribution of products that are not stacked but are collected together, for example in a plastic bag, and then distributed.

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Agricultural Chemicals And Associated Chemicals (AREA)
  • General Factory Administration (AREA)
  • Stored Programmes (AREA)
  • Collation Of Sheets And Webs (AREA)
  • Battery Electrode And Active Subsutance (AREA)
  • Battery Mounting, Suspending (AREA)
EP03075501A 2002-02-21 2003-02-21 Installation and method for the selective production of stacks of printed matter Expired - Lifetime EP1338542B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NL1020025 2002-02-21
NL1020025A NL1020025C2 (nl) 2002-02-21 2002-02-21 Inrichting en werkwijze voor het selectief vervaardigen van stapels drukwerk.

Publications (2)

Publication Number Publication Date
EP1338542A1 EP1338542A1 (en) 2003-08-27
EP1338542B1 true EP1338542B1 (en) 2004-11-24

Family

ID=27656513

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03075501A Expired - Lifetime EP1338542B1 (en) 2002-02-21 2003-02-21 Installation and method for the selective production of stacks of printed matter

Country Status (9)

Country Link
EP (1) EP1338542B1 (nl)
AT (1) ATE283230T1 (nl)
DE (1) DE60300164T2 (nl)
DK (1) DK1338542T3 (nl)
ES (1) ES2233903T3 (nl)
HK (1) HK1057883A1 (nl)
NL (1) NL1020025C2 (nl)
PT (1) PT1338542E (nl)
SI (1) SI1338542T1 (nl)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE502004003269D1 (de) 2003-12-19 2007-05-03 Ferag Ag Steuerung einer Vorrichtung zum Zusammentragen von flexiblen Produkten
CH702405A1 (de) 2009-12-09 2011-06-15 Ferag Ag Steuervorrichtung und verfahren zur steuerung einer druckproduktverarbeitungsanlage.
CH704690A1 (de) * 2011-03-24 2012-09-28 Ferag Ag Steuervorrichtung und Verfahren zur Steuerung einer Druckproduktverarbeitungsanlage.
CH705598A1 (de) * 2011-10-06 2013-04-15 Ferag Ag Steuervorrichtung und Verfahren zur Steuerung einer Produktverarbeitungsanlage.
CH706470A1 (de) * 2012-05-02 2013-11-15 Ferag Ag Computerisierte Zentrale zum Konfigurieren von Produktverarbeitungsanlagen.

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4253651A (en) * 1979-01-30 1981-03-03 Technitrol, Inc. Document interleaver device
US5346196A (en) * 1993-03-05 1994-09-13 U.S. News & World Report, L.P. Cycle binding line with signature replacement indicator means
EP0639154A1 (de) 1993-03-09 1995-02-22 Grapha-Holding Ag Verfahren zur selektiven herstellung von druckprodukten
US5777883A (en) * 1996-04-25 1998-07-07 Pitney Bowes Inc. System and method for mail run processing on multiple inserters
US5842577A (en) * 1996-07-26 1998-12-01 Opex Corporation Method and apparatus for sorting and acquiring image data for documents

Also Published As

Publication number Publication date
HK1057883A1 (en) 2004-04-23
ATE283230T1 (de) 2004-12-15
DK1338542T3 (da) 2005-01-24
ES2233903T3 (es) 2005-06-16
DE60300164T2 (de) 2005-12-15
SI1338542T1 (en) 2005-04-30
PT1338542E (pt) 2005-04-29
DE60300164D1 (de) 2004-12-30
EP1338542A1 (en) 2003-08-27
NL1020025C2 (nl) 2003-08-25

Similar Documents

Publication Publication Date Title
CN107103445B (zh) 信息处理方法和装置
US6576857B1 (en) Method of optimizing a mail sorting process
EP1338542B1 (en) Installation and method for the selective production of stacks of printed matter
CN107203865B (zh) 一种订单的分配方法和装置
EP4099239A1 (en) Information processing apparatus, information processing method, and information processing program
US11345562B2 (en) Post-processing apparatus and image forming system
JP2005501716A (ja) 配送順序ソート方法
Zhang et al. Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
AU2012321025B2 (en) Computerised control device and computer-implemented method for controlling a product processing plant, and computer program product
CN113052376B (zh) 生产排程方法及装置，存储介质和电子设备
CN111408551B (zh) 药库的分拣药品的方法及装置、药库及存储介质
Piyachayawat et al. A hybrid algorithm application for the multi-size pallet loading problem case study: Lamp and lighting factory
CN111680954A (zh) 分拣系统中的规则配置方法和分拣控制方法
CN111598511A (zh) 运输货物的车线规划方法、装置、设备及存储介质
JPH0733318A (ja) 印刷装置
JP2002014714A (ja) 資源割り当て計画方法及び資源割り当て計画装置
JPH10181814A (ja) 収納割付装置
US20240199331A1 (en) System
CN117742665A (zh) 一种可变数据排列方法及排列系统
JP2865520B2 (ja) ロット製品割付装置
US4277057A (en) Method for using a multiple input bin collating machine with a single output hopper
Polyakovskiy et al. An intelligent framework to online bin packing in a just-in-time environment
JPH10337537A (ja) 紙葉類並べ換え装置
Gradišar et al. One-Dimensional Cutting Stock Optimisation by Suborders
CN115375222A (zh) 一种仓储管理系统、合托方法、设备、存储介质及程序

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO

17P Request for examination filed

Effective date: 20040130

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

AKX Designation fees paid

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AXX Extension fees paid

Extension state: AL

Payment date: 20040130

Extension state: RO

Payment date: 20040130

Extension state: MK

Payment date: 20040130

Extension state: LT

Payment date: 20040130

Extension state: LV

Payment date: 20040130

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 60300164

Country of ref document: DE

Date of ref document: 20041230

Kind code of ref document: P

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: PTT POST HOLDINGS B.V.

REG Reference to a national code

Ref country code: DK

Ref legal event code: T3

REG Reference to a national code

Ref country code: CH

Ref legal event code: NV

Representative=s name: A. BRAUN, BRAUN, HERITIER, ESCHMANN AG PATENTANWAE

REG Reference to a national code

Ref country code: EE

Ref legal event code: FG4A

Ref document number: E000025

Country of ref document: EE

Effective date: 20041126

REG Reference to a national code

Ref country code: GR

Ref legal event code: EP

Ref document number: 20050400027

Country of ref document: GR

NLT2 Nl: modifications (of names), taken from the european patent patent bulletin

Owner name: PTT POST HOLDINGS B.V.

REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1057883

Country of ref document: HK

REG Reference to a national code

Ref country code: EE

Ref legal event code: HB1A

Ref document number: E000025

Country of ref document: EE

REG Reference to a national code

Ref country code: PT

Ref legal event code: SC4A

Free format text: AVAILABILITY OF NATIONAL TRANSLATION

Effective date: 20050221

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2233903

Country of ref document: ES

Kind code of ref document: T3

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20050825

REG Reference to a national code

Ref country code: FR

Ref legal event code: CD

REG Reference to a national code

Ref country code: CH

Ref legal event code: PFA

Owner name: PTT POST HOLDINGS B.V.

Free format text: PTT POST HOLDINGS B.V.#PRINSES BEATRIXLAAN 23#2595 AK' S-GRAVENHAGE (NL) -TRANSFER TO- PTT POST HOLDINGS B.V.#PRINSES BEATRIXLAAN 23#2595 AK' S-GRAVENHAGE (NL)

REG Reference to a national code

Ref country code: EE

Ref legal event code: HC1A

Ref document number: E000025

Country of ref document: EE

REG Reference to a national code

Ref country code: CH

Ref legal event code: PCAR

Free format text: NEW ADDRESS: HOLBEINSTRASSE 36-38, 4051 BASEL (CH)

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 20210219

Year of fee payment: 19

Ref country code: FR

Payment date: 20210223

Year of fee payment: 19

Ref country code: FI

Payment date: 20210218

Year of fee payment: 19

Ref country code: CY

Payment date: 20210210

Year of fee payment: 19

Ref country code: CZ

Payment date: 20210222

Year of fee payment: 19

Ref country code: EE

Payment date: 20210222

Year of fee payment: 19

Ref country code: IT

Payment date: 20210223

Year of fee payment: 19

Ref country code: GR

Payment date: 20210222

Year of fee payment: 19

Ref country code: IE

Payment date: 20210218

Year of fee payment: 19

Ref country code: PT

Payment date: 20210201

Year of fee payment: 19

Ref country code: LU

Payment date: 20210223

Year of fee payment: 19

Ref country code: MC

Payment date: 20210219

Year of fee payment: 19

Ref country code: NL

Payment date: 20210208

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: ES

Payment date: 20210317

Year of fee payment: 19

Ref country code: GB

Payment date: 20210223

Year of fee payment: 19

Ref country code: DK

Payment date: 20210219

Year of fee payment: 19

Ref country code: DE

Payment date: 20210225

Year of fee payment: 19

Ref country code: SI

Payment date: 20210202

Year of fee payment: 19

Ref country code: SE

Payment date: 20210219

Year of fee payment: 19

Ref country code: TR

Payment date: 20210203

Year of fee payment: 19

Ref country code: BG

Payment date: 20210222

Year of fee payment: 19

Ref country code: AT

Payment date: 20210218

Year of fee payment: 19

Ref country code: BE

Payment date: 20210224

Year of fee payment: 19

Ref country code: HU

Payment date: 20210131

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SK

Payment date: 20210219

Year of fee payment: 19

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60300164

Country of ref document: DE

REG Reference to a national code

Ref country code: DK

Ref legal event code: EBP

Effective date: 20220228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

REG Reference to a national code

Ref country code: FI

Ref legal event code: MAE

REG Reference to a national code

Ref country code: SE

Ref legal event code: EUG

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20220301

REG Reference to a national code

Ref country code: SK

Ref legal event code: MM4A

Ref document number: E 64

Country of ref document: SK

Effective date: 20220221

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 283230

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220221

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220228

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20220221

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: SE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220222

Ref country code: PT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220822

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: GR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220905

Ref country code: FI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: CZ

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: CY

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: BG

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220831

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220222

Ref country code: HU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220222

REG Reference to a national code

Ref country code: SI

Ref legal event code: KO00

Effective date: 20221013

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220301

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

Ref country code: DK

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220901

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20230331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20230303

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220222

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220221

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228