The University of Southampton
University of Southampton Institutional Repository

Irrigation scheduling II: Heuristics approach

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
0733-9437
17-25
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509

Anwar, Arif A. and De Vries, Tonny T. (2004) Irrigation scheduling II: Heuristics approach. Journal of Irrigation and Drainage Engineering, ASCE, 130 (1), 17-25.

Record type: Article

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.

Full text not available from this repository.

More information

Published date: 2004
Keywords: algorithms, irrigation scheduling, optimization, water allocation policy

Identifiers

Local EPrints ID: 39380
URI: https://eprints.soton.ac.uk/id/eprint/39380
ISSN: 0733-9437
PURE UUID: ed7fcba6-e7bc-478c-89c4-5ed78d64469a
ORCID for Arif A. Anwar: ORCID iD orcid.org/0000-0002-3071-3197

Catalogue record

Date deposited: 28 Jun 2006
Last modified: 06 Jun 2018 13:01

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×