This paper deals with a practical application of an integrated approach to vehicle and crew scheduling, that we have developed previously. Computational results have shown that our approach can be applied to problems of practical size. However, application of the approach to the actual problems...

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 note we present an efficient exact algorithm to solve the joint pricing and inventoryproblem for which Bhattacharjee and Ramesh (2000) proposed two heuristics. Our algorithmappears to be superior also in terms of computation time. Furthermore, we point out several mistakes in the paper...

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...

In this paper we consider the uncapacitated economic lot-size model, where demand is adeterministic function of price. In the model a single price need to be set for all periods. Theobjective is to find an optimal price and ordering decisions simultaneously. In 1973 Kunreuther and Schrage...

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal in a dynamic environment. This means that the handling times are not known exactly beforehand and that the order in which the different pieces of equipment...

The roster planning process at the Dutch security firm NVD was traditionally carried out by hand. A few years NVD was traditionally carried out by hand. A few years ago, because of changing labor laws in the Netherlands, this became practically impossible. We developed a decision support system...