EP1425113A1 - Method for sorting in a distribution order - Google Patents
Method for sorting in a distribution orderInfo
- Publication number
- EP1425113A1 EP1425113A1 EP02798691A EP02798691A EP1425113A1 EP 1425113 A1 EP1425113 A1 EP 1425113A1 EP 02798691 A EP02798691 A EP 02798691A EP 02798691 A EP02798691 A EP 02798691A EP 1425113 A1 EP1425113 A1 EP 1425113A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- sorting
- distribution order
- distribution
- points
- virtual
- 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
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S209/00—Classifying, separating, and assorting solids
- Y10S209/90—Sorting flat-type mail
Definitions
- Distribution order sorting of consignments means the process of arranging the consignments to be distributed in a sequence that corresponds to the sequence of the distribution breakpoints, e.g. according to house numbers / mailboxes. These distribution stops are systematically approached or approached by the distributor in his delivery area.
- a distribution breakpoint is not an absolute sorting destination, but a relative position in the distribution order.
- This sorting is manually very complex. Using a sorting machine, this sorting can be carried out with considerably less time, the sorting being based on a sorting plan.
- This sorting plan is a list that assigns addresses to the defined delivery stops, i.e. describes the sequence. In the machine it is the relation between a machine readable address code and the sequence number. Since the number of delivery stopping points is normally greater than the number of sorting compartments of the sorting machines, the distribution order of the items to be sorted is carried out in several sorting runs. The consignments are returned to the sorting machine in the order sorted in the previous run.
- the items are divided into 4 sorting compartments according to the capital letters, ie the first sorting compartment receives all items containing an "A", the second sorting compartment contains all items containing a "B”, etc.
- the sorting compartments are emptied and the items are reinserted into the material inputs, starting with the items of the first sorting bin ("A"), then with those of the second sorting bin ("B") etc.
- the items are sorted according to the number in 5 Sorting bins distributed, ie the first sorting bin receives all mail items that contain a "1" etc.
- Sorting compartment 1 now first the consignments that contain "1A", then "1B” etc. The same applies analogously to all other compartments, so that the distribution order sorting is ended after the second sorting run.
- sorting plan which has a clear relation between the delivery code, i.e. the postcode and the sorting bin within one pass.
- a variant of this method merely establishes a relation between the delivery code and the distribution order number. The sorting bin assignment is made during sorting.
- the distribution order number of a recognized delivery code is known - it is provided by the sorting plan, it must now be translated into a compartment number.
- the distribution order number itself can be viewed as a combination of subject assignment rules, which has the following characteristics, for example:
- the machine has 10 compartments (the distribution sequence number is accordingly a decimal number), the compartments are labeled 0 ... 9, the number of runs is equal to the number of decimal places in the distribution sequence number.
- the distribution sequence number 528 is sorted in 3 runs, in the 1st sort run in compartment 8, in the 2nd sort run in compartment 2, in the 3rd sort run in compartment 5.
- the same distribution order number (528) would be distributed as follows: in the first sort run in compartment 16, in the second sort run in compartment 8.
- the number of digits corresponds to the number of passes required, the number base of each digit corresponds to the number of im subjects available for each sorting run.
- a gradual optimization of the sorting plan can reduce the number of necessary overflow compartments, but not replace them, since the composition and scope of the items remain unknown.
- When emptying the sorting machine and merging the contents of the sorting and overflow compartments operating errors can occur which, under certain circumstances, change the order so much that it is necessary to repeat the sorting.
- US-A 5 363 971 the ZIP codes are read and assigned to distribution breakpoints.
- the assignment of the ZIP codes to the distribution stops is then modified by a microprocessor in order to optimize the distribution of the mail items in the subjects. This is done by not using all possible distribution breakpoints, but by providing reserve breakpoints.
- a special assignment of the ZIP codes to the distribution breakpoints and the placement of the reserve breakpoints between the assigned distribution breakpoints make it possible to distribute the mailings in an improved manner in order to minimize the probability of subject overflows. As a result, only the remaining amount is sorted into the original compartment combination, which results in an unwanted uneven compartment filling. If the fill levels of the sorting compartments are only low, time is lost because the time required to empty a th subject does not differ, or only insignificantly, from emptying a full subject.
- the invention is therefore based on the object of significantly increasing the range of permissible differences in the shipment volume for different distribution stops at the same time frame for the assignment of the sorting compartments to the distribution stops, without overflowing of sorting compartments.
- the shipment quantities statistically determined for the individual real distribution order points of a certain distribution order are divided into the largest possible number of virtual distribution order points, which is formed by the product of the number of sorting compartments in the sorting runs, for the sorting runs before the last sorting run in such a way that the expected shipments are as possible be evenly distributed across the virtual distribution order points.
- the sorting runs preceding the last sorting run are then carried out, in which the actual mail items are distributed as evenly as possible over the determined virtual distribution order points.
- the last sorting run is then carried out in such a way that the items in a distribution sequence are sorted into sorting compartments next to one another.
- a sorting machine for the distribution order can process significantly more distribution order points within a sorting process due to the number of sorting compartments available than is necessary for sorting one or more real distribution orders.
- Real distribution order points with large shipment quantities can thus be divided into many virtual distribution sequence points with the smallest possible shipment quantities.
- time-consuming iterative simulation is no longer necessary, but the shipment is divided up on the basis of statistically determined frequency distributions.
- NSTp number of sorting bins of the machine in the last sorting run
- sorting compartments for the virtual distribution order points of a real distribution order point are arranged side by side.
- the mailings for the sorting runs before the last sorting run are preferably carried out in distribution order layers across all sorting compartments.
- the consignments for the different distribution orders are then separated by sorting them into the adjacent compartments. If after the first division of the real distribution order points into virtual distribution order points, sorting bins are still unoccupied, it is necessary to distribute them as evenly as possible.
- Development of the mailings advantageous to assign the virtual distribution order points to the sorting bins in a further step while maintaining the sequence integrity by means of a random algorithm.
- 2 shows data flows and modules of a system and marks the points at which the invention is used (distribution algorithm); 3 shows a possible distribution of consignment quantities over distribution order points within a specific distribution order, as can occur in reality; 4 shows a possible arrangement of the shipments of two different distribution orders in the first sorting run without using the method according to the invention; 5 shows the arrangement of two distribution sequences in the first sorting run when splitting into virtual distribution sequence points; 6 shows the insertion of sorting bins in the second
- Sorting run for unexpectedly high shipment quantities in the second sorting run.
- distribution order - are derived from a database-supported system, which contain the assignment of the target code information to distribution order points and the expected shipment quantities per distribution order point.
- distribution order sorting planning 2 the predefined distribution orders are based on the available distributed sorting machines. This planning is carried out on the one hand according to the operator's logistical criteria and on the other hand according to the utilization criteria of the machines. In practice, this means that the planner tries to map the operator's logistical criteria to the existing machine park and therefore needs a tool that can constantly check during planning whether the capacity limits of one or more machines have already been reached or not.
- the result of the planning are the distribution order sorting plans 4 for the machines (note: the sorting device for separating the items to be sorted into assignments for each machine - the separating sorting plan 3 - is not considered in this context).
- the distribution order definitions 1 are subjected to an examination in the distribution order sorting planning with the sorting plan management 5, which as a result determines the capacity load on the sorting machine 6 by each of the distribution orders selected for this machine.
- the distribution algorithm which is described in more detail, is used, which later controls the actual sorting in the real sorting machine 6. With this method, it can already be ensured during planning that the arrangement of the distribution sequences on a sorting machine 6 does not exceed its sorting capacity.
- the sorting plan 4 generated for a machine contains the distribution orders with the assignments of the target code information to the distribution order points. This sorting plan 4 is loaded into the machine 6 and the same distribution algorithm, which has already made it possible to determine the distribution in the planning phase, controls in the Machine the real sorting.
- FIG. 3 shows an example of the distribution of 1800 mail items over 180 distribution order points within a single one Distribution order.
- the aim of the method according to the invention is to arrange this uneven distribution on the machine in such a way that the machine is subjected to as little capacity as possible.
- the characteristic values of a machine for 2 sorting runs are: IS - number of sorting compartments (210);
- the characteristics of the distribution order are: NITEM - expected total number of shipments (1800);
- the larger of the values NSTitem and NSTdpn is defined as the number of bins in the second sort run. Then the minimum number of sorting bins required for the first sorting run can be determined.
- Sorting group in the second sorting run a separate virtual machine can be described for each distribution order.
- Table 1 below shows some calculation examples for distribution orders and the calculated virtual machines:
- the method for a real distribution sequence has to be refined.
- the calculation of the sizes of virtual distribution order points and the determination of the resulting distribution to the machine is the central part of the method according to the invention and is carried out separately for each distribution order.
- the respective result is mapped in a virtual machine (a software machine), which adds up the expected fill levels of the sorting compartments.
- the Sortplan Management System only accepts further distribution orders for a particular machine during planning as long as the specified maximum number of items per sorting bin is not exceeded.
- the distribution of a single distribution order is calculated in 4 steps.
- Step 1 Calculation of the characteristic values and minimum requirements of a distribution sequence
- NSTC ⁇ P Capacity of a sorting bin NITEM - Expected number of items in the distribution order NDPN - number of distribution sequence numbers of a distribution sequence (ceil): next larger integer value (float): floating point value
- the number of shipments per virtual distribution order point must be increased from the exact value Erg to the integer value Erg_h. Since the total of all shipments (Vdpn * Erg__h) appears larger than the actual shipment quantity, the integer value Erg_l, which is 1 lower, is also introduced.
- Step 2 The number of virtual distribution order points is calculated for each real distribution order point, the fractional value being divided in relation Erg to the integer values Erg_h and Erg_l.
- Step 3 The one in the distribution of the shipment quantities over the virtual distribution order points of the sizes Erg_h and
- Erg_l overhang on (actually non-existent) shipments is corrected by replacing elements that have arisen from Erg_h with elements from Erg_l.
- Step 4 When distributing the shipment quantities to virtual distribution order points of the sizes Erg_h and Erg_l, the effect can occur that more virtual distribution order points are required than are available (NST2 * NST1). This is corrected by introducing a third size for virtual distribution order points Erg_spec, which can either take a multiple of Erg_h or a multiple of Erg__l of items.
- the allocated virtual distribution order points can be distributed randomly over the available sorting compartments. This prevents a cluster of such virtual distribution order points from occurring in one and the same sorting compartment.
- the planning department reserved a sorting compartment at the "end" of the machine or, with the help of the calculation carried out by the method according to the invention, considered one sorting compartment less than is actually available in the machine.
- the machine checks using the Statistics the expected sorting bin fillings for the second sorting run and determines that the second sorting bin of the distribution sequence 1 should hold more consignments than has been specified for the sorting bin.
- the machine therefore shifts all sorting compartment assignments above the sorting compartment No. 2 under consideration by one position and now assigns the excess items in sorting compartment 2 to the sorting compartment 3 that has become free.
- the sorting can thus be continued without a delay in the process due to a sorting compartment full of situation.
- VDPN Number of possible virtual distribution order points that can be provided for a distribution order
- NSTdpn Number of sorting bins for processing the distribution sequence numbers in the pth (last) sort run.
- NSTp Number of sorting points (subjects) for sorting in the p-th (last) sorting run greater value of NSTitem and NSTdpn.
- Distribution order point should include a distribution order based on the total number of shipments.
- Erg_spec Size of a virtual distribution breakpoint SPECIAL value, multiple of Erg_h or Erg_l.
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10145295A DE10145295A1 (en) | 2001-09-14 | 2001-09-14 | Distribution order sorting procedure |
DE10145295 | 2001-09-14 | ||
PCT/DE2002/003247 WO2003024628A1 (en) | 2001-09-14 | 2002-09-03 | Method for sorting in a distribution order |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1425113A1 true EP1425113A1 (en) | 2004-06-09 |
EP1425113B1 EP1425113B1 (en) | 2006-01-25 |
Family
ID=7699004
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP02798691A Expired - Fee Related EP1425113B1 (en) | 2001-09-14 | 2002-09-03 | Method for sorting in a distribution order |
Country Status (5)
Country | Link |
---|---|
US (1) | US7060928B2 (en) |
EP (1) | EP1425113B1 (en) |
JP (1) | JP2005501716A (en) |
DE (2) | DE10145295A1 (en) |
WO (1) | WO2003024628A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8178811B2 (en) | 2008-01-30 | 2012-05-15 | Siemens Aktiengesellschaft | Method and apparatus for sorting flat objects in a number of sorting passes |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102004035365A1 (en) * | 2004-07-21 | 2006-02-16 | Deutsche Post Ag | Method and device for sorting mailpieces |
US7671293B2 (en) * | 2004-09-08 | 2010-03-02 | Lockheed Martin Corporation | System and method for dynamic allocation for bin assignment |
US7923655B2 (en) * | 2004-11-03 | 2011-04-12 | Pitney Bowes Inc. | Sorting method and system with dynamically re-allocated sortation bins |
US7769765B2 (en) | 2006-07-25 | 2010-08-03 | Lockheed Martin Corporation | Method and system for sorting mail |
US8172090B1 (en) | 2007-08-27 | 2012-05-08 | DST Output West, LLC | Large and small document combination optimization for document sequencing system |
US20090223872A1 (en) * | 2008-03-07 | 2009-09-10 | Ronald Robbins | System and method for sorting items |
DE102008058843A1 (en) | 2008-11-14 | 2010-05-20 | Siemens Aktiengesellschaft | Sorting system with several output devices and sorting method |
DE102008062841A1 (en) | 2008-11-25 | 2010-06-02 | Siemens Aktiengesellschaft | Sorting system for sorting objects, particularly for sorting flat mails, has conveyer device with support device, where base and support device are arranged such that both base plane and supporting plane are inclined steeply at edge |
FR2945462B1 (en) * | 2009-05-15 | 2011-04-22 | Solystic | METHOD FOR SORTING POSTAL SHIPMENTS IN A LOW CAPACITY MACHINE |
JP2015150478A (en) * | 2014-02-12 | 2015-08-24 | 株式会社東芝 | Sorting device and generation method of sorting setting information |
EP3208003B1 (en) * | 2016-02-18 | 2018-04-18 | BEUMER GmbH & Co. KG | Sorting device with adjustable destinations and method using such a device |
CN110648091B (en) * | 2018-06-27 | 2024-01-16 | 北京京东乾石科技有限公司 | Article sorting method and device |
CN112354868A (en) * | 2020-10-15 | 2021-02-12 | 西安邮电大学 | Secondary sorting method of automatic sorting system |
CN115138585A (en) * | 2022-07-18 | 2022-10-04 | 东莞市世晨自动化设备有限公司 | Needle matching method and automatic grabbing needle matching equipment |
Family Cites Families (10)
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. |
US5363971A (en) * | 1992-10-16 | 1994-11-15 | United States Postal Service | Automatic carrier sequence bar code sorter |
DE4302231C2 (en) * | 1993-01-28 | 1995-08-10 | Licentia Gmbh | Process for sorting mail items in the distribution aisle sequence in mail distribution systems |
JPH09239325A (en) * | 1996-03-11 | 1997-09-16 | Hitachi Ltd | Method for rearranging and sorting postal item delivery order and apparatus therefor |
DE19625007C2 (en) * | 1996-06-22 | 2000-03-02 | Siemens Ag | Procedure for sorting the distribution order |
DE19647973C1 (en) * | 1996-11-20 | 1997-09-25 | Aec Electrocom Gmbh | Method for distribution of mail |
FR2792227B1 (en) * | 1999-04-16 | 2001-07-27 | Poste | PROCESS FOR THE PREPARATION OF A SORTING PLAN FOR A LOT OF OBJECTS (PLY, LETTERS, ...) FOR A SORTING MACHINE OPERATING IN REVERSE SORTING |
US6316741B1 (en) * | 1999-06-04 | 2001-11-13 | Lockheed Martin Corporation | Object sortation for delivery sequencing |
IT1307718B1 (en) * | 1999-10-07 | 2001-11-14 | Elsag S P A | METHOD OF OPTIMIZATION OF A SEQUENCING PROCESS OF POST OBJECTS. |
US6741908B2 (en) * | 2000-08-23 | 2004-05-25 | Lockheed Martin Corporation | Mail bin sort sequence binary file generator |
-
2001
- 2001-09-14 DE DE10145295A patent/DE10145295A1/en not_active Withdrawn
-
2002
- 2002-09-03 DE DE50205721T patent/DE50205721D1/en not_active Expired - Lifetime
- 2002-09-03 WO PCT/DE2002/003247 patent/WO2003024628A1/en active IP Right Grant
- 2002-09-03 JP JP2003528317A patent/JP2005501716A/en active Pending
- 2002-09-03 EP EP02798691A patent/EP1425113B1/en not_active Expired - Fee Related
-
2004
- 2004-03-08 US US10/793,763 patent/US7060928B2/en not_active Expired - Lifetime
Non-Patent Citations (1)
Title |
---|
See references of WO03024628A1 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8178811B2 (en) | 2008-01-30 | 2012-05-15 | Siemens Aktiengesellschaft | Method and apparatus for sorting flat objects in a number of sorting passes |
Also Published As
Publication number | Publication date |
---|---|
JP2005501716A (en) | 2005-01-20 |
US7060928B2 (en) | 2006-06-13 |
WO2003024628A1 (en) | 2003-03-27 |
EP1425113B1 (en) | 2006-01-25 |
US20040182759A1 (en) | 2004-09-23 |
DE10145295A1 (en) | 2003-04-24 |
DE50205721D1 (en) | 2006-04-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE19625007C2 (en) | Procedure for sorting the distribution order | |
EP0939679B1 (en) | Method and device for distributing mail items | |
WO2003024628A1 (en) | Method for sorting in a distribution order | |
EP1222037B1 (en) | Method and device for sorting parcels | |
DE60038347T2 (en) | Method for optimizing a mail sorting process | |
DE19709232A1 (en) | Mail delivery order array partitioning method | |
DE102008003778A1 (en) | Method and device for transporting and processing a plurality of objects | |
WO1999007487A1 (en) | Method for sorting mail items | |
EP1220721B1 (en) | Device and method for classifying flat mail items | |
DE102008007009A1 (en) | Method and device for transporting objects | |
DE60005549T2 (en) | METHOD AND DEVICE FOR MIXING ORGANIZED GROUPS OF OBJECTS, IN PARTICULAR GROUPS OF MAIL PIECES | |
DE102006029732B3 (en) | Method for bringing together manually processed flat transmissions, involves pre-sorting manually processed transmissions corresponding to route sections and afterwards sorting in area corresponding to respective route sections | |
DE102012214856A1 (en) | Method for presorting in plate storage, involves storing and stacking plates in storage space inside storage space group, and setting number of plates required for planned production, where free capacity of each storage space is determined | |
EP1409161A1 (en) | Method for sorting postal articles on automatic sorting devices | |
DE102009019054A1 (en) | Method and device for sorting objects in two sorting operations | |
DE10310760B3 (en) | Process for sorting letters according to their destination in sorting machines in several sorting runs located in sorting centers according to the radix process uses sorting centers having several delivery posts in which postmen are active | |
EP2011578B1 (en) | Method and device for sorting objects into several cycles in order of delivery | |
EP2067535A1 (en) | Method for sorting flat postal packages | |
DE60300164T2 (en) | Apparatus and method for the selective production of stacks of printed products | |
EP2226130A1 (en) | Sorting method and assembly with two different groups of dispensing devices | |
DE19629125C2 (en) | Procedure for sorting shipments | |
EP3456423B1 (en) | Method for merging of mail items for a delivery area | |
DE4428446C2 (en) | Process for controlling the double material input of mail distribution systems | |
WO1999064172A2 (en) | Device for sorting out consignments | |
DE202023100186U1 (en) | picking system |
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: 20040209 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
17Q | First examination report despatched |
Effective date: 20040915 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
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): BE DE FR GB IT |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) |
Effective date: 20060216 |
|
REF | Corresponds to: |
Ref document number: 50205721 Country of ref document: DE Date of ref document: 20060413 Kind code of ref document: P |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: BE Payment date: 20060919 Year of fee payment: 5 |
|
ET | Fr: translation filed | ||
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20060930 Year of fee payment: 5 |
|
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: 20061026 |
|
BERE | Be: lapsed |
Owner name: *SIEMENS A.G. Effective date: 20070930 |
|
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: 20070930 |
|
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: 20070903 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R084 Ref document number: 50205721 Country of ref document: DE Effective date: 20120712 |
|
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: GB Payment date: 20170912 Year of fee payment: 16 Ref country code: FR Payment date: 20170918 Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20180110 Year of fee payment: 16 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 50205721 Country of ref document: DE |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20180903 |
|
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: 20190402 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180930 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180903 |