Irrigation Scheduling. I: Integer Programming Approach

Abstract

This paper shows how a sequential irrigation schedule for a tertiary unit can be interpreted as a single machine scheduling problem with earliness, tardiness, and a common deadline. An integer program solution is presented for this irrigation scheduling problem. Two different models are presented to reflect different management options at the tertiary level. The first model allows jobs to be scheduled noncontiguously. In the second model only contiguous jobs are allowed. The second model has three submodels reflecting the various ways in which contiguous jobs can be scheduled over a fixed interval. Earlier work in determining unit costs of earliness/tardiness is reviewed and an alternative improved method is suggested. The models presented in this paper are applied to a tertiary unit with 16 users, both as a single interval and multi-interval irrigation scheduling problem. An alternative integer program is also presented which although computationally more efficient can only be used for single period scheduling problems. The models developed in this paper can be used to solve small scheduling problems and also to calibrate the heuristics as presented in the companion paper.