Analytical model to estimate the performance of shuttle-based storage and retrieval systems with class-based storage policy

This paper presents a method to determine the performance of shuttle-based storage and retrieval systems (SBS/RS) with tier-captive single-aisle shuttles and class-based storage policy. The use of this approach takes place both in the design process of SBS/RS and in the redesign process of SBS/RS. With this approach, it is possible to evaluate performance improvement by applying a class-based storage policy. Another beneficial scope of application of this approach is the evaluation of the placement of different classes throughout the rack to achieve the maximum throughput. The basis of this calculation method was a continuous-time open-queueing model with limited capacity. The cycle times of lifts and shuttles, as determined by a spatial value approach combined with a probability-based approach to mention the storage policy, could be directly used in the presented method with their time distributions. The data used herein were provided by a European material handling provider. An example was presented to outline how this calculation model can be used for optimizing the already existing SBS/RS via the application of a class-based storage policy. Through the example, depending on the configuration of the policy, applying the class-based storage to an existing SBS/RS would increase the throughput by up to twice the throughput without class-based storage policy.


Introduction
Global supply chain development towards a greater product variety and short response times have created new automated storage and retrieval systems (AS/RS) called shuttle-based storage/retrieval systems (SBS/RS) [1,[11][12][13][14]. Typically, a tier-captive SBS/RS comprises multiple tiers with shuttles dedicated for each level. The shuttles cannot leave their tiers and fulfil the horizontal movement of the tote. The vertical movement is accomplished by lifts in front of the rack. Between these two subsystems for the lifts and shuttles, there are buffer slots in each tier, which describes the certain independence that exists between both systems. Moreover, these systems reach high levels of performance that can be quantified by their Michael Eder michael.e307.eder@tuwien.ac.at 1 Institute for Engineering Design and Product Development, Vienna University of Technology, Getreidemarkt 9, 1060, Wien, Austria achieved throughput. The maximum throughput is normally determined by the geometrical and technical specifications of the system. For instance, one way to achieve a higher throughput with a SBS/RS is to change the storage management policy into a class-based storage, which is the context of this paper. The advantage of switching from a uniform storage policy to a class-based storage policy is that it enables higher throughputs with the same physical parameters of the SBS/RS. There are two main reasons for doing this, the first being that the requirements for the SBS/RS change over time and the required performance is no longer achievable. A cost-effective way to increase throughput is to use a class-based storage policy. The second reason for using a class-based storage policy is that, when designing a new SBS/RS, the required performance is so high that a uniform storage policy cannot achieve the required throughput, and a class-based storage policy is an efficient way to achieve the required performance. For reasons of closeness to reality, the presented approach is presumed to be discrete in space and continuous in time.
The purpose of this document is to provide a decision tool that can quickly and accurately assess the throughput of a SBS/RS with class-based storage policy. This approach should be used both in the design process of a new SBS/RS and in the redesign process of an existing SBS/RS to achieve higher performance.
The main contribution of this paper is to present an analytical approach to discussing SBS/RS with class-based storage policies. This approach can be used directly in the design process of SBS/RS. In addition, this article describes how to apply class-based storage policies to SBS/RS and the resulting changes in throughput.
This paper is organized as follows. The concept is explained in the literature provided in Section 2. The SBS/RS in question and the underlying assumptions are described in Section 3. An analytical approach for treating the system, especially the different possibilities of classbased storage and how to treat these, is discussed in Section 4. In Section 5, a numerical study is carried out to demonstrate the influence of the class-based storage on the throughput. The parameters used in this study are sourced from a European material handling provider. Finally, the findings of this paper are summed up in Section 6, where an outlook on the future of this research is included.

Literature review
Existing research on tier-captive shuttle-systems with random storage assignment is substantial. Eder [2] asserted two possible ways of discussing SBS/RS: one using discrete event simulation (DES) and the other via an analytical approach to examine such systems. Nonetheless, there have been rare accounts discussing class-based storage policies in SBS/RS. Kuo et al. [10], for instance, discussed the use of a queueing network to investigate a SBS/RS with class-based storage. Such approach though was limited; although it was only able to calculate the waiting times within one handling cycle, the maximum throughput could not be extracted [2]. Ekren et al. [6] presented an approach that treated, or rather, simulated class-based storage policies in SBS/RS. Kriehn et al. [9] conducted another simulation study on the same topic in an attempt to optimize the class-based storage policy and to quantify the reachable benefit of the storage policy.
Likewise, Schloz et al. [15] presented a different way of discussing storage policies in SBS/RS by developing an optimization approach to find the best places for the different classes in the rack.
On the contrary, there were more studies on SBS/RS with random storage. Literature [2][3][4][5] describes the manner in which the system is closest to its real behavior. More importantly, Eder [2] additionally used a spatially discrete approximation, which likewise corresponds to reality. An overview of all existing literature on SBS/RS is presented in Table 1. As can be seen in this table, there are some articles that deal with class-based storage policies, but there is no analytical approach that determines the achievable throughput. On the other hand, there are papers that provide analytical decision tools, but these approaches apply only to uniform storage policy. This is the reason for the research gap in analytical decision tools for determining the maximum throughput of SBS / RS with a class-based storage policy. This study specifically adopted and advanced the main idea in Eder [2] through consideration of several probability based approaches within the class-based storage policy.

System description
The system under investigation is a tier-captive single-aisle SBS/RS as displayed in Fig. 1. A lift can be seen in front  [2] of each rack for totes transport from the input/output (I/O) point to the tier and back. Basically, these I/O points are located on the first tier in front of the lifts. There are also buffers between the lifts and shuttles. Each shuttle is assigned to one tier in one aisle, which means that there are as many vehicles as tiers in a rack. Furthermore, these vehicles can transport one tote at a time along the aisle. The racks are single-deep and double sided. Moreover, each storage location can hold one tote [2]. Assumptions (and some notations) proposed in this paper were similar to those for a SBS/RS produced by a European material handling provider. The first eight assumptions have also been published under Eder and Eder et al. [2][3][4][5] tier where the next tote has to be restored. 5. The dwelling point of the shuttle is in front of the buffer-slots. 6. The lifts and shuttles accelerate/decelerate with constant acceleration/deceleration. In case the acceleration/deceleration is not constant, the actual acceleration/deceleration must be transferred to an acceleration/deceleration which gives the same behaviour as the actual acceleration/deceleration of the SBS/RS. 7. There is no difference in time between the transfer of totes to or from the lifts. If there is a difference in the real system, this has no effect on the calculation since only the sum of times is used for loading and unloading. 8. There are always totes on the I/O point waiting to be stored. This assumption is necessary to achieve the maximum throughput. Otherwise, the input lift must wait for incoming totes, which would affect the possible performance of the SBS / RS under consideration. 9. The order of the totes to be re-stored next is evenly distributed among all stored totes of the same class. 10. The order of the totes from different classes is as given by the storage policy. 11. The assignment of the class to a tote is static and can not be changed while the tote is stored.
Assumptions 9 through 11 are the definitions of class-based storage. The parameters of these assumptions result from the classification of the data of a warehouse management system.

Analytical approach
A single-aisle model was deemed fit for determining the performance of SBS/RS, as the storage and retrieval transactions among all aisles were evenly distributed [7,8,13]. For this study, the presented approach is based on the approach by Eder [2], which employs an open queueing model with limited capacity (M|G|1|K) and with three main parts determining the throughput, namely the interarrival time to Probability of emptiness of a queueing system p 0 N / p 0 X Probability of emptiness of a queueing system in zone N / area X p k Blocking probability of a queueing system p k N / p k X Blocking probability of a queueing system in zone N / area X t A

Interarrival time to a tier t A N / t A X
Interarrival time to a tier of zone N / area X t t L Time to transfer a tote to and from the lift t t S Time to transfer a tote to and from the shuttle t lif t Cycle time of a lift for a single-command cycle t R L Time to travel of a lift at single-command cycle t R S SC Time to travel of a shuttle at single-command cycle t R S DC Time to travel of a shuttle at dual-command cycle t S Service time of a shuttle t S SC Service time of a shuttle at single-command cycle t S DC Service time of a shuttle at dual-command cycle t shuttle SC Cycle time of a shuttle for a single-command cycle t shuttle DC Cycle time of a shuttle for a dual-command cycle s Coefficient of variation of the cycle times x s N / s X Coefficient of variation of the cycle times in zone N / area X v lif t Lift velocity v shuttle Shuttle velocity w N / w X Probability of order a tote in zone N / area X w NX Probability that a tote from zone N is situated in area X one single tier, the service time of the shuttles, and the open queueing model M|G|1|K. The open queuing model with limited capacity (M|G|1|K) is used because this approach takes into account the interactions between shuttles and lifts. These interactions lead to waiting times of lifts and shuttles which directly affects the achievable throughput. To adapt this approach, modifications have been made to all three parts.
In this chapter, the approach was initially enacted via the procedure in Eder [2] for an easier comprehension of the adaptation. Next, zoning in the horizontal and vertical directions was applied, followed by the respective discussion. The notations used in this analytical approach are listed in Table 2. The approach procedure was as follows (Fig. 2): The class-based storage parameters such as the number of containers from the different zones (n N ) or the probability of ordering from a zone (w N ) must be determined by classifying the data of a warehouse management system.

Throughput calculation without zoning
The throughput of a shuttle system without zoning was calculated herein based on Eder [2].

Interarrival time
Firstly, the interarrival time was calculated as determined by the lifts (Eq. 1); here, the time for the ride and the times for transferring the tote to and from the lift were required [2], The mean time for the ride is as follows: Considering the fact that the lifts will not reach their maximum speed within small distances, the function t(l) has to be split into two ranges, with the first part for distances being less than l < v 2 a , while the other part was for larger distances, Accordingly, Eq. 1 represents the cycle time of the lift for one single-command lift cycle. Here, the interarrival time is this cycle time times the number of tiers, as follows: Moreover, this equation incorporates the fact that one lift serves all the tiers of an aisle.

Service time
The second requirement for determining the throughput was the shuttle service time. It is obtained in the same process as the cycle times of the lifts. Transport times from A to B and tranferring times of the totes to and from the shuttle were measured as well [2].
Single-command cycle: The single-command cycle is best represended by [2] t shuttle SC = 2 · t R S SC + t t S (6) and the mean time for the ride is due to the following: Equations 3 and 4 should be used for determining the times depending on the distances. The service time of the shuttles is given by the following: the multiplier 2 reflects that the reference cycle in this paper is a dual handling cycle.
Dual-command cycle: Accordingly, the dual-command cycle is represented by the following: The first term in Eq. 9 is the same as for the single cycle, while the second term stands for the ride between the slot where a tote is transferred from the shuttle and the slot, where the next tote, that shall be retrieved, is located. The mean time for this is due to Moreover, the service time of the shuttles with double cycle is given by the following: Two methods can be employed to determine the throughput. The first method is by interarrival time and blocking probability (Eq. 12), the second by using the service time and the probability of emptiness (Eq. 13). Blocking probability means that the system is completely filled so that no tote can enter the system. Applied to a shuttle system this means that the lift has to wait for an empty space in the input-buffer. The probability of emptiness implies that the server has to wait because there is no tote in the waiting area.
In SBS/RS, it means that the shuttle has to wait for a tote.
The throughput of an aisle is equal to the throughput of one tier multiplied by the number of tiers ϑ = ϑ tier · n tier (14) and the blocking probability of the queueing system can be calculated through [16] Equation 15 is a seemingly complex equation, but in reality, it only contains three different arguments. The main argument is the utilization rate of the service station (=shuttle), which contains the interarrival time defining the lift and the service time of the shuttle which can be obtained by the expression The second argument is K, which represents the capacity of the queueing system. It is essentially the summation of the number of buffers and the capacity of the shuttles in the treated SBS/RS, which is always one tote.
The third and last argument is s N , which is the coefficient of variation of the service process. It is easily calculated upon simplification of Eqs. 6 and 9, with the same equations for different distances as Eqs. 3 and 4. Subsequently, the coefficient of variation for a shuttle that simplifies the calculation single handling cycle is [5] s = Respectively, the probability of emptiness contains the same arguments (as in the blocking probability) as expressed by [16]: Horizontal zoning is defined as the number of slots for each zone N within a tier as in,

Interarrival time
The interarrival time to the tiers is basically the same as the interarrival time without zoning (see Section 4.1.1), mainly because there are no different zones in the vertical direction.

Service time
In the horizontal direction, the rack is split into different zones depending on the class of the tote, causing the service time of the shuttles to be different from that in a rack without zoning.
Single-command cycle: The main equation for zoning in horizontal direction is similar to Eq. 6 for the service time without zoning, as given by The difference from zoning to no zoning is the time for ride t R S SC . For two zones in horizontal direction t R S SC is given by The first term in Eq. 23 describes the time for the ride to zone 1. Here, the first part w 1 refers to the probability of ordering a tote from class 1, while the second part describes the mean time for the ride to zone 1. The second term stands for the ride to zone 2 with the probability of the order from class 2. The difference between the two terms is in the mean time for the ride, with the second term including the ride across zone 1 (n slot 1 · x). For higher numbers of zones, the equation expands to

Fig. 3 Zoning in horizontal direction
Dual-command cycle: The dual-command cycle can be expressed by which is quite similar to Eq. 22 for the single-command cycle. The difference is the time for the ride between the storage location at the storage process and the location at the retrieval process, t R S DC . For two zones in horizontal direction the mean time for the ride between these two locations is given by The first term in Eq. 26 describes the situation wherein the storage location at the storage process and at retrieval process are both situated in zone 1 and could be taken to equal Eq. 10 of the ride between two storage locations in the dual-command cycle of the shuttle without zoning. Accordingly, the second term involves two cases, namely (i) the storage location is in zone 1 while the retrieval location in zone 2, and (ii) the storage location is in zone 2 while the retrieval location in zone 1. The third term stands for both locations in zone 2. For higher numbers of zones, the equation evolves to

Open queueing model M | G | 1 | K
Here, the queueing model is the same as without zoning (see Section 4.1.3), practically because there is no zoning in vertical direction and thus tiers work the same manner. The only thing that has to be changed is the determination of the coefficient of variation of the service times, which is essentially obtained through numerical simulation.

Zoning in vertical direction
The second zoning type is zoning in vertical direction, as demonstrated in Fig. 4. Such zoning influences the calculation of interarrival time by the lift, and also the open queuing system that needs calculation for every zone in the SBS/RS. Vertical zoning is defined as the number of tiers for each zone N within an aisle, n tier N = w N · n tier (28)

Interarrival time
The interarrival time of the lift changes with zoning in vertical direction. On the one hand, the cycle time of the lift changes; on the other hand, the transformation of the cycle times to the interarrival time changes.
Single-command cycle: The main equation for zoning in vertical direction is similar to the equation for the cycle time with no zoning Eq. 1 and is given by the following: The difference between zoning and no zoning is the time for the ride t R LSC . For two zones in horizontal direction, the time for the ride can be calculated through the following: The first term in Eq. 30 is the time for the ride to zone 1. The first part, w 1 , indicates the probability of ordering a tote from class 1, while the second part describes the mean time for the ride to zone 1. The second term stands for the ride to zone 2 with the probability of the order from class 2. The difference between both terms is in the mean time for the ride, where the second term includes the ride across zone 1 (n tier 1 · y). For higher numbers of zones, the equation becomes Transformation of the lifts' cycle time to the interarrival time: The cycle time of the lifts can be transformed into the interarrival time without zoning by multiplying the cycle time with the number of tiers in the system, as depicted in Eq. 5. With zoning in vertical direction, the conversion is a bit different. Here, the cycle time has to be multiplied by the number of tiers in the respective zone, and then it has to be divided by the probability of selection of this zone, so as to take the class-based storage policy into account,

Service time for a single depth rack
The service time for zoning in vertical direction is the same for all the zones. Thus, the calculation of this time is as for SBS/RS without zoning (see Section 4.1.2).

Open queueing model M | G | 1 | K
The calculation of the open queueing system with limited capacity with zoning in vertical direction is different from the calculation without zoning. With zoning in vertical direction the tiers are split up into different zones. Therefore, the queueing system has to be calculated several times for each zone. The equations for determining the throughput of one single tier with N as the number of the zone include Here, the throughput of an aisle is the summation over the different zones of the throughput of one tier in the respective zone multiplied by the number of tiers in this zone, as For each zone N, the blocking probability of a queueing system can be found with the expression, Similarly, for N zones the utilization rate of the shuttle is given by and the queueing system capacity for each zone of the SBS/RS is The third argument s N , or the coefficient of variation of the service process has to be evaluated by a numerical simulation of the service times. Respectively, the probability of emptiness contains the same arguments as the blocking probability and can be calculated for each zone of the SBS/RS through

Zoning in vertical and horizontal direction
The third zoning type treated in this paper is the twodimensional zoning, that is, zoning in the vertical and horizontal directions, as shown in Fig. 5. For this zoning type, the throughput was calculated via a combination of equations for zoning in horizontal (see Section 4.2) and vertical (see Section 4.3) directions. Initially, a definition was necessary: The rack has different zones N with a relative amount of all storage locations n N Fig. 5 Zoning in vertical and horizontal direction and a probability of order w N . These are respectively the different classes of the storage policy. To transfer zones N into different areas X in the vertical direction, the probability w XN of being in area X was used. This factor w XN describes the probability that a tote from zone/class N is situated in area X. The areas X can have 1 to n tier tiers. For example, the rack shown in Fig. 5 has three zones (A-C) and three areas (X-Z). The area X at the bottom includes all of the rack with totes from class A and a part of class B and class C. In the figure, this area was marked with the mean height for the ride of the lifts l X . The second area Y above contained a part of classes B and C, and was marked with the mean height to the ride of the lifts l Y . The third area Z only contained totes from class C and was marked with l Z . Accordingly, the number of tiers of the area X can be calculated through which is the summation of the probabilities that a tote from zone/class N is situated in area X times the number of storage locations of class N. This sum is multiplied by the number of tiers to obtain the number of tiers in area X.
The second factor that has to be transferred is the probability of order from area X, which is the sum of the probabilities that a tote from class N is situated in area X times the probability of order from zone/class N.
The third factor that has to be transferred is the number of slots for articles from zone N in area X, that is, the distribution of the articles from the classes over the length of a tier. n slot NX = w NX · n N · n slot · n tier n tier X Equation 41 contains the probability that a tote from zone N is situated in area X multiplied by the number of storage slots from zone/class N, the number of slots on each side per aisle, and the number of tiers, and then all these terms are divided by the number of tiers in area X.
The last and important factor is the probability of order within a tier in the respective area X. This is governed by an expression converting the overall probability of order w N into the probability of order within on tier, for calculation of the service time of the respective tier, Moreover, such conversion can be achieved by multiplication of the probability of order from zone/class N with the probability that a tote from zone/class N is situated in area X. The product is then divided by the sum over all zones of the same multiplication.

Interarrival time
Calculations for the interarrival times of the lift with two-dimensional zoning is quite similar to that for the interarrival times with zoning in vertical direction. The main difference, however, is that the calculation now uses different vertical areas X with their number of tiers n tier X and probability of selection w X . Time to transfer a tote to and from the shuttle t t S = 8.4s Number of slot in zone N for 2 zones n N = 20%/80% Number of slot in zone N for 3 zones n N = 20%/30%/50% Probability of order a tote in zone N for 2 zones w N = 60%/40% Probability of order a tote in zone N for 3 zones w N = 60%/30%/10%

Numerical evaluation of the approximation quality
During the design process of a SBS/RS, the performance of one aisle is important when designing the other parts of a storage system, such as a conveyor. Understanding the influence of class-based storage helps to determine an economically and ecologically ideal design of SBS/RS. Thus, herein, certain parameter configurations as shown in Table 3 were selected in order to present a variety of different settings. The system in discussion had 40 tiers and 200 storage slots on each side of the aisle. The parameters in Table 3 were specified by a European material handling provider of SBS/RS.

Time distributions of the interarrival time
The underlying assumption behind the open queueing model M|G|1|K states that the time distribution of the interarrival time by the lift is an exponential distribution. Eder's [2] approach assumed that all tiers have the same exponentially distributed interarrival time; thus, to fulfil this, the approach was divided in different parts. Figures 6,7,8, and 9 show a class-based storage with three classes and zoning in the vertical direction. Figure 6 presents the arrivals into the different tiers, specifically, the three different zones with their probabilities of numbers of tiers into the respective zone n N = 20%/30%/50% and with their probabilities of numbers from the respective zone w N = 60%/30%/10%. The next three diagrams present the histograms of the interarrival times to the tiers in zone A (Fig. 7), zone B (Fig. 8), and zone C (Fig. 9). All these distributions correspond to an exponential distribution with a mean interarrival time for the zones as follows: zone A t A A = 8.2s, zone B t A B = 24.5s and zone C t A C = 124.7s.

Time distribution of the service time
For the service time of shuttles in the SBS/RS, Eder [2] assumed that the maximum distance to ride within one double handling cycle is represented by a rightskewed triangular distribution. This is appropriate upon simplification where the ride times are calculated using Eq. 4. The coefficient of variation of such a distribution without the constant transfer times is approximately s = 0.57. For the class-based storage, this assumption should be changed. For such a case, the distribution of the maximum ride distance within one double handling cycle is a combination of three right-skewed triangular distributions as shown in Fig. 10 with the peaks of the triangles becoming lower with increase of zone position. Usually, this occurs at a higher coefficient of variation, such as for about s = 0.78 without transfer times. The underlying assumption for this distribution of ABC-zoning was w N = 60%/30%/10% and n N = 20%/30%/50%. Also, the mean distance to ride in a double handling cycle with an aisle length of n slot = 200, changed from n mean = 133 without zoning to n mean = 36 at the three class-zoning. Consequently, the real distribution had to be simulated numerically in order to obtain the right coefficient of variation.

Optimization example
The optimization example was based on the parameters in Table 3. The system discussed was a SBS/RS with 16000 spaces, 400 slots per tier and 40 tiers. A system with these parameters and without zoning would reach a throughput of ϑ = 473 totes h . The first option for zoning with two classes was zoning in the horizontal direction, as depicted in Fig. 11. This kind of zoning increased the reachable throughput to ϑ = 482 totes h . The second option was zoning in the vertical direction, as indicated in Fig. 12, which reached a throughput of ϑ = 495 totes h . The next step was zoning in the vertical and horizontal directions with a rectangle block of zone A, as demonstrated in Fig. 13, which reached a throughput of approximately ϑ = 536 totes h . With this optimal configuration, zone A had a length of n slot A = 110 and height of n tier A = 15. Figure 14, on the other hand, shows the possible scenarios with the same physical configuration, but with zoning in three zones. Such configuration yielded a throughput of ϑ = 1003 totes h . The length of zone A was n slot A = 114 and its height was n tier A = 14. Likewise, the length of zone B was n slot B = 114 and its maximum height was n tier B = 35. Apparently, for this example the transfer from two zones to three zones showed nearly double throughput.
This optimization showed the possible scenarios with an existing system with applying a class-based storage policy. For the example, the SBS/RS was provided with all the physical parameters that were constant. Thus, the only way to improve the performance is by modifying the storage policy to a class-based one. Depending on how the order list is composed, different storage policies can be applied. The reachable throughput reaches from ϑ = 473 totes h without zoning to ϑ = 1003 totes h for zoning in three zones, with zoning in the vertical and horizontal directions.

Conclusion
The high system performance of tier-captive SBS/RS has been increasingly sought by industries. To ameliorate the performance even further, a different storage policy such as a class-based storage, can be employed. Nevertheless, there are few available decision tools for evaluating such performance, a discrete event simulation being the most frequently used. Thus, this study presented a method for calculating the performance of tier-captive single-aisle SBS/RS that equally delivers accurate results. The system was modelled as a continuous-time open queueing system with limited capacity. Subsequently, the interarrival and service times were evaluated using the cycle time model in combination with a probability based approach of lifts and shuttles with discrete spatial values. The presented approach has the distinct feature that it can be used to discuss a high number of different configurations of class-based storage in a very fast and accurate manner. The accuracy of the analytical model was achieved by extraction of the different time distributions of the interarrival and service times and by comparing them with the assumptions for the continuoustime open queueing model with limited capacity. The main novelty of this approach is the analysis of the interactions between shuttles and lifts with the help of a limited-capacity open queueing model (M|M|1|K) in combination with a class-based storage policy. This provides the possibility of determining the throughput of various configurations of SBS/RS with class-based storage policies that are governed by a variety of physical parameters, such as the following: the length or the height of the rack, as well as various classbased storage policy variants, such as the number of classes in the system. In general, the presented approach reaches a high approximation quality. Finally, an outline was provided on how the presented approach can be used to optimize an existing tier captive SBS/RS. An example demonstrated the influence of different storage policies and the throughput that can be achieved by optimizing the storage policy. Moreover, this approach can be used to optimize zoning of different storage policies, which is an advantage for any provider of SBS/RS. The presented assumptions were similar to the SBS/RS of a European material handling provider. Further work will be dedicated to the SBS/RS with class-based storage to evaluate a calculation method for determining the places of the various zones along the rack. The zone spread discussed in this article is set to rectangular zones. In further work, it must be examined if this is the best spread or if other types of areas provide a higher throughput. Another aspect that needs to be addressed is the extension of the developed approach to multiple-deep storage in order to achieve higher storage densities of the SBS/RS. Funding information Open access funding provided by TU Wien (TUW). This work was supported by the TU Wien University Library, through its Open Access Funding Programme.

Conflict of interests
The author declares that he has no conflict of interest.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creativecommonshorg/licenses/by/4.0/.