A repeated sequencing problem in agricultural management

The agricultural production process is linked with the fixation of a large number of decisions for improving the productivity and obtaining the maximum yield when the number of available resources is limited. Supposing a certain technical itinerary of the tasks has to be developed during an interval of time, and that each task admits different means for its realization, the posed problem is to select how and in which moment each task should be developed, in such a way that the tasks are sequenced with the smaller possible cost regarding the possible precedence relationships among them and the way in which each of them is realized within its time window and the feasible resources be assigned. In this paper two alternative mathematical programming models for obtaining the pre-established objective are presented. The first one considers the problem as a sequencing one and the other is based on the flexible manufacturing models. At the end an example is presented. It permits us to compare both modelling approaches.