Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdifficultiesarisewhentheinstancesarehighly degenerate. Recent research has been devoted to accelerate column generation while remaining within the linear programming framework. This paper presents an efficient approach to solve the linear relaxation of the MDVSP. It combines column generation, preprocessing variable fixing, and stabilization.The outcome shows the great potential of such an approach for degenerate instances. ᭧ 2005 Published by Elsevier Ltd.