Abstract: Mail order companies like Zalando or Amazon reported a significant increase regarding the number of incoming customer orders in recent years. Customers are served from a central distribution center (warehouse) where requested items of the orders have to be retrieved (picked) from their storage locations. The picking process is performed by human operators (order pickers) who are employed on a large scale in order to enable a fast processing of the orders. However, due to limited space, aisles are often very narrow in warehouses, and order pickers cannot pass or overtake each other. Thus, an order picker may have to wait until another picker has performed his/her operations. The arising waiting times may significantly increase the processing times of the orders, implying that a large number of pickers does not guarantee for small processing times. Therefore, in this paper, the impact of several problem parameters on the amount of waiting time is investigated first and situations are identified where the consideration of waiting times is inevitable for an efficient organization of the picking process. In the second part of the paper, a solution approach, namely a truncated branch-and-bound algorithm, is proposed which aims for the minimization of the waiting times. By means of extensive numerical experiments, it is demonstrated that this approach provides high-quality solutions within a very small amount of computing time.