Irrigation Scheduling with Travel Times

In preparing water allocation schedules for fields in a lateral unit, the time required for water to travel from one point on a lateral to another can be significant and is dependent on the sequence in which users abstract water. This paper illustrates the problem of ignoring travel time and/or considering travel time to be sequence independent. For two users, each requesting water for a duration of 4 h, by assuming travel time to be sequence independent, one user receives water for 5 h, a 25% increase, and the other receives water for only 3 h, a 25% decrease. This paper presents a formulation of the irrigation scheduling problem for sequential users with sequent dependent travel time. The formulation is implemented as an integer program and applied to part of a lateral unit on the Juan Distributary, Haryana, India. Two models are presented, the first of which allows for noncontiguous jobs, i.e., idle time is permitted between jobs. The second model does not permit noncontiguous jobs.