Calculation of the average travel distance in a low-level picker-to-part system considering any distribution function within the aisles

The estimation of the average travel distance in a low-level picker-to-part order picking system can be done by analytical methods in most cases. Often a uniform distribution of the access frequency over all bin locations is assumed in the storage system. This only applies if the bin location assignment is done randomly. If the access frequency of the articles is considered in the bin location assignment to reduce the average total travel distance of the picker, the access frequency over the bin locations of one aisle can be approximated by an exponential density function or any similar density function. All known calculation methods assume that the average number of orderlines per order is greater than the number of aisles of the storage system. In case of small orders this assumption is often invalid. This paper shows a new approach for calculating the average total travel distance taking into account that the average number of orderlines per order is lower than the total number of aisles in the storage system and the access frequency over the bin locations of an aisle can be approximated by any density function.

Hanging Together, Together Hung? Career Implications of Interpersonal Ties Between CEOs and Top Managers

Is it good or bad for senior executives to have strong interpersonal ties to the CEO? We argue that a strong relationship with the CEO raises the likelihood that a top manager stays in office or makes an upward career move when the CEO leaves office voluntarily. At the same time, such interpersonal ties also reinforce the negative spillover effects of a dismissal of the CEO on the career prospects of the manager concerned. Our empirical analysis lends support to both arguments. We contribute to managerial succession research by underlining the ambivalence of interpersonal ties within top management teams.

Analytical form of the Probability Density Function of travel times in rectangular zone with Tchebyshev’s metric

Geometrical dependencies are being researched for analytical representation of the probability density function (pdf) for the travel time between a random, and a known or another random point in Tchebyshev’s metric. In the most popular case - a rectangular area of service - the pdf of this random variable depends directly on the position of the server. Two approaches have been introduced for the exact analytical calculation of the pdf: Ad-hoc approach – useful for a ‘manual’ solving of a specific case; by superposition – an algorithmic approach for the general case. The main concept of each approach is explained, and a short comparison is done to prove the faithfulness.