Efficient return management

Abstract

The invention relates to a method and a storage system (10), in which goods are stored type-specifically in storage spaces (22) and which is configured to type-specifically return to store returned goods which are to be provided mixed in at least one return container (RB), the storage system comprising: the storage spaces (22); a workstation (14) which has a fixedly predefined plurality of buffer spaces (16); and a control device (12) which comprises: a recording unit (40) for recording a return container goods type list which indicates, for each of the return containers, the goods types contained therein; and a generating unit (42) for generating, on the basis of the list (30), an assignment table (32) which defines a number N of distribution operations to be carried out sequentially, wherein each of the N distribution operations is assigned an individual sequence number (SEQ#) in the assignment table (32), wherein the returned goods are removed distribution-operation-specifically from the at least one return container (RB) during the operations and are distributed to the buffer spaces (16), wherein each of the buffer spaces (16), distribution-operation-specifically according to the table (32), is either a destination space (18) for a current operation or a collection space (20) for a future operation; and wherein the system (10) is configured to carry out the operations sequentially according to a predefined sequence of the sequence numbers (SEQ#) in that the returned goods from all the return containers (RB) are distributed to the buffer spaces (16) according to their goods types (TYP) and according to the table (32).

Description

Applicant: SSI Schäfer IT Solutions GmbH Friesachstrasse 15 8114 Friesach AUSTRIA Efficient returns management The present disclosure relates generally to the handling of returned goods in an intralogistics system, such as a storage and order picking system, and in particular to the storage or restocking of returned goods specific to the type of goods in an automated storage system in which the goods are stored in storage locations according to type. "Returned goods" generally refers to items that customers send back to a seller or retailer after a purchase. This can happen for various reasons, particularly in the fashion industry. The customer may have received a different item than ordered. The item may not be the desired size or color. The item may have been damaged upon delivery or may not be functioning properly. The item may not meet the customer's expectations, or the customer may have changed their mind. The item may be defective, and the customer may be making a warranty or guarantee claim. Finally, the manufacturer or seller may have issued a recall due to a problem. Returned goods are an essential part of the returns process and pose a challenge for the (intralogistics) warehouse management of the seller or retailer operating the warehouse system. Returned goods often need to be inspected, refurbished, or repackaged before they can be resold. In some cases, returned goods are also sold as B-stock, outlet goods, or in special returns promotions if they cannot be classified as new. This disclosure focuses primarily on the intralogistics aspects of returned goods. Handling returned goods, i.e., their restocking in their designated storage location, is challenging for several reasons. Before returned goods can be put back into storage, they must be thoroughly inspected to ensure they are in perfect condition or, if damaged or used, correctly categorized. This requires additional time and resources. Returns must be sorted and classified or categorized according to their product type, especially if they are returned "mixed" by the customer, meaning a single package contains multiple items of different types. Each returned item should be carefully documented and entered into the warehouse management system (data management). It should be ensured that all relevant information, such as condition, expiration date, size, color, etc., is recorded.The goods must be recorded, especially if the information is specific to the product type. Returns take up additional warehouse space that is often unplanned. This can lead to bottlenecks and disrupt normal warehouse operations. Returns often mean additional costs for the seller, not only through processing and restocking, but also through potential losses if the goods can no longer be sold as new. Furthermore, finding the right storage locations for returned goods is challenging, especially if the warehouse is already well-stocked or if the warehouse technology is designed for high turnover rates. Returns also frequently need to be handled, which is time-consuming and labor-intensive, and makes automating returns handling difficult or even impossible. Finally, returns involve large quantities of goods.In the fashion industry, it is expected that up to 40% of delivered goods will be returned. Furthermore... Destruction of returned goods is ethically unacceptable due to the high effort and associated costs, and is already prohibited by law in many places. Finding the right storage locations for returned goods is challenging for several reasons: Storage locations are often reserved for specific types of goods and quantities (storage space volume), and warehouse management systems are optimized to efficiently handle new deliveries (goods receipts, including returns). Returns can arrive unexpectedly and require additional space that wasn't originally planned for, complicating inventory management and storage space availability. Returns often come back in varying conditions: new, slightly damaged, heavily damaged, or used. These different conditions may require different storage locations (despite the same type of goods) and potentially special handling, further complicating (goods-type-specific) restocking.Returned goods should be allocated storage locations in a way that optimizes the use of available storage space, particularly by storing them in locations already occupied by the same type of goods, rather than in empty locations for which no type of goods has yet been defined or specified. This can be challenging when the warehouse is already well-stocked or the originally designated storage locations are being used for other purposes. In a dynamic warehouse environment where goods are constantly being received and retrieved, returns must be seamlessly integrated without disrupting the flow of normal warehouse operations. This requires precise planning and coordination. Therefore, the warehouse management system should be capable of efficiently processing returns and quickly assigning them to suitable storage locations.In some cases, systems are not sufficiently flexible or up-to-date to meet the demands of returns handling. Certain returns, particularly those of high value or with specific requirements (e.g., perishable goods or electronics), may need to be stored in specially secured or suitable locations. This can further limit the available options. To maximize the efficiency of warehouse resource utilization, storage space must be used optimally. Returns that cannot be immediately resold or processed occupy valuable space needed for other, more readily turnover goods. These factors mean that allocating storage locations for returned goods is a complex task requiring careful planning and a well-organized system to avoid disrupting warehouse operations. Therefore, returns should preferably be moved back to their already assigned storage locations. These challenges mentioned above make handling returned goods complex and require well-thought-out intralogistics processes and systems to ensure that the goods can be efficiently and correctly reintegrated into the warehouse according to type. Traditionally, returned goods are identified and sorted (semi-)automatically. Sorting can be done using rotating tray sorters equipped with a scanning function. Additionally, so-called put walls are used. A put wall is a rack in which items are placed, collected, and buffered according to customer orders until all items for the order are present in the rack. Put walls are often operated in conjunction with a pick-by-light / put-to-light system. Flow racks are also used for sorting. According to its title, DE 102015 118 832 B3 relates to a storage and order picking system as well as a method for storing unit loads in an automated order picking system. According to its title, DE 102014 115 579 A1 concerns a procedure and system for progressive order picking. According to its title, DE 102007 034 705 A1 relates to a system and method for handling returned goods in a picking plant. Therefore, one objective of this disclosure is to improve the restocking of returned goods in a single-type storage system. In particular, the limited space available in the storage system must be taken into account. Furthermore, it would be desirable to restock the returned goods directly, i.e., to avoid handling them repeatedly. This task is solved by a storage system in which goods are stored in storage locations according to type and which is set up to store returned goods in a type-separated manner. These returned goods, with regard to their product types, are to be provided in at least one return container and comprise: the storage locations that are operated according to type; a workstation that has a fixed number of buffer locations, wherein the total number of different product types of the returned goods is greater than a number M of buffer locations; and a control device that comprises: a recording unit for recording a return container product type list, which specifies the product type(s) contained in each of the return containers;and a generation unit for generating, based on the return container goods type list, an allocation table that defines a number N of sequential distribution operations, wherein each of the N distribution operations is assigned an individual sequence number in the allocation table, wherein the returned goods are taken from the at least one return container during the distribution operations in a distribution operation-specific manner and distributed to the buffer locations, wherein each of the buffer locations is, in accordance with the allocation table, either a target location for a distribution operation currently being carried out or a collection location for a distribution operation to be carried out in the future;and wherein the storage system is set up to carry out the distribution operations sequentially according to a pre-defined sequence of sequence numbers, by distributing the returned goods from all return containers to the buffer locations according to their goods types and according to the allocation table. The present concept enables the efficient singulation of returned goods with the aim of returning them to inventory, taking into account the existing, space-limited warehouse infrastructure and employing an intelligent approach. Provided that the return containers are clearly identifiable and their contents (goods type and quantity) are known, the corresponding procedure aims to singulate the maximum number of items directly through a single transfer, particularly without any search time within the return container. Those returned goods that cannot be immediately singulated or stored back in the warehouse only need to be handled a second time, at most, for singulation by type. Returned goods are handled as little as possible, preferably only once. Return containers are preferably emptied immediately, so no storage space is required. This concept is highly efficient. Returned goods are reliably and quickly returned to their designated storage locations. From each return container, at least one item of the returned goods it contains is directly stored back into the system without undergoing further distribution. There is no need for a time-consuming search for a specific type of product within the return container, because any product type can be selected and then reliably distributed to one of the buffer locations. Preferably, the production unit comprises: a first allocation unit that assigns each of the N distribution operations an individual sequence number in the allocation table; a second allocation unit that assigns each of the product types of the returned goods exactly one of the sequence numbers in the allocation table; and a third allocation unit that assigns each of the sequence numbers a distribution operation-specific number of collection points, wherein each of the distribution operation-specific collection points is assigned to one of the distribution operations to be carried out in the future. Assigning individual sequence numbers to distribution processes, product types, and collection points improves the control and tracking of goods movements. This precise assignment minimizes distribution errors and ensures that each item is processed at the correct stage of the process. The specific allocation of collection points optimizes the use of available storage space and prevents bottlenecks. Preferably, the storage system also includes at least one of the following storage components: a return container conveyor system; a storage container conveyor system; and / or a rack. The use of conveyor systems and racking enables the automation of goods movements, increasing efficiency and reducing manual labor. The integration of various warehouse components allows for flexible adaptation to different storage requirements and scaling of the system as needed. A well-structured warehouse environment with appropriate racking and conveyor systems leads to better organization and faster access to goods. Preferably, the workstation further comprises: a put-to-light system configured to indicate to an operator by means of light a provided return container from which one of the returned goods is to be taken, and / or one of the buffer locations into which the taken returned goods are to be placed; and / or a goods type identification unit configured to identify the goods type of the taken returned goods; wherein the workstation is preferably a picking station configured for reverse picking. The put-to-light system clearly indicates to the operator which return container to take goods from and where to transfer them, thus increasing accuracy. The product type identification unit speeds up the identification process and minimizes the time required for manually checking product types. Visual guidance and automatic identification significantly reduce errors during distribution and restocking. Preferably, the buffer spaces are implemented as: shelf compartments of a one- or two-sided open (shelf) rack; storage locations of a floor storage system that are clearly separated from each other; trays of a continuously operated sorting system; and / or flow channels of a flow rack. Different implementations of buffer zones allow for adaptation to various storage types and goods. These diverse implementations offer flexible solutions for optimal space utilization and rapid goods accessibility. The ability to utilize buffer zones in various configurations increases the system's adaptability to specific storage requirements. Furthermore, the problem is solved by a method for the type-segregated return storage of returned goods, mixed with respect to product types, contained in at least one return container, in a storage system at a workstation that has a fixed number of buffer locations, wherein the total number of different product types is greater than a number M of buffer locations, wherein the method comprises: providing a return container product type list that specifies the product type(s) contained in each of the return containers; and (preferably computer-implemented) generating, by a control device of the storage system, (and in particular storing) an allocation table based on the return container product type list, wherein in the allocation table: a number N of distribution operations to be carried out sequentially is defined, wherein each of the N distribution operations is assigned an individual sequence number (or another ID);Each of the product types is assigned exactly one of the sequence numbers, and each of the sequence numbers is assigned a distribution-process-specific number of collection points, each of which is one of the buffer points where, during a distribution process currently being carried out, those product types are collected in a distribution-process-specific manner whose assigned sequence number differs from the sequence number assigned to the distribution process currently being carried out according to the assignment table; and sequential execution of the distribution processes in a predefined order according to the sequence numbers, by distributing the returned goods from all return containers to the buffer points according to their product types and according to the assignment table. The use of the returns container goods type list enables precise and efficient storage of returned goods, as the goods types are known in advance and can be distributed accordingly. By assigning sequence numbers to the distribution processes and product types, handling time is minimized, as the returned goods are distributed systematically and in an orderly manner. The allocation table ensures that each returned item is correctly distributed according to its sequence number and product type, thereby increasing the accuracy of the restocking process. The distribution process-specific allocation of buffer and collection points optimizes the use of available storage space and ensures orderly interim storage of returned goods. Performing the distribution processes sequentially according to the defined sequence numbers brings structure to the storage process and prevents chaos in the handling of returned goods. The clearly defined allocation and sequential execution of the distribution processes reduces the risk of errors in the restocking of returned goods. The entire method leads to a more efficient handling of the restocking process, as goods can be processed and distributed faster and more precisely. Preferably, the distribution process includes: a) providing all return containers at the workstation, containing those of the product types to which the sequence number of the currently being processed distribution process is assigned in the allocation table; b) emptying, preferably completely, each provided return container by separating all returned goods contained in the respective return container;For each of the individual returned goods, the corresponding goods type is identified and transferred to one of the buffer locations, wherein each of the individual returned goods whose identified goods type corresponds to the current sequence number is transferred to one of the buffer locations that is currently being assigned to the respective identified goods type by a first-time transfer or that is already assigned to the respective identified goods type by a previous transfer of another of the individual returned goods of the same goods type, and wherein each of the individual returned goods whose identified goods type is assigned to a sequence number different from the current sequence number is transferred to the collection location that is assigned to the respective identified goods type by the assignment table;c) when all individual returned goods have been transferred to the corresponding buffer locations, each of the destination locations is emptied by returning its goods by type to a corresponding storage location in the storage system; and emptying each of the collection points into an intermediate container, which will be handled like one of the return containers during future distribution operations; and d) then proceeding to the next sequence number of the order, if any, and repeating steps a) to d), or terminating the procedure if there is no next sequence number according to the order. Completely emptying the return containers and proceeding sequentially minimizes handling time and increases throughput. Structured and efficient restocking of goods allows for faster processing and reduction of returned goods inventory. This sequential and systematic approach improves the organization and traceability of goods movements within the warehouse. Preferably, the return container goods type list also specifies a quantity of the corresponding returned goods for each of the return containers and for each type of goods contained therein. The quantities provided enable capacity planning. If there are too many units of a particular product type, a single buffer location may not be sufficient to accommodate them all. In such cases, this product type should be distributed across multiple buffer locations. These effects can be calculated in advance. Furthermore, specifying the quantities allows for precise inventory management and facilitates the tracking and management of returned goods. Accurate knowledge of the quantities supports the planning and optimization of the returns process. Preferably, the number of collection points that can be assigned to a given sequence number (SEQ#) corresponds to a difference between the highest sequence number and the respective sequence number. This ensures that all goods from a returns container can be safely distributed to the buffer areas. Multiple handling, especially more than twice, is avoided. Putaway becomes more efficient. In other words, as the number of passes increases, fewer and fewer collection points are needed for future passes. Preferably, the allocation table is further generated based on at least one of the following parameters: product master data for the product types contained in the return container product type list, representing the geometric dimensions of the returned goods; and infrastructure information representing the geometric dimensions of the buffer locations. The use of specific product master data and infrastructure information enables tailored and optimized warehouse management, particularly in planning the storage capacities of buffer zones. Considering the geometric dimensions of the goods and buffer zones leads to more efficient use of the available space. Preferably, generating the allocation table further comprises at least one of the following steps: optimization by minimizing the number N of distribution operations to be carried out; optimization by maximizing the number of returned goods that can be stored directly (i.e., without an intermediate collection step); and / or optimization by minimizing the number of collection points required per distribution operation. The various optimization strategies lead to an overall more efficient process flow and reduce workload. Minimizing distribution processes and collection points reduces operating costs and increases the efficiency of the warehouse system. Ideally, each returned item should go through each distribution process a maximum of two times. Fewer distribution processes reduce the likelihood of errors and improve the system's accuracy. Limiting the number of distribution operations to a maximum of two reduces handling times and speeds up the entire storage process. Preferably, a maximum number k of the different types of goods that can be stored separately by type is defined by k = (M x (M +1)) / 2. The mathematical definition enables scalable and predictable warehouse management based on the number of buffer spaces. A clear definition of the maximum number of product types supports the planning and optimization of back-stock operations. Preferably, the sequence number assigned to each product type according to the allocation table determines the corresponding distribution process in which the returned goods are returned to the warehouse system without undergoing a further distribution process. This fixed assignment of sequence numbers reduces the complexity of the return process. Direct storage without additional distribution processes increases efficiency and reduces processing time. It is understood that the aforementioned features and those to be explained below can be used not only in the combinations specified, but also in other combinations or on their own, without leaving the scope of the present concept. Examples of the concept are shown in the drawings and are explained in more detail in the following description. They show: Fig. 1 shows a block diagram of a storage system; Fig. 2 shows a list of return container types and an allocation table; Fig. 3 shows a first pass of a multi-stage distribution process at a workstation with four buffer locations; Fig. 4 shows the assignment table of Fig. 2 in a modified representation; Fig. 5 shows a second pass of the multi-stage distribution process; Fig. 6 shows a third pass of the multi-stage distribution process; Fig. 7 Analysis results for the assignment table of Figs. 2 and 4 (FIG. 7A) and for an initial assignment table (Fig. 7B); Fig. 8 the initial assignment table; Fig. 9 shows an alternative representation of the initial assignment table of Fig. 8; Fig. 10 shows a first part of a method for storing returned goods; Fig. 11 shows a second part of the process; Fig. 12 shows a third part of the process; Fig. 13 is a block diagram of a control device of the bearing system of Fig. 1; Fig. 14 shows a processing circuit; and Fig. 15 shows a hardware configuration of the control unit. The present concept is generally used in intralogistics, and particularly in the handling of returned goods. The term "intralogistics" refers to the organization, control, execution, and optimization of all internal material flow and storage processes. This discipline encompasses the management of goods movements within a company's boundaries, including warehousing, transportation, and distribution. Intralogistics plays a crucial role in the efficiency and productivity of production and warehousing operations by integrating modern technologies and systems such as automated conveyor systems, robots, warehouse management software, and advanced information technologies. The main goals of intralogistics are to optimize the flow of goods within a company in order to shorten delivery times, reduce costs, improve space utilization, and / or increase productivity. By using intralogistics systems, a company can make its internal processes more efficient. The term "material flow" refers to the movement of goods within, through, or out of a production and / or storage area. It encompasses all processes related to the physical movement of goods, including transportation, storage, order picking, and delivery. Material flow is a core component of intralogistics. Its aim is to optimize efficiency in the production and distribution of goods and to ensure they are available at the right place at the right time. Effective material flow management minimizes downtime, reduces inventory levels, and accelerates order processing and return to stock. Optimizations in material flow can be achieved through automation, improved facility layouts, and the use of advanced planning and control systems. The present concept is used for the restocking (especially through inverse picking) of returned goods (returned items) which are to be stored in a single-type manner, e.g. in storage containers 24 in a storage system 10 (hereinafter also referred to as "warehouse"). Fig. 1 shows a block diagram of the intralogistics storage system 10, which can be used in the implementation of the present concept. The storage system 10 comprises: a control unit 12; a workstation 14 with a plurality of buffer locations 16, each of which can be operated either as a destination location 18 or as a collection location 20; and a plurality of storage locations 22 for storing storage containers 24, for example in a rack 26. The control unit 12 can be implemented centrally or decentrally. The control unit 12 is a data processing system (computer system) and can, for example, implement the functions of a warehouse management computer, a material flow computer, an order processing computer, a storage location management computer, and / or another computer commonly used in an intralogistics system. The control unit- Direction 12 is set up to perform one or more calculation processes, as will be explained below. The storage system 10 of Fig. 1 can further comprise a conveying system 28, which may include one or more continuous conveyors (e.g., roller conveyors, belt conveyors, chain conveyors, overhead conveyors, etc.) and / or one or more discontinuous conveyors (e.g., automated guided vehicles, drones, etc.), which are not shown. The conveying system 28 can be implemented by one or more conveying technologies. Storage system 10 can be configured for order picking, and in particular for reverse order picking. In storage system 10, goods are stored by type in storage locations 22. Storage system 10 can also be configured to store returned goods by type, which – with regard to their product types – can be mixed and provided in at least one return container. The workstation 14 described above can be a standard picking station in storage system 10, configured for reverse picking. Preferably, it is a goods-to-person workstation. The term "order picking" generally refers to a process in which specific (individual) goods, items, products, etc., are assembled from a total assortment according to picking orders (i.e., customer orders). In this description, the terms goods, items, products, and similar terms are used interchangeably. The order picking process is a central component of distribution or production logistics. The process typically begins with the receipt of a customer order, after which the required goods are retrieved from stock, packed, and prepared for shipment. Order picking can be performed manually by a person or automated using technical systems such as robots or automated storage and retrieval systems that deliver the necessary goods directly to the person picking or the robot.When a person or human being is mentioned here, a robot is always also meant as an alternative. This means with others. In other words, no distinction will be made between manual and automated handling of individual goods. "Reverse picking" is a concept where the picking process (removing goods from storage containers and placing them in order containers according to customer orders) is carried out in reverse order (and without a picking order). The goal of reverse picking is to reintegrate returned goods (returned goods) back into warehouse 10 (restocking). Particularly in the context of returned goods, reverse picking generally means: that returns from customers (B2C) and / or branches or retailers (B2B) are sent back and must be reintegrated into warehouse system 10, which may include identification, inspection, and sorting of the returned goods; that the returned goods are identified upon arrival at warehouse 10 and matched with corresponding return orders and storage locations 22, which, for example,by scanning, with a scanner 27, barcodes on the returned goods or by other identification methods; that the goods are distributed to suitable storage locations 22 according to their category (type of goods) and their condition; that information about the returned goods can be entered into a warehouse management system (WMS) to update inventory and reflect the availability of the goods; and / or that care is taken to store the goods efficiently in order to make optimal use of the storage space and to facilitate access to the (returned) goods when they are to be resold or further processed. Reverse picking offers several advantages. A systematic approach allows returns to be quickly and efficiently reintegrated into warehouse 10. Careful inspection and documentation of returned goods ensures that inventory is accurately updated. Rapid reintegration of saleable returns minimizes financial losses and increases sales. Targeted storage location allocation (using a warehouse management system) optimizes available space and prevents delivery bottlenecks. However, this process requires careful planning and coordination to be efficient. For example, a robust warehouse management system may be desirable to support the returns process and ensure accuracy. To support order picking, workstation 14 can be equipped with a "put-to-light" system 29. This is a system commonly used in warehouses and distribution centers for the efficient and precise picking (removing items from the warehouse stock and placing them according to the picking order) of goods. It is similar to a "pick-to-light" system, but there are differences in how the picking process is carried out. The main features and operation of a "put-to-light" system 29 are described below. In the "put-to-light" system 29, goods are taken from a large quantity (e.g., from a pallet or a container) and distributed into various containers (often crates or boxes). The system 29 uses indicator lights and displays to show the operator which container, in particular which buffer location 16, the removed (returned) goods should be transferred to. Each destination (destination location 18 or collection location 20) can be equipped with an indicator light (e.g., lamp, LED, etc.). The light illuminates at the corresponding location where the picker is to place the goods. An (additional) display can show the number of goods (piece count) to be transferred to this location. The picker places the displayed number of goods into the destination container and can then perform the action, e.g.,Confirmation is obtained by pressing a button or activating a sensor. The light then goes out, and System 29 can display the next location where goods are to be placed. One advantage of the "Put-to-Light" System 29 is the reduction in time required for searching for, placing, or transferring goods, as the light indicators guide the operator. Furthermore, System 29 can minimize errors because the operator can clearly see where the goods are to be transferred, e.g., placed. System 29 is flexible because it can be adapted for different types of orders and varying quantities. The numbers can be adjusted. Furthermore, System 29 is ideal for distributing goods with high variance in size and quantity. The following describes an exemplary case, with reference to Fig. 2, of how a group of, for example, thirty-four (individual) returned goods, which were sent back to an operator of storage system 10 in, for example, five return containers (RB#1 to RB#5), are returned to storage system 10 in a single-type manner. The total quantity or number of units (STKZ) of returned goods is therefore thirty-four in this example. These thirty-four returned goods comprise nine different product types (TYPE#1 to TYPE#9). The thirty-four units could thus be distributed across more or less different product types. A return container is a container (e.g., a carton, a package, a plastic container, etc.) that is sent back by a customer to the operator of storage system 10 and that contains the returned goods, preferably those of a specific product type, that are already present or were previously present in storage system 10.Typically, the operator of warehouse system 10 has previously picked and shipped the returned goods to the customer. The return container can also be one of the storage containers 24, especially if the return container is being sent back to a central warehouse by a retail chain. However, such return storage containers cannot usually be directly returned to storage because the returned goods are mixed together, so prior sorting by product type is necessary. Figure 2 illustrates a corresponding return container goods type list 30 in tabular form. List 30 can be created by the customer (and attached to the return container, e.g., in paper form). List 30 can be transmitted electronically by the customer to the operator of the storage system 10 in advance. List 30 can also be created by the operator of the storage system 10 by identifying, counting, and recording the goods in each of the return containers, e.g., as part of a returns receipt check. The first left column of list 30 in Fig. 2 lists the five return containers RB#1 to RB#5 from top to bottom. The second column of list 30 indicates which of the nine product types, TYPE#1 to TYPE#9, belongs in which return container RB#1. up to RB#5. The third column of list 30 indicates the corresponding quantities (STKZ). For example, the first return container RB#1 contains: one piece of returned goods of the first product type TYPE#1; two pieces of returned goods of the second product type TYPE#2; one piece of returned goods of the sixth product type TYPE#6; one piece of returned goods of the seventh product type TYPE#7; and two pieces of returned goods of the ninth product type TYPE#9. The contents of the remaining return containers RB#2 to RB#5 are determined analogously from list 30 in Fig. 2. Each of the return containers RB#1 to RB#5 in Fig. 2 is "mixed." This means that each of these return containers contains at least two returned items representing different product types. At least one of the return containers RB#1 to RB#5 should contain mixed items, while the others could contain items of a single type. Each returned item is associated with an individual product type. In the clothing industry, for example, a shirt in a certain size and color represents a first product type, while another shirt in the same size but a different color represents a second product type, and yet another shirt in a different size but the same color represents a third product type. Fig. 3 schematically illustrates a first distribution process, hereinafter also referred to as a distribution pass or simply a pass, in which the returned goods are distributed from specific containers of the return containers according to list 30 of Fig. 2 at workstation 14 to, for example, four buffer locations 16 according to an allocation table 32, the structure and creation of which are explained in more detail below. A buffer location 16 is understood to be a clearly defined area where one or more pieces of returned goods can be temporarily deposited, stored, or collected. The maximum number of returned goods that can be deposited in or at a buffer location 16 depends on the dimensions of the respective buffer location 16 and the respective returned goods. The buffer locations 16 can have different dimensions. For example, the buffer locations 16 can beThey can be implemented as surfaces without (at least partially) surrounding walls, as open or closable containers, or similar. It is understood that the workstation 14 can generally have more or fewer than four buffer positions 16. However, the workstation 14 should have several of the buffer positions 16. The four buffer positions 16-1 to 16-4 are shown in Fig. 3. For example, four shelf compartments of a (shelf) rack 26 could be implemented. The buffer locations 16 could alternatively (or additionally) also be storage locations of a floor storage system, trays of a continuously operated sorting system (sorter), flow channels of a flow rack, or similar. In practice, more than four buffer positions 16 will certainly be used. Arrangements of, for example, 8x8 buffer positions 16 in the form of a put wall open on one or both sides are conceivable. Fully automated solutions are possible, for example, in the form of a circulating sorter whose trays are automatically filled—and later emptied—after the product type has been recognized. The trays could transfer the collected returned goods directly into storage containers, which can be positioned, for example, below the trays on a conveyor system. In another design, the storage containers themselves could constitute the buffer positions 16 by being positioned at station 14 in an order container buffer, whereby station 14 is preferably set up as a goods-to-person picking station, where the return containers are provided in the same way as the storage containers, and vice versa. In general, if workstation 14 has a number M of buffer locations 16, where M is an integer greater than one, k different types of goods (TYPE#1 to TYPE#k) can be safely stored according to the Gaussian summation formula k = (M x (M + 1 )) / 2, whereby each of the returned goods goes through a maximum of two distribution passes, i.e., is "handled" a maximum of two times, and each of the return containers that is retrieved during a distribution process or pass according to the allocation table 32 is preferably completely emptied. Completely emptied means that all returned goods initially contained in the respective return container are removed from the corresponding return container in the respective pass and distributed to the buffer locations 16 according to predefined criteria, as will be explained in more detail below.Preferably, the returned goods distributed into the buffer locations 16 are also emptied after each distribution pass, namely either (from one of the destination locations 18) into a storage container 24 corresponding to a type of goods or (from one of the collection locations 20) into one or more collection containers 34, which are to be passed through in the future. The distribution process is assigned via the allocation table 32, as will be explained in more detail below. Fig. 4 shows a (possible) allocation table 32, according to which the returned goods from list 30 of Fig. 2 are distributed to one of the buffer locations 16 during a multi-stage distribution process, depending on their respective product type. The distribution can be carried out by: removing the returned goods from the corresponding return container; identifying the product type for each removed item; and transferring the returned goods, identified with respect to their product type, to the buffer locations 16 assigned to the respective identified product type. This is done based on table 32. Assignment table 32 in Fig. 4 illustrates that three distribution passes (SEQ#1 to SEQ#3) are required to return the thirty-four returned goods from Fig. 2 to storage by type. Returning by type means that each returned item is moved to one of the storage containers 24 associated with the same type of goods as the identified item. It is understood that the storage containers 24 themselves are also by type. This means that the storage containers 24 always contain only goods of the same type. It is also understood that compartment-divided storage containers 24 could store several types of goods simultaneously, with each compartment containing only one type of goods. Such storage containers 24 are also by type. The storage container 24 can be implemented using any type of load carrier (pallet, tray, box, etc.). In the assignment table 32, each of the (initially determined) distribution passes is generally assigned an individual sequence number (SEQ#), which uniquely identifies and identifies the corresponding distribution pass. The number of distribution passes thus corresponds to the number of different sequence numbers. The sequence numbers are preferably integers starting with the number one. It goes without saying that the sequence numbers can also be designated by other identifiers (IDs), for example, by letters. Furthermore, the order of the sequence numbers is predetermined. In the example, the order is... ascending, defined by 1, 2, 3, N, where N indicates the number of distribution passes to be made. The term "sequence" or "sequential" generally refers to a process in which elements, resources, or information are provided or processed in a specific, predetermined order. This means, for example, that provisioning occurs one after the other and in a defined sequence. In reverse order picking, sequential provisioning refers, for example, to the delivery of return containers, which contain the mixed returned goods, in the predetermined order in which they are needed for the next step in the process. Sequential provisioning has the advantage of bringing structure and order to processes, managing dependencies, and ensuring that each step is completed thoroughly and systematically before the next one begins. This improves efficiency and accuracy. According to Fig. 4, the following are assigned to the first distribution pass: the (first) sequence number SEQ#1; (by way of example) the two product types TYPE#2 and TYPE#4, and thus also any two of the buffer locations 16-1 to 16-4, which in this case represent the two destination locations 18 for these two product types; as well as two collection locations 20, one of which (SAM 2) is required for the second distribution pass and the other (SAM 3-1) for the third distribution pass. The following are assigned to the second distribution pass: the sequence number SEQ#2; (by way of example) the three product types TYPE#9, TYPE#3 and TYPE#5, and thus also any three of the buffer locations 16-1 to 16-4 as three destination locations 18 for these three product types; as well as one collection location 20 (SAM 3-2) for the third distribution pass. Fig. 3 further illustrates transfer processes in the first distribution pass. As illustrated in Fig. 3, according to the allocation table 32 of Fig. 4, in the first distribution pass, those return containers containing returned goods of product types TYPE#2 and / or TYPE#4 are provided at workstation 14, because product types TYPE#2 and TYPE#4 are sorted "finally" in the first pass. These are return containers RB#1, RB#2, RB#3, and RB#5, which contain goods of product types TYPE#2 and TYPE#4, respectively. Return container RB#4 does not yet need to be (and must not be) provided. because it has neither the product type TYPE#2 nor the product type TYPE#4. Then all returned goods are taken from each of the provided return containers, identified according to their product types, and distributed to destination locations 18 or corresponding collection points 20 according to the identified product type. From the first return container RB#1, for example, only the one item of product type TYPE#2 can be sorted for final processing, while the other returned goods must be buffered for later processing. The distribution or transfer step is illustrated in Fig. 3 by arrows connecting the return containers to the buffer locations 16. The corresponding processes will be described in detail using the first return container RB#1 as an example. For instance, one item of product type TYPE#1 is on top in return container RB#1. Below it are the returned goods of product types TYPE#2, TYPE#6, TYPE#7, and TYPE#9 in that order. It should be understood that the returned goods could also be arranged completely randomly in container RB#1. First, the single item of product type TYPE#1 is removed and identified. From the allocation table 32 in Fig. 4, it can be seen that returned goods of type TYPE#1 are only finally sorted in the third pass, so that this single item is transferred to buffer location 16-4, which corresponds to the collection point or container SAM3-1.Since none of the four buffer locations 16-1 to 16-4 are currently occupied, any one of these buffer locations 16 can be selected and, upon selection, becomes a collection point 20 or collection container SAM3-1. It is also possible to designate a specific buffer location 16 in advance for collecting the returned goods for the third cycle. In this case, precautions would have to be taken to ensure that the corresponding returned goods are transferred to the correct buffer location 16. The put-to-light system 29 could, for example, be used to support this process. If the workstation 14 is operated manually, the transfer can be carried out by a person picking up the corresponding returned goods, scanning them, and moving them into the appropriate buffer location 16, for example, by throwing them in.The person then picks up the two returned items of product type TYPE#2, which are placed in another, free buffer space 16, which then becomes the destination space 18, or which was previously assigned to product type TYPE#2. In the latter case, the corresponding buffer space 16 may be visually marked for disposal. The person then removes the returned items of product types TYPE#6 and TYPE#7, identifies them, and also places them in the same buffer space. Buffer station 16, which is already assigned to collection point SAM3-1, is used. Then, the two returned items of product type TYPE#9 are removed, identified, and placed in the last remaining empty buffer station 16, which is assigned to collection point 20, designated SAM2. The first return container RB#1 is then completely emptied and can be disposed of. The same processes are repeated for return containers RB#2, RB#3, and RB#5. After the first pass, the finally sorted returned goods of product types TYPE#2 and TYPE#4 can be transferred from destination locations 18 (buffer locations 16-1 and 16-2) into (empty or partially filled) storage containers 24, which are assigned to the corresponding product types and are preferably retrieved from a storage area and made available at workstation 14. This provision is preferably synchronized. The pre-sorted returned goods of the other product types can be transferred from collection locations 20 (buffer locations 16-3 and 16-4) into collection containers 34 (not shown), which can be buffered elsewhere for retrieval in future passes. Fig. 5 illustrates the second distribution pass according to the allocation table 32 of Fig. 4, after the first distribution pass according to Fig. 3 has been completed. In the second pass, the collection container 34 “SAM2” from the first pass and the return container RB#4 are made available at workstation 14 because the collection container 34 “SAM2” from the first pass contains (only) those types of goods that are assigned to the second sequence number “2” according to the assignment table 32 in Fig. 4. These are the returned goods of product types TYPE#3, TYPE#5, and TYPE#9. The return container RB#4, which has not yet been made available, is made available because it contains the two product types TYPE#3 and TYPE#5 from the second pass. As in the first round, the returned goods provided are distributed in the second round to the four buffer spaces 16, which are assigned to the product types in advance or "on the fly". In the second round, three product types (in this example TYPE#3, TYPE#5 and TYPE#9) can be finally sorted, because one of the buffer spaces 16 is still needed to collect those returned goods that will only be processed in the third and final round. The goods can then be sorted in the final stage. In other words, this means that such returned goods must be buffered for the third pass. Afterwards, the distributed returned goods are either transferred back into the corresponding storage containers 24 or into the same or a different collection container 34 (SAM3-2). The storage containers 24 can then be returned to the storage area. The collection container SAM3-2 is provided at workstation 14 during the third pass, which is described with reference to Fig. 6. Fig. 6 illustrates the third distribution pass according to the allocation table 32 of Fig. 4, after the second distribution pass according to Fig. 5 has been completed. In the third pass, the collection containers SAM3-1 (from the first pass) and SAM3-2 (from the second pass) are provided at workstation 14. The two collection containers SAM3-1 and SAM3-2 contain (only) those types of goods that are assigned to the third sequence number "3" according to the allocation table 32 in Fig. 4. There are no more return containers because all return containers have already been emptied. In the third pass, all four buffer locations 16 can be used for final sorting, i.e., as destination locations 18, because there is no further pass for which additional returned goods would need to be or could be collected. Figure 7A illustrates an analysis result in tabular form, based on the allocation table 32 of Figure 4. Figure 7A shows that, considering all three passes, 17 returned goods could be directly put back into storage. In other words, this means that 17 returned goods were handled only once, or each went through only one of the three distribution passes. Nine returned goods were provided and distributed a second time in the second pass. Eight returned goods were provided and distributed a second time in the third pass. In other words, this means that 17 returned goods were handled multiple times (namely, in exactly two passes). Fig. 7B illustrates an analysis result based on an initial assignment table 32', which is illustrated in Figs. 8 and 9. The initial assignment table 32' represents a starting point for an optimization process, which is carried out in the (optimized) assignment- Table 32 of Fig. 4 can result. The following describes how to derive the assignment table 32 of Fig. 4 from the initial example illustrated in Fig. 2. 4. In other words, this means that an optimization process is (also) described below. In the initial allocation table 32' of Fig. 8, each of the nine product types from the example in Fig. 2 (five return containers with a total of 34 returned items distributed across nine different product types) is initially assigned a distribution pass from top to bottom, e.g., in ascending order of the sequence numbers. As explained in Fig. 6, four different product types can be final sorted in the last distribution pass because there are a maximum of four (empty) destination locations 18. In the penultimate pass, three different product types can be final sorted because one of the buffer locations 16 is needed as a collection location 20 to gather the (potential) returned items from the last pass, which is regularly the case. In the penultimate, i.e.,In the second pass, two different product types can be reliably sorted in their final stages because, in the worst case, two collection points 20 are required for the two subsequent distribution passes. This, in turn, depends on the specific distribution of product types across the return containers. It should be noted that, in the worst case, all nine product types (TYPE #1 to TYPE #9) are present in a single return container. System 10 is designed to cope even with such a poor product type distribution. Therefore, in the first pass according to the initial Table 32' in Fig. 8, one product type is finally sorted. The resulting assignment of product types to the distribution passes or sequence numbers is shown in Fig. 8. In the last, i.e., the fourth, pass, one of the buffer locations 16 remains free because, in this example, only nine different product types need to be returned. It is understood that the findings presented here refer to an operating mode where returned goods are (or may be) handled a maximum of two times. If returned goods were permitted to be handled more than twice, the initial allocation of product types to the processing cycles could be distributed differently than illustrated in Fig. 8. According to the initial allocation table 32' in Fig. 8, only the first product type, TYPE#1, is final sorted in the first pass. In the second pass, product types TYPE#2 and TYPE#3 are final sorted, and so on. Fig. 8 also shows that a maximum of ten different product types can be reliably sorted, which is due to the four buffer locations 16. "Reliably" in this context means that none of the returned goods is handled more than twice. The number k of different product types that can be reliably stored via M buffer locations 16 is determined using the Gaussian summation formula, which incorporates the number M of buffer locations 16: . > M x (M+l) > 4 x (4+l) > K. — - — - — 1 row 2 2 In general, a maximum of M 2 Different types of goods can be safely stored back via M buffer spaces 16. Fig. 9 shows the initial allocation table 32' of Fig. 8 in a different arrangement, analogous to the representation in Figs. 2 and 4. Fig. 9 illustrates the same distribution of returned goods across the return containers as in Fig. 2 (see the first three columns). Fig. 9 further illustrates the assignment of the goods types to the sequence numbers or distribution passes (see the penultimate column). Finally, Fig. 9 also illustrates the assignment of the return containers to the distribution pass numbers (see the last column), i.e., at what time the respective return container is to be made available at workstation 14 or is to be retrieved. Figure 7B illustrates the efficiency resulting from the initial allocation table 32' in Figures 8 and 9. In the first pass, ten pieces of the returned goods are finally sorted, i.e., put back into storage, without having to go through another pass. Five pieces of the returned goods are processed in the second pass after two handling operations. Eleven pieces of the returned goods are processed in the third pass after two handling operations. Eight pieces of the returned goods are processed in the fourth pass after two handling operations. Thus, twenty-four pieces of the returned goods are put back into storage after going through two passes. A comparison of Figures 7A and 7B clearly illustrates that the Assignment table 32 of Fig. 4 results in a significantly more efficient storage process because the return containers are dissolved and thus no longer buffered for later passes, and because the returned goods have to be handled less frequently. The initial assignment table 32' of Figures 8 and 9 can be transformed into the assignment table 32 of Figure 4 via optimization. Optimizing the assignment of sequence numbers (SEQ#) to product types (TYP#) mathematically represents a sequencing problem. This problem is a so-called NP-hard problem, characterized by the fact that the time required to find a globally optimal solution increases exponentially with the problem size. Therefore, general meta-heuristic approaches have been developed for such tasks, which possess the property of computing sufficiently optimal results in a reasonable amount of time. These approaches, which are applied here, include genetic algorithms, tabu search, simulated annealing, and threshold accepting, to name just a few examples.All algorithms have in common that they calculate one or more further solutions from the best solution(s) found so far, the so-called neighborhood solutions, and first check these against the given physical constraints. In this case, it is checked whether the determined assignment of the product types to the sequence numbers and the resulting number of destination locations (18) or collection locations (20) do not exceed a predefined capacity (acceptance volume of the buffer locations (16)) at any time (sequence number). If this is the case, i.e., if this solution would be feasible in principle, it is calculated how many distribution processes were assigned in total (fewer = better) and how many items can be directly separated or finally sorted from the requested return containers with the given solution (more = better).If the currently considered solution is better than the previously found solution based on the criteria, the new solution can be saved as the best, and the search can then continue from there. This iterative process can be terminated if, for example, a) a predetermined time for finding a solution has expired (time limit), or if b) a predetermined number of new solutions since the last best solution found have not yielded any further improvement (in which case it is assumed that the optimum has been found). With reference to Figures 10 to 12, a method 100 for the type-separated return of goods, in particular by reverse picking, into the storage system 10 of Figure 1 will be described below. As mentioned above, the returned goods are mixed and provided in at least one return container at workstation 14, which has a fixed number of buffer locations 16. The total number of different product types is greater than the number M of buffer locations 16. In step S10, information about the returned goods contained in at least one return container can be collected to generate the return container goods list 30 (see Fig. 2). List 30 includes every return container. In step S12, list 30 is generated, specifying the type(s) of goods contained in each return container. The collection of this information can be performed by the customer or the operator, for example, by creating and transmitting corresponding inventory lists, as explained above. A data structure for the returns container goods list 30 could include at least one of the following pieces of information: a container ID; a type ID; a quantity (integer greater than 0); and / or a separation. In the case of separation, it may be necessary to check the returned goods (in addition to the normal inspection) for one or more specific aspects (e.g., expiration date, etc.). In step S14, the control unit 12, i.e., computer-implemented, generates the allocation tables 32' and (later) 32 based on the return container goods type list 30. It is understood that the generated list 30 can also be stored in a volatile or non-volatile memory device. During generation, the master data of the returned goods and / or information about the infrastructure of workstation 14 can also be taken into account. The master data can include information about the dimensions of the returned goods. The information about the infrastructure can include the dimensions of buffer locations 16, the number of buffer locations 16, the arrangement structure of buffer locations 16, and similar information. In step S14, the product types of the returned goods are specifically assigned to the N Distribution passes (SEQ#) are assigned, with each distribution pass being assigned an individual sequence number, so that the returned goods are taken from the respective return container during the distribution passes and distributed to the buffer location(s) 16, with each buffer location 16 being either a destination location 18 for a distribution pass currently being carried out or a collection location 20 for a distribution pass to be carried out in the future, according to the assignment table 32. N is the number of distribution passes to be carried out sequentially. Furthermore, one of the sequence numbers can be assigned to each of the goods types. In addition, a distribution pass-specific number of collection locations 20 can be assigned to each of the sequence numbers. A sequence list can also be generated from the assignment table 32 (see first and last column in Table 32' of Fig.9) are derived (step S16). The allocation can be carried out according to certain allocation criteria. Some possible allocation criteria are shown as examples in Fig. 10. The criteria can include at least one of the following parameters: dimensions of the returned goods and / or buffer locations 16; maximizing the quantity of all directly separated returned goods; minimizing the number of collection points 20 per pass; and / or minimizing the number of distribution operations. Once all the necessary information is available, the first distribution process or pass can begin. In step S18, all return containers are retrieved for delivery to workstation 14. These containers must contain product types to which the sequence number of the currently being processed distribution operation (here: SEQ#1) is assigned in the assignment table 32. Optionally, in a (parallel) step S20, the buffer locations 16 can be visualized, for example, using the put-to-light system 29. If a previously performed, process-specific assignment of product types to buffer locations 16 has been carried out for visualization purposes, it is also possible to consider which product types occur most frequently in list 30 in order to achieve an ergonomic arrangement of the corresponding buffer locations 16. For example, these target locations 18 can be positioned closer to the operator. than the collection points 20, which could be located further out relative to the operator, provided that fewer returned goods are collected in the collection points 20 than in the destination points 18. In step S22, the returned goods are separated from the return containers. This separation can be automated or done manually in sequence. With automated separation, the entire contents of the corresponding return container can be emptied, for example, onto a conveyor belt (see step S24). In step S26, the types of goods of the individual returned goods are identified, for example by scanning them. In step S28, it can be queried whether the identified product type, according to the assignment table 32, is assigned to either a destination bin 18 or a collection bin 20, in order to subsequently transfer the corresponding returned goods to the appropriate buffer bin 16 in step S30. The assigned sequence number can be consulted for this purpose. The transfer to destination bin 18 takes place in substep S30-1. The transfer to collection bin 20 takes place in substep S30-2. If the singulation in step S22 is performed manually, steps S22 to S30 are repeated until all returned goods from the corresponding return container have been removed and transferred. The necessary information can be obtained, for example, in a query (see step S32). In step S32, it can be queried whether the respective return container is empty. If the respective return container is not empty, the process returns directly to step S22. If the respective return container is empty, it can also be queried whether another return container exists that contains a product type to which the current sequence number is assigned. This additional return container is then provided, and its returned goods are singulated, identified, and distributed accordingly. The query S32 in Fig. 11 therefore actually corresponds to two queries that can be executed sequentially. Once all returned goods from one cycle have been distributed to buffer locations 16, the returned goods from destination locations 18 can be transferred to the corresponding storage containers 24. The storage containers 24 are then returned to the corresponding storage locations 24, see Fig. 12. In step S34, it can be queried whether any of the target locations 18 are still filled with returned goods and whether there are collection points 20 containing the goods types of future sequence numbers. This also actually involves two queries to be performed sequentially. If there are still filled destination locations 18, the corresponding storage containers 24 can be (in particular, requested and) provided (step S36). These containers are assigned the types of goods that are to be directly separated or finally sorted according to the current sequence number in the assignment table 32 (and which are located in the corresponding destination location 18). The returned goods stored in these destination locations 18 are transferred to the corresponding storage containers 24 (step S38). If there are also filled collection points 20, collection containers can be (in particular, requested and) provided (step S40), and the corresponding returned goods can be transferred from the collection points 20 into the collection containers (step S42). These containers are then buffered and can later be treated again as return containers.Alternatively, no transfer from collection points 20 to collection containers 34 could take place, so that the returned goods remain in the collection point(s) 20 for several passes. In the example of Fig. 4, there could, for instance, only be the collection point “SAM 3” (instead of “SAM3-1” and “SAM3-2”), without the returned goods collected in SAM3-1 in the first pass being transferred, but remaining in the corresponding collection point 20, into which the returned goods for “SAM3-2” are also placed. A further query (step S44) can check whether (according to the predefined order) further sequence numbers exist or whether further iterations are required. If further iterations are required, the process returns to step S18. Otherwise, procedure 100 ends. What is not shown in the flowchart of Figures 10 to 12 is the possibility of changing or adding to the quantity of return containers processed according to method 100, even during the execution of the method (subsequently). This can be achieved by taking into account additional return containers that were received in warehouse system 10 only after the creation of the allocation table 32. However, this may require, for example, that these return containers do not contain any product types that were already processed in a previous cycle. The capacity of the buffer locations 16 may also prevent subsequent consideration. Furthermore, it should be noted that the control unit 12 is configured to issue control commands to entities involved in the implementation of procedure 100. These commands may include, for example, material flow control commands or display commands for the put-to-light system 29. These commands are based on the mapping table 32, which is calculated by the control unit 12. The mapping table 32 therefore has a direct influence on how the storage system is operated in practice. Fig. 13 shows a block diagram of the control unit 12 of Fig. 1. The control unit 12 can include a detection unit 40 for recording the return container goods type list 30, which specifies the goods type(s) contained in each of the return containers. The control unit 12 can also include a generation unit 42.The production unit 42 is set up to generate the allocation table 32 based on the list 30, which defines the number N of distribution operations to be carried out sequentially, wherein each of the N distribution operations is uniquely assigned an individual sequence number in the table 32, wherein the returned goods are taken from the at least one return container during the distribution operations in a distribution-operation-specific manner and distributed to the buffer locations, wherein each of the buffer locations is, according to the allocation table 32, a target location 18 for the distribution operation currently being carried out or a collection location 20 for a future distribution operation. The production unit 42 can comprise a first allocation unit 44, a second allocation unit 46, and a third allocation unit 48, all of which can also be implemented in a single unit. The first allocation unit 44 can be configured to assign an individual sequence number in the allocation table 32 to each of the N distribution operations. The second allocation unit 46 can be configured to assign exactly one of the sequence numbers in the allocation table 32 to each of the product types of returned goods. Assignment table 32. The third assignment unit 48 can be configured to assign a distribution-process-specific number of collection points 20 to each of the sequence numbers, whereby each of the distribution-process-specific collection points 20 is assigned to one of the distribution processes to be carried out in the future. The functions of units 40-48 can be implemented through software and / or dedicated hardware. Next, hardware configurations of the control unit 12 and / or the control of the storage system 10 will be described. FIG. 14 shows a diagram illustrating a first exemplary hardware configuration that implements each function of the control unit 12 and / or the operating mode of the system 10. FIG. 15 shows a diagram illustrating a second exemplary hardware configuration that implements each function of the control unit 12 and / or the control of the system 10. It should be noted that each function of the control unit 12 and / or the control of the system 10 relates to each of the functions and operating modes described above. Each of the functions could be implemented using a processing circuit 50 of Fig. 14. In the case where dedicated hardware is used, the dedicated processing circuit 50 could be a single circuit, a composite circuit, an application-specific integrated circuit (ASIC), a custom-programmable gate array (FPGA), or a combination thereof. The functions of the control device 12 and / or the system 10 could each be implemented by a processing circuit, or they could be implemented collectively by a processing circuit.

[0096] Furthermore, in FIG. 15, the processing circuit 50 has been replaced by a processor 52 and a storage device 54. The processor 52 could be an arithmetic mean, such as an arithmetic unit, a microprocessor, a microcomputer, a central processing unit (CPU), or a digital signal processor (DSP). Examples of the storage device 54 also include non-volatile or volatile semiconductor memories, such as random-access memory (RAM). a read-only memory (ROM), a flash memory, a programmable erasable ROM (EPROM) and an electrical EPROM (EEPROM, registered trademark). In a case where the processor 52 and the memory device 54 are used, each of the functions of the control unit 12 and / or the control of the system 10 is implemented by software, firmware, or a combination thereof. The software or firmware is described in the form of a computer-readable program and stored in the memory device 54. The processor 52 reads and executes such programs stored in the memory device 54. These programs can cause a computer to execute procedures and processes for the respective functions of the control unit 12 and / or the control of the system 10. For example, the memory device 54 can be a non-volatile or volatile semiconductor memory, such as a ROM, an EPROM, an EEPROM, a floppy disk, an optical disc, a compact disc, or a DVD. Some of the functions of the control unit 12 and / or the control of the system 10, in particular the workstation 14, could be implemented by hardware, and other functions could be implemented by software or firmware. For example, the functions of the control unit 12 could be implemented using dedicated hardware, and the functions of the control of the system 10 and the workstation 14 could be implemented using the processor 52 and the memory device 54. The configurations shown in the above embodiments are examples, and it is possible to combine the configurations with another known method or to combine the embodiments with each other, and it is also possible to partially omit or modify the configurations without deviating from the scope of the present disclosure. List of 10 storage system 12 Control unit or control system 14 workstations 16 buffer spaces 18th place finish 20 assembly point 22 storage spaces 24 storage containers 26 shelves 27 scanners or product type identification units 28 Conveyor system / conveyor technology 29 Put-to-Light System 30 Return Container Product Type List 32 Assignment table 34 collection containers 40 recording units 42 production units 44 1. Assignment unit 46 2. Assignment unit 48 3. Assignment unit 50 processing circuits 52 processor 54 Storage device

Claims

Claims 1. Storage system (10) in which goods are stored by type in storage locations (22) and which is set up to store returned goods by type, which, with regard to their goods types (TYPE), are to be provided mixed in at least one return container (RC), and which comprises: the storage locations (22) which are operated by type; a workstation (14) which has a fixed number of buffer locations (16) wherein a total number k of different goods types (TYPE) of the returned goods is greater than a number M of buffer locations (16); and a control device (12) which comprises: a recording unit (40) for recording a return container goods type list, which for each of the return containers thethe types of goods contained therein; and a production unit (42) for production, based on the return container goods type list (30), an allocation table (32) which defines a number N of distribution operations to be carried out sequentially, wherein each of the N distribution operations is assigned an individual sequence number (SEQ#) in the allocation table (32), wherein the returned goods are taken from the at least one return container (RB) during the distribution operations in a distribution operation-specific manner and distributed to the buffer locations (16), and wherein each of the buffer locations (16) is, in accordance with the allocation table (32), either a destination location (18) for a distribution operation currently being carried out or a collection location (20) for a distribution operation to be carried out in the future;. wherein the storage system (10) is set up to carry out the distribution operations sequentially according to a predefined sequence of sequence numbers (SEQ#) by distributing the returned goods from all return containers (RB) according to their goods types (TYP) and according to the allocation table (32) to the buffer locations (16).

2. Storage system (10) according to claim 1, wherein the production unit (42) comprises: an allocation unit (44) that assigns to each of the N distribution operations an individual sequence number (SEQ#) in the allocation table (32); an allocation unit (46) that assigns to each of the goods types (TYP) of the returned goods exactly one of the sequence numbers (SEQ#) in the allocation table (32); and an allocation unit (48) that assigns to each of the sequence numbers (SEQ#) a distribution operation-specific number of collection points (20), wherein each of the distribution operation-specific collection points (20) is assigned to one of the distribution operations to be carried out in the future.

3. Storage system (10) according to claim 1 or 2, further comprising at least one of the following storage components: a return container conveyor system (28); a storage container conveyor system (28); and / or a rack (26).

4. Storage system (10) according to one of claims 1 to 3, wherein the workstation (14) further comprises: a put-to-light system (29) configured to indicate to an operator by means of light a provided return container (RB) from which one of the returned goods is to be taken according to the allocation table (32), and / or one of the buffer locations (16) into which the taken returned goods are to be transferred; and / or a product type identification unit (27) which is configured to identify the product type (TYPE) of the returned goods taken; wherein the workstation (14) is preferably a picking station which is configured for reverse picking.

5. Storage system (10) according to one of claims 1 to 4, wherein the buffer locations (16) are implemented as: Shelf compartments of a shelf unit open on one or both sides (16); storage locations of a floor storage unit that are clearly separated from each other; Trays of a continuously operated sorting system; and / or flow channels of a flow rack.

6. Method (100) for the type-separated return storage of returned goods, mixed with respect to product types (TYPE) in at least one return container (RB), in a storage system (10) at a workstation (14) which has a fixed number of buffer locations (16), wherein a total number k of the different product types (TYPE) is greater than a number M of buffer locations (16), wherein the method (100) comprises: Providing (S12) a return container goods type list (30) that specifies the goods type(s) (TYPE) contained in each of the return containers (RB); and Generating (S14), by a control device (12) of the storage system (10), an allocation table (32) based on the return container goods type list (20), wherein in the allocation table (32): a number N of distribution operations to be carried out sequentially is defined, wherein each of the N distribution operations is assigned an individual sequence number (SEQ#); each of the goods types (TYPE) is assigned exactly one of the sequence numbers (SEQ#), and each of the sequence numbers (SEQ#) can be assigned a distribution operation-specific number of collection points (20), each of which is one of the buffer points (16), where during a currently For the distribution process to be carried out, such goods types (TYPE) are collected in a distribution-process-specific manner, whose respective assigned sequence number (SEQ#) differs from the sequence number (SEQ#) assigned to the distribution process currently being carried out according to the assignment table (32); and sequential execution (S18-S30) of the distribution processes in a predefined order according to the sequence numbers (SEQ#), by distributing the returned goods from all return containers (RB) according to their goods types (TYPE) and according to the assignment table (32) to the buffer locations (16).

7. The method of claim 6, wherein performing the distribution operations comprises: a) providing (S18) return containers (RC) at the workstation (14) containing goods of the types (TYPE) to which the sequence number (SEQ#) of the currently performed distribution operation is assigned in the assignment table (32); b) completely emptying each provided return container (RC) by: Singling (S22) of all returned goods contained in the respective return container (RB); for each of the singled returned goods, identifying (S26) the corresponding goods type (TYP) and transferring (S30) to one of the buffer locations (16), whereby each of the singled returned goods whose identified goods type (TYP) corresponds to the current sequence number (SEQ#) is transferred (S30-1) to one of the buffer locations (16) that is currently being assigned to the respective identified goods type (TYP) by a first-time transfer or that is already assigned to the respective identified goods type (TYP) by a previous transfer of another of the singled returned goods of the same goods type (TYP), and whereby each of the singled returned goods whose identified goods type (TYP) is assigned to a sequence number (SEQ#) different from the current sequence number (SEQ#) is placed in the collection location (20). a) is transferred (S30-2), which is assigned to the respective identified product type (TYPE) by the assignment table (32); c) when all individual returned goods have been transferred to the corresponding buffer locations (16), emptying each of the destination locations (18) by returning its goods by type to a corresponding storage location (22) of the storage system (10), and emptying each of the collection locations (20) into an intermediate container (SAM2, SAM3) which will be handled like one of the return containers (RB) during one of the future distribution operations; d) then proceeding (S44) to the next sequence number (SEQ#) of the sequence, if any, and repeating steps a) to d), or terminating the procedure (100) if there is no next sequence number (SEQ#) according to the sequence.

8. Method (100) according to one of claims 6 or 7, wherein the return container goods type list (30) further specifies a quantity (STKZ) of the corresponding returned goods for each of the return containers (RB) and for each goods type (TYP) contained therein.

9. Method (100) according to one of claims 6 to 8, wherein the respective number of collection places (20) that can be assigned to a respective sequence number (SEQ#) corresponds to a difference between the highest sequence number (SEQ#) and the respective sequence number.

10. Method (100) according to any one of claims 6 to 9, wherein the assignment table (32) is further generated based on at least one of the following parameters: Master data for the goods types (TYPE) contained in the returns container goods type list (30), which represent the geometric dimensions of the returned goods; and Infrastructure information representing the geometric dimensions of the buffer spaces (16).

11. Method (100) according to any one of claims 6 to 10, wherein the generation (S14) of the assignment table (32) further comprises at least one of the following steps: Optimize by minimizing the number N of distribution operations to be performed; Optimize by maximizing the number of returned goods that can be directly stored; and / or Optimize by minimizing the number of collection points (20) required per distribution process.

12. Method (100) according to any one of claims 6 to 11, wherein each of the returned goods goes through one of the distribution processes a maximum of two times.

13. Method (100) according to any one of claims 6 to 12, wherein a maximum number k of the different types of goods (TYPE) that can be stored separately by type is defined by k = (M x (M +1)) / 2.

14. Method (100) according to any one of claims 6 to 13, wherein the respective sequence number (SEQ#) assigned to each of the goods types (TYPE) according to the assignment table (32) determines the corresponding distribution process in which the corresponding returned goods are stored back in the storage system (10) without undergoing a further distribution process.

15. Method (100) according to any one of claims 6 to 14, wherein at least one of the return containers (RB) contains returned goods of several different types of goods (TYPE).

Images