EP1181110A1 - Method for preparing a sorting scheme - Google Patents
Method for preparing a sorting schemeInfo
- Publication number
- EP1181110A1 EP1181110A1 EP00918971A EP00918971A EP1181110A1 EP 1181110 A1 EP1181110 A1 EP 1181110A1 EP 00918971 A EP00918971 A EP 00918971A EP 00918971 A EP00918971 A EP 00918971A EP 1181110 A1 EP1181110 A1 EP 1181110A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- sorting
- box
- boxes
- machine
- objects
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000009826 distribution Methods 0.000 claims abstract description 73
- 239000011159 matrix material Substances 0.000 claims description 58
- 238000005457 optimization Methods 0.000 claims description 8
- 238000004519 manufacturing process Methods 0.000 claims description 4
- 238000005192 partition Methods 0.000 claims description 4
- 238000001514 detection method Methods 0.000 claims 1
- 238000000926 separation method Methods 0.000 abstract description 2
- 239000002699 waste material Substances 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 238000002360 preparation method Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000000295 complement effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
- B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
- B07C3/00—Sorting according to destination
- B07C3/02—Apparatus characterised by the means used for distribution
Definitions
- the present invention relates to a process for preparing a sorting plan for a batch of objects of the folds, letters type, for a sorting machine operating in reverse sorting, with a view to the distribution of said objects by a person in charge of this mission. , attendant or other.
- This sorting is carried out by the so-called reverse sorting method, which method makes it possible to sort in a suitable sorting machine, and with a reduced number of passes, a large number of objects allocated to numerous distribution points.
- One of the first problems encountered with these sorting machines is linked to the capacity of the boxes or receptacles which receive the objects as they are sorted.
- One of the first objectives of the invention is to solve this problem by means of a process for preparing a sorting plan intended for sorting machines operating in reverse sorting.
- the method of preparing the sorting plan consists, from data on the actual batch to be sorted or from statistical data, to be inserted in the list of non-zero numbers representing the quantity of objects for each distribution point. , in the order of the route, a certain number of zeros up to the separating power available on the sorting machine, and the number of sorting passes, and to arrange said zeros in the distribution matrix illustrating said sorting plan , so that certain boxes of the sorting machine, which appear empty, are used as duplication boxes of the first non-empty previous box, so as to take into account and process the distribution point or points for which the number of objects or the sum of these numbers as the case may be in each row or column of said matrix, is such that it exceeds the capacity of a single box, which amounts to assimilating one or several consecutive boxes in one and the same direction, playing the role of receptacles of multiple capacity.
- Reverse sorting also involves repetition of tasks by the operator.
- the operator recovers in a very precise order the content of each box and positions said content in accordance with the recovery order, either in the sorting machine store for a new sorting operation, or in a container or box for distribution when this recovery follows the last pass.
- the duration of this decasing operation is linked to the number of boxes in which the sorted objects are positioned.
- the present invention proposes to remedy these drawbacks, that is to say to reduce the arduousness and the time of this operation by implementing means which make it possible to reduce the number of boxes used to carry out the sorting operation.
- These means consist, on the matrix distribution of the sorting plan, of placing in the first row (s) of said matrix, zeros distributed in rows and / or columns so as to be able to reduce the number of boxes used on the machine, during sorting and, moreover, filling said boxes to a value close to their maximum capacity.
- the invention proposes to make a partition of the boxes to form at least two geographically distinct sets on said machine, making it possible to superimpose over time, the automatic operation of sorting a first batch of objects, and the operation from another lot already sorted.
- the method also consists in accumulating several batches of objects to sort, so as to use among the boxes available, the largest number of boxes possible, which boxes each receiving a quantity of objects close to their maximum capacity.
- the method of preparing a sorting plan also applies to the arrangement of the sorting plan represented in the form of a rectangular matrix corresponding to a sorting carried out in three passes.
- the method according to the invention can consist in adjusting the filling rate of each of the boxes so as to perform automatic filling simultaneously. and manual crushing, without risk of overflow.
- the invention also relates to the machines allowing the implementation of the method and in particular a machine of the office machine type which comprises for example several superimposed and horizontal lines of juxtaposed boxes, each line comprising thirteen boxes of which one, the last, constitutes a waste and / or overflow reception area; each box has a capacity of around 50 letters of conventional mail and includes means for detecting the achievement of its maximum capacity, so as to orient either towards the overflow box or to open the Next boxes qualified as duplication boxes, reserved for this purpose to accommodate the overflow of the previous box.
- this machine comprises a module making it possible to optimize the distribution of the batch or lots to be sorted, in the matrix representation, in order to provide the automaton of said machine, a sorting plan adapted to said lots, it that is to say a plan which makes the best use of the possibilities of the machine, in the interest of the operator.
- FIG. 1 shows a batch of objects to sort (letters) and the data relating to this batch
- - Figure 2 shows schematically, a sorting machine for the batch of letters which is shown in Figure 1 for example;
- FIG. 3 shows in matrix form, the preparation of the sorting plan showing the numbers corresponding to the quantities of objects to distribute, which numbers are distributed one after the other, column by column, in the matrix with insertion of zeros in said columns;
- - Figure 4 shows the matrix of Figure 3 with, instead of the quantities of objects, an indication of the corresponding distribution points;
- - Figure 5 shows an arrangement of the matrix of Figure 3 to improve sorting by optimizing the distribution of the quantities of letters arranged in the rows and in the columns;
- FIG. 6 shows the position of the distribution points of the matrix detailed in Figure 5;
- FIG. 7 shows another arrangement of the matrix shown in Figure 3, with a duplication of overloaded rows and columns, that is to say the sum of the quantities of each point entered on said rows and columns is greater than the capacity of a single space;
- FIG. 9 shows another arrangement of the matrix shown in Figure 3, to reduce the number of boxes used during the sorting operation
- FIG. 10 shows the position of the distribution points of the matrix detailed in Figure 9;
- FIG. 11 shows a sorting machine of the type capable of implementing the matrix sorting plan shown above, Figure 10;
- FIG. 1 shows, placed in a box 1, a batch of objects to be sorted and in particular of letters 2.
- the batch of letters can be delivered to the distributor office with information.
- This information can be transmitted by any appropriate means to the distributor office by computer network or for example, as shown, by means of a floppy disk 3.
- This information or data are also represented in FIG. 1 and they consist of a list of numbers which correspond to the quantity of letters assigned to each of the distribution points of the factor, which numbers are classified in the order of said points.
- the factor distribution points are mentioned on the first line 4, numbered from 1 to 55 as an example.
- sorting machine of this type is described in document FR-2 735 995 of the applicant and it is shown in FIG. 2 with simply its essential elements useful for understanding the present application.
- This machine includes a magazine 10 in which the operator
- Each letter is taken by means of a destacker device 11 and follows a circuit which leads it into one of the boxes 12 marked 1, 2, 3 etc. ... up to 12 or even 24 or more, with an R box at the end for waste or other.
- the letter circuit consists of a conveyor system 13 at the end of which the letters are oriented in the appropriate boxes 12. Each letter is sent to a box by means of a switch system 14 by means of a tilting deflector 15 controlled by appropriate means connected to an automaton 16 shown diagrammatically on the machine in the form of a rectangle.
- the deflector 15 causes a deviation of each letter towards the appropriate box and the letters are guided by means of an articulated flap 17, which allows the arrangement of the letters one behind the other in the boxes.
- Each flap 17 is articulated so as to move as the corresponding box is filled.
- the flap 17 actuates a detector device consisting of a sensor 19 and this sensor 19 provides information which makes it possible, via the automaton 16 and the switch device 14, to orient the letters either towards the waste box R, or simply towards the next box, which being provided in the sorting plan as an overflow box.
- the automaton 16 receives information from a read head 20 which, at the time of the passage of each letter, reads the information printed on said letter, in the form of barcode. This reading makes it possible to locate the point of distribution of the letter, and, as a function of a distribution of said points which will be detailed below, the automaton 16 directs the letter in question towards one of the boxes 12 which corresponds to its destination, either box 1, 2 or 3, etc.
- the automaton controls the switches 14 according to the destinations.
- a memory 21 which corresponds to the sorting plan prepared from known information, that is to say either information which comes from the disk 3, or information which comes from the carrying out of a sorting previous such as the sorting of the previous day or an average established over several days.
- This preparation is carried out in a module 22 consisting of a computer programmed to use the data relating to the lots to be sorted, according to an appropriate program.
- sorting operation is carried out in the present case in two passes, by the reverse sorting method.
- the first sorting is launched on the available boxes of the machine according to criteria which follow from the sorting plan prepared in advance in matrix form.
- the operator picks up the letters in each of the boxes and reposition them in the same order, in the magazine 10 for a second sorting operation at the end of which the objects are classified one after the other, by distribution points.
- the operator At the end of the first sorting pass, the operator must arrange the packets of letters in a certain order in the magazine 10 and in particular in the order of the boxes numbered from 1 to 12 or from 1 to 24 or other depending on the case.
- the capacity K of the boxes 12 of the sorting machine is of the order of 50 ordinary letters, which corresponds to a handful of letters easily grasped by the operator during the decasing operation, that is to say the 'operation which consists in removing in each of the boxes the sorted letter packet either to carry out a new sorting pass, or for a delivery in boxes for the realization of the round.
- This capacity may prove to be insufficient for certain points or groups of distribution points.
- the boxes to which these points 31 and 48 are assigned will receive approximately 50 letters each and, as soon as the sensor 19 will give the information of maximum filling of the box d welcome, the additional letters will be directed to the box
- FIG. 3 corresponds to a matrix representation of the quantities of letters to be distributed, in a matrix the number of rows and the number of columns corresponding to the number of boxes available for sorting on a machine by the so-called reverse sorting method.
- the number of points in the matrix corresponds to the separating power of the machine.
- the matrix has 24 horizontal lines and 24 vertical columns; the number of rows and columns is chosen according to the capacity and the number of boxes of the machine, available to carry out the different sorting passes.
- the number of boxes used can vary from one pass to another.
- This matrix is filled with the numbers which correspond to the quantities of letters assigned to each of the distribution points according to the example of FIG. 1.
- the number 8 appear then the corresponding number 7 respectively at the first point and at the second distribution point.
- the number 3 appears in the first line of column 2 followed by the number 10.
- the number 3 appears in the third column, etc ...
- the route of the postman is read in the matrix of figure 3 and in the following matrices, from the first line of column 1 to line 24, then column 2 from line 1 to line 24, etc ... to column 24, line 24.
- FIG. 4 represents a matrix 24 rows and 24 columns in which the non-zero numbers of the matrix of FIG. 3, have been replaced by the corresponding distribution points 1 to 55. These distribution points follow each other, interspersed with zeros, from the first column to the last.
- the sorting operation by the reverse sorting method is carried out on the basis of the information given by the matrix of FIG. 4.
- This matrix is listed in the memory 21 of the sorting machine.
- the sorting operation consists, for the first pass, of locating each letter by means of the reader 20 and of sending it by means of the automaton 16, in the appropriate box 12 according to its position which is listed in the matrix.
- a letter corresponding to a distribution point which is located in the first line of the matrix is oriented towards box n ° 1; each letter whose destination corresponds to a distribution point placed on line 2, is directed to box no. 2, etc ..., etc ... up to the letters of line 24 assigned to box no. 24.
- line 1 of the matrix in Figure 3 has a total of 8 letters which will be collected in box 1. These letters are intended, according to the matrix shown in Figure 4, for three of them , at distribution point n ° 3, for three others at point n ° 39 and for the last two at point n ° 45.
- Box 2 receives five letters.
- box n ° 10 receives 122 letters, that is to say a quantity clearly greater than its reception capacity. These 122 letters are intended, according to the matrix of FIG. 4, for four of them at distribution point No. 20, for 54 of them at distribution point No. 31 and, for all the others, at point 48. The strict application of the sorting plan will cause excess letters to be assigned to box R as soon as box 10 is full.
- Figure 5 shows an optimized distribution of the quantities of letters allocated to each point, and this for each line and each column of the matrix. Note, in FIG. 5, that the number 54 is placed alone on line 3, column 13. In the same way, the number 64 has been placed only on line 1, column 19. Thus, a first sorting pass carried out according to the distribution of the matrix shown in FIG. 6, will orient the 64 letters corresponding to distribution point no. 48 arranged on line 1, towards box no. 1 with a part, around 14 letters, towards the scrap box R.
- Line 2 has only 34 letters corresponding to distribution point n ° 19, which will be assigned to box n ° 2.
- Line 3 has 54 letters corresponding to distribution point n ° 31, which will be assigned partly to box n ° 3 and the rest to box R scrap.
- the sum of the quantities of letters contained in the other lines is less than 50.
- the same pattern is found for the second pass with the dispatch of the letters arranged in columns 1 to 24, towards boxes n ° 1 to 24.
- column 1 is assigned to box 1
- column 2 is assigned to box 2
- ... column 24 is assigned to box 24.
- Figure 6 shows the position of distribution points 1 to 55, according to the matrix distribution shown in Figure 5.
- Figure 7 shows a solution in terms of the distribution of quantities in the matrix 24-24, which allows, when a row or column contains a number of letters greater than the capacity of the corresponding box, to free the box or boxes which follow this normally overloaded box, in order to be able to direct the surplus letters to this box or these following boxes rather than to the waste bin R.
- This column 14 comprises a total of 59 letters which will be distributed in box n ° 14 for a part, and in the following box n ° 15. Indeed, column 15 is a column filled with zeros. No letter is automatically assigned to this box no. 15. This box no. 15 will be a duplication box which will complement, that is to say increase the capacity of box no. 14 when this box no. 14 will have reached its maximum filling level.
- This particularity has the advantage of not disturbing the distribution of the boxes and especially of allowing during the decasing, to keep the order of the letters when they are taken from the successive boxes with a view to a new positioning in the store if this decasing follows a first pass, or in a box if these letters are decased following the last pass.
- columns 21 and 22 corresponding to boxes n ° 21 and 22 identify these boxes n ° 21 and 22 as duplication boxes of the previous box n ° 20.
- the operator will find letters in almost all of the boxes during the decasing. It will therefore have to perform a relatively large number of decasings, but comparison of what was happening previously, no waste due to overflow is observed which means that all the letters are sorted.
- Figure 9 shows the development of a distribution which limits the number of boxes used on the sorting machine. This operation consists in gathering the quantities of letters in a relatively limited number of rows and columns.
- rows 1 to 8 have only zeros as well as columns 1 to 8, which means that in a sorting machine with 24 boxes, only 16 boxes are useful for performing the sorting operation, both the first pass and the second pass, taking into account the matrix distribution of letter quantities.
- This distribution is arranged in the matrix represented in FIG. 9, in such a way that the large distribution points, that is to say points n ° 31 and 48 in the example of FIG. 1, are isolated or possibly grouped with other points and followed by a column and a line filled with zeros so as to automatically create duplication boxes.
- Line 16 which includes 55 letters, is followed by line 17 filled with zeros.
- Box 17 is a duplication box in box 16.
- column 17 has 79 letters which will be distributed in box 17 and in the duplication box 18 taking into account the fact that column 18 is filled with zeros.
- Box n ° 22 is assigned as a duplication box in box n ° 21 to accommodate the surplus of letters.
- FIG. 10 shows the matrix representation of the distribution points corresponding to the quantities entered in the matrix of FIG. 9.
- the line 9 can correspond to box n ° 1 of the sorting machine which receives the letters from the distribution points 16, 22 and 45.
- the numbers of the boxes are placed to the left of the identification numbers rows and above the column numbers.
- Line 10 corresponding for example to box 2, receives during the first pass, the letters assigned to distribution points 1, 17, 28, 37, 46 and 49.
- Line 16 which corresponds for example to box n ° 8, receives letters intended for distribution points n ° 10 and 31, the number of which is greater than the reception capacity of box n ° 16. The surplus letters will be directed to box n ° 9 qualified as duplication box of the previous box n ° 8.
- Box no. 16 constitutes the duplication box in box no. 15 to receive the surplus of letters.
- Figure 11 shows a sorting machine that has three rows of boxes.
- This sorting machine has a capacity which is for example 36 boxes plus, at the end of each of the lines, waste boxes R.
- This partition of the machine is achievable according to the quantities of mail to be sorted which cannot exceed the reception capacity of the boxes.
- the distribution of the quantities of letters in the preparation matrix of the sorting plan can be carried out preferentially, with an appropriate program which makes it possible to carry out at high speed, the calculations of quantities of objects corresponding to the different distribution points, by row and by column as these points and quantities move in the matrix in order to obtain, as shown in FIGS. 5 and 6, an optimization of the quantities per row and by column or, in FIGS. 7 and 8, an arrangement which achieves automatic duplication of overloaded boxes or, as shown in FIGS. 9 and 10, automatic duplication with reduction of the number of boxes required to perform the sorting operation.
- the optimization module 22 which can be part of the machine, which module is associated with the desk 23, FIGS. 11 and 12, which makes it possible to control the machine.
- the module 22 is connected to the communication network through which the operator can access the data of the lots to be sorted, or else it is equipped with a reader suitable for reading floppy disks 3 or the like.
- the machine shown in Figure 11, has a separating power equal to 16 x 16 for its part A and the same separating power 16 x 16 or 256, for its second part B.
- the capacity of each part A and B of the machine is 800 letters approximately, (50 x the number of boxes).
- a first operation consists in classifying each batch by taking as a criterion the number of distribution points, then in forming groupings.
- Each batch group consists of the first batch not yet grouped in the list, and a set of consecutive batches not yet grouped in the list. Each set must consist of as many lots as possible, themselves the largest possible.
- the grouping criterion is mass sorting possible on a machine “space” allowing sorting in masked time. The number of groups is therefore minimized as well as, consequently, the numbers of task changes and shifts. The process stops when all the batches are grouped.
- each group is taken up (this time seen as a lot), optimized and consolidated. It is therefore necessarily sortable by using a number of boxes that is lower (but close) to the desired machine “space”, while ensuring that the boxes are filled close to their capacity. This grouping is particularly interesting for holiday periods, for example, where the number of letters to distribute can be reduced significantly.
- rectangular or square dies can also be applied to parallelepipedic dies in the case of sorting operations carried out in three passes.
- the route in this case can be read, for example, layer by layer, from front to back, then for each layer, column by column from left to right and for each column, line by line from top to bottom.
- Figure 12 shows schematically another type of sorting machine.
- the boxes 12 or receptacles are distributed over a very long line and each box has a large capacity, greater than 400 or even 500 letters.
- This type of machine can operate continuously, that is to say that it is possible to carry out consecutive sorting operations which are superimposed on the manual crushing operations.
- the process for preparing the sorting plan consists in providing a different filling rate for the boxes and in particular a progressive reduction in the number of objects from the first box served to the last, c '' that is to say that one carries out at the level of the matrix distribution, an optimization of the sum of the objects of each row and of each column of the matrix which follows a progression making it possible to place in the first box 121 a sum of objects close to the maximum capacity of the box whereas for the last box 122, this sum of objects is lower, to be adjusted according to the machine.
- the filling takes the form of a ramp and this optimization process is moreover compatible with the splitting and massification processes developed previously.
Landscapes
- Sorting Of Articles (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9905010 | 1999-04-16 | ||
FR9905010A FR2792227B1 (en) | 1999-04-16 | 1999-04-16 | PROCESS FOR THE PREPARATION OF A SORTING PLAN FOR A LOT OF OBJECTS (PLY, LETTERS, ...) FOR A SORTING MACHINE OPERATING IN REVERSE SORTING |
PCT/FR2000/000960 WO2000062947A1 (en) | 1999-04-16 | 2000-04-13 | Method for preparing a sorting scheme |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1181110A1 true EP1181110A1 (en) | 2002-02-27 |
EP1181110B1 EP1181110B1 (en) | 2003-02-12 |
Family
ID=9544674
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP00918971A Expired - Lifetime EP1181110B1 (en) | 1999-04-16 | 2000-04-13 | Method for preparing a sorting scheme |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP1181110B1 (en) |
AU (1) | AU3973800A (en) |
DE (1) | DE60001405T2 (en) |
FR (1) | FR2792227B1 (en) |
WO (1) | WO2000062947A1 (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE10145295A1 (en) | 2001-09-14 | 2003-04-24 | Siemens Dematic Ag | Distribution order sorting procedure |
ES2372161T5 (en) | 2007-12-13 | 2014-11-13 | Solystic | Procedure for classifying postal items using a dynamic assignment process for sorting outlets |
DE102009011428A1 (en) | 2009-03-03 | 2010-09-16 | Siemens Aktiengesellschaft | Sorting and sorting system with two different groups of output device |
CN112354868A (en) * | 2020-10-15 | 2021-02-12 | 西安邮电大学 | Secondary sorting method of automatic sorting system |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2681263B1 (en) * | 1991-09-18 | 1993-11-12 | Cga Hbs Cie Gle Automatisme | METHOD FOR SORTING OBJECTS. |
JP3389717B2 (en) * | 1994-12-22 | 2003-03-24 | 株式会社日立製作所 | Paper sheet sorting method and apparatus |
JPH09239325A (en) * | 1996-03-11 | 1997-09-16 | Hitachi Ltd | Method for rearranging and sorting postal item delivery order and apparatus therefor |
NL1003154C2 (en) * | 1996-05-17 | 1997-11-18 | Nederland Ptt | Method for sorting by order of mail items. |
-
1999
- 1999-04-16 FR FR9905010A patent/FR2792227B1/en not_active Expired - Lifetime
-
2000
- 2000-04-13 WO PCT/FR2000/000960 patent/WO2000062947A1/en active IP Right Grant
- 2000-04-13 EP EP00918971A patent/EP1181110B1/en not_active Expired - Lifetime
- 2000-04-13 DE DE60001405T patent/DE60001405T2/en not_active Expired - Fee Related
- 2000-04-13 AU AU39738/00A patent/AU3973800A/en not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO0062947A1 * |
Also Published As
Publication number | Publication date |
---|---|
FR2792227A1 (en) | 2000-10-20 |
DE60001405D1 (en) | 2003-03-20 |
WO2000062947A1 (en) | 2000-10-26 |
AU3973800A (en) | 2000-11-02 |
DE60001405T2 (en) | 2003-11-06 |
FR2792227B1 (en) | 2001-07-27 |
EP1181110B1 (en) | 2003-02-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3245147B1 (en) | System and method of sequencing for at least one preparation station | |
EP0533536B1 (en) | Object sorting method | |
FR2524867A1 (en) | METHOD FOR AUTOMATICALLY STACKING, STORING AND PICKING UP GOODS AND DEVICE FOR CARRYING OUT SAID METHOD | |
EP2382058B1 (en) | Machine and method for sorting large-sized postal items and letters | |
EP1722900B1 (en) | Method and device for preparing a postman's route with both letters and large format objects | |
EP1181110B1 (en) | Method for preparing a sorting scheme | |
EP0494014B1 (en) | Preparation of lists of objects to be loaded into containers | |
EP1736250B1 (en) | Process of merging letters and large or non-machine-treatable postal items into a single postman's walk | |
EP2239220B1 (en) | Installation and method for treating printed products | |
EP0597784B1 (en) | Recognition and processing line for publishing products or printed matter | |
EP2569099B1 (en) | Method for improving a process for treatment and transport of postal articles in containers, using batch sorting | |
EP1618969B1 (en) | Method for handling postal items for preparation and separation of postman's routes and according sorting apparatus | |
WO2006013253A1 (en) | Device for sorting and grouping objects, containers and the similar | |
EP1707275A1 (en) | Method of treating postal items with dynamic overflow | |
FR2552686A1 (en) | MODULAR DEVICE AND METHODS FOR CLASSIFYING INDEXED OBJECTS | |
FR2459196A1 (en) | Feed for individual spaced articles in conveyor - has a feeder bin and toothed wheel discharging articles individually and fed via sieve | |
EP1118556B1 (en) | Automatic dispensing system for articles for commissioning one or several orders | |
FR2915850A1 (en) | Seashell e.g. oyster, sorting device for calibrating sea shells, has rope or button conveyor arranged between outlet of automatic alignment units and inlet of another rope and button conveyor that defines housings | |
FR2565852A1 (en) | Method and device for putting objects in order | |
EP0408638A1 (en) | Process and device for storing and conveying articles and presenting them at a fixed station in a given arbitrary order. | |
EP3854728A1 (en) | Installation and method for preparing orders | |
FR3070681A1 (en) | TRANSFERRING A BATCH OF PRODUCTS BETWEEN A TRAY AND THE TOP OF AT LEAST ONE PALLET | |
EP0752577A1 (en) | Method and apparatus for packaging constant-weight slices of meat or fish | |
FR3021306A1 (en) | DEVICE FOR AUTOMATICALLY COLLECTING AND DISPENSING OBJECTS, AND AUTOMATIC DISTRIBUTION SYSTEM CONTAINING SUCH A DEVICE | |
FR2833865A1 (en) | Installation for separating and placing objects comprises first parallel conveyors comprising half elements forming compartments into which objects are housed and driven one by one, then placed in second conveyor receptacle |
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 |
|
17P | Request for examination filed |
Effective date: 20011116 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
17Q | First examination report despatched |
Effective date: 20020618 |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Designated state(s): DE IT |
|
REF | Corresponds to: |
Ref document number: 60001405 Country of ref document: DE Date of ref document: 20030320 Kind code of ref document: P |
|
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: 20031113 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20070327 Year of fee payment: 8 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20070619 Year of fee payment: 8 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20081101 |
|
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: 20080413 |