Sorting method, sorting installation and sorting system
AssigneeMTS Modulare Transport Systeme GmbH
InventorsJohann Robu, Robby Enderlein, Hansjörg Geiger
Life of this patent
Estimating the term…
Abstract
The invention relates to a sorting method for sorting objects, characterised by at least the following sorting steps: a) first sort run, in which objects are input onto parking sections of a first block of parking sections; b) second sort run, in which objects are transferred from the first block of parking sections to a second block of parking sections; and c) third sort run, in which objects are transferred from the second block of parking sections back to the first block of parking sections. The invention also relates to two alternative types of sorting installations which are suitable for carrying out the above sorting method, and to a sorting system which combines a plurality of these sorting installations.
Claims26
Sorting method for sorting objects in a sorting installation with at least the following sorting steps:
- (a) in a first sort run, sorting objects into parking sections of a first block of parking sections;
- (b) in a second sort run;
- sorting by transferring objects from the first block of parking sections into a second block of parking sections;
- and
- (c) in a third sort run, sorting by transferring objects from the second block of parking sections back to the first block of parking sections.
Sorting installation for sorting a plurality of objects in at least three sort runs, having:
- an inputting station (2) for inputting the objects that are to be sorted into the sorting installation;
- an outputting station (13) for outputting the objects that are to be sorted from the sorting installation;
- and
- a plurality of parking sections (7, 8) upon which the objects are respectively stored until a respective sort run has ended,
- characterised by
- dividing the parking sections into a first and a second block (A and B, respectively) of parking sections (7 and 8, respectively);
- a first transfer section (9) which connects the inputting station (2) to the first block (A) of parking sections (7) in such a manner that the latter can be filled from the inputting station (2) in a first sorting step;
- a second transfer section (10) which connects the first block (A) to the second block (B) in such a manner that the objects are transferred direct from the first block (A) to the second block (B) in a second sort run;
- and
- a third transfer section (II) which connects the second block (B) to the first block (A) in such a manner that the objects are transferred direct from the second block (B) back to the first block (A) in a third sort run.
Sorting installation as claimed in claim characterised in that the length of the preliminary storage section (19) is at least equal to the sum of the lengths of the parking sections (7) of the first block (A).
Sorting installation for sorting a plurality of objects in at least three sort runs, having:
- an inputting station (2) for inputting the objects that are to be sorted into the sorting installation;
- an outputting station (13) for outputting the objects that are to be sorted from the sorting installation;
- and
- a plurality of parking sections (7, 8) upon which the objects are respectively stored until a respective sort run has ended,
- characterised by
- dividing the parking sections into a first and a second block (A and B, respectively) of parking sections (7 and 8, respectively);
- a connection which joins the inputting station (2) to the first block (A) of parking sections (7) in such a manner that the latter can be filled from the inputting station (2) in a first sorting step;
- a first set of relocators (24) which connects the first block (A) to the second block (B) in such a manner that the objects are transferred from the first block (A) to the second block (B) in a second sort run;
- and
- a second set of relocators (25) which connects the second block (B) to the first block (A) in such a manner that the objects are transferred from the second block (B) back to the first block (A) in a third sort run.
Dependencies are inferred from the claim text.