In this paper, we discuss an approximation method based on G/G/m queuing network modeling using Whitt’s (1983) queuing network analyzer to analyze pick-and-pass order picking systems. The objective of this approximation method is to provide an instrument for obtaining rapid performance...

Local governments in Western Europe increasingly use city time-access regulations to improve social sustainibility. These regulations significantly influence the distribution process of retail chain organizations. This paper studies the impact of governmental timewindow pressure on retailers’...

Due to a rapid growth in world trade and a huge increase in containerized goods, sea container terminals play a vital role in globe-spanning supply chains. Container terminals should be able to handle large ships, with large call sizes within the shortest time possible, and at competitive rates....

In this article we focus on product return handling and warehousing issues. In some businesses return rates can be well over 20% and returns can be especially costly when not handled properly. In spite of this, many managers have handled returns extemporarily. The fact that quantitative methods...

Factory Gate Pricing (FGP) is a relatively new phenomenon in retail distribution. Under FGP, products are no longer delivered at the retailer distribution center, but collected by the retailer at the factory gates of the suppliers. Owing to both the asymmetry in the distribution networks (the...

In this study we consider a pick-to-pack orderpicking system, in which batches of orders are picked simultaneously from different(work) zones by a group of order pickers. After picking, the orders are transported by a conveyor to the next station for packing. Our aim is to determine the optimal...

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our dynamic...

In this paper we consider the capacitated lot-sizing problem (CLSP) with linear costs. It is known that this problem is NP-hard, but there exist special cases that can be solved in polynomial time. We derive a backward algorithm, based on the forward algorithm by Chen et al. (1994), to solve the...

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master...

This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the literature, which considers mainly partial integration. Our approach is new in the sense that we can...