Computer technology is increasingly used in the path planning and the optimization of agricultural machinery′s field operation. In this paper, the optimal path sequence strategies to minimize the total operating length and time of the vehicle′s headland turning are introduced, taking into consideration of the direction of the parallel paths in fields of rectangle boundary,a variety of possible strategies of headland turning,the agronomic requirements of different operating modes and the turning characteristics of machineries.First two kinds of new turning strategies were put forward after the analysis of the generation principle of the existing turning strategies. Then the scheduling problem was formulated into the traveling salesman problem (TSP), and the greedy search algorithm was utilized to address it. Simulation experimental results showed that the algorithm is efficient and robust, and the turning efficiency is significantly improved compared to the commonly-used scheduling and sorting strategies.