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

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 this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that uses various combinatorial lower bounds....

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