Abstract: With the daily car deployment in car rental industry as background for this work,the fleet scheduling problem is addressed in this paper.The car deployment among rental locations is formulated as a timespace network.With this formulation,constraints for this scheduling problem are obtained according to the supply policy and flow balance at each node.After analyzing the characteristics of the model,the problem was decomposed into two subproblems by using Benders decomposition,and a solution algorithm is proposed.A numerical example with a oneweek scheduling horizon is given to demonstrate the effectiveness of the proposed method.Results show that it works well.  

Key words:  fleet scheduling, car deployment, Benders decomposition, car rental, time-space network