Irrigation scheduling II: Heuristics approach
Irrigation scheduling II: Heuristics approach
A sequential irrigation schedule that honors user demands of duration and minimizes earliness and tardiness is interpreted as a single-machine schedule with earliness and tardiness costs and a common deadline (or fixed interval). A heuristic solution is presented for this irrigation scheduling problem. Four models are presented to reflect the different methods in which an irrigation system at the tertiary unit level may be operated, the first model permits jobs to be noncontiguous, i.e., idle time between jobs is permitted, whereas the others permit contiguous jobs only.
The heuristic is tested extensively and the solution quality is compared with either an optimum solution from an integer program or the best available solution obtained from an integer program within allocated computation time. The heuristic is computationally efficient for all models presented, however for schedules with noncontiguous jobs, or where idle time is inserted before and after a contiguous set of jobs, solution quality deteriorates. The work brings the science of single scheduling from operations research into irrigation scheduling and suggests areas for further development.
algorithms, irrigation scheduling, optimization, water allocation policy
17-25
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509
2004
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509
Abstract
A sequential irrigation schedule that honors user demands of duration and minimizes earliness and tardiness is interpreted as a single-machine schedule with earliness and tardiness costs and a common deadline (or fixed interval). A heuristic solution is presented for this irrigation scheduling problem. Four models are presented to reflect the different methods in which an irrigation system at the tertiary unit level may be operated, the first model permits jobs to be noncontiguous, i.e., idle time between jobs is permitted, whereas the others permit contiguous jobs only.
The heuristic is tested extensively and the solution quality is compared with either an optimum solution from an integer program or the best available solution obtained from an integer program within allocated computation time. The heuristic is computationally efficient for all models presented, however for schedules with noncontiguous jobs, or where idle time is inserted before and after a contiguous set of jobs, solution quality deteriorates. The work brings the science of single scheduling from operations research into irrigation scheduling and suggests areas for further development.
This record has no associated files available for download.
More information
Published date: 2004
Keywords:
algorithms, irrigation scheduling, optimization, water allocation policy
Identifiers
Local EPrints ID: 39380
URI: http://eprints.soton.ac.uk/id/eprint/39380
ISSN: 0733-9437
PURE UUID: ed7fcba6-e7bc-478c-89c4-5ed78d64469a
Catalogue record
Date deposited: 28 Jun 2006
Last modified: 16 Mar 2024 02:55
Export record
Altmetrics
Contributors
Author:
Tonny T. De Vries
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
