This paper addresses the planning programming of crop rotation in neighbor plots. The crops can have productive cycles with different duration and varied seasons for the planting. The planning includes restrictions of planting for neighbor plots and for sequence of crops in the rotation. Moreover, there are included crops for green fertilizing and periods of fallow. The rotations have the same duration in each plot. A 0-1 linear programming problem was developed to deal with the problem of maximizing the allocation on the plots, subject to the conditions described before. Computational experiments were carried out using examples from the real world with rotations of 2 years and 28 cultures.
integer linear programming; crop rotation
