A probabilistic dynamic programming model of rape seed harvesting

J.R. Foulds and L.R. Foulds

International Journal of Operational Research, 2006, vol. 1, issue 4, 410-428

Abstract: We discuss a practical scenario from an operations scheduling viewpoint involving commercial contracting enterprises that visit farms in order to harvest rape seed crops. We report on a probabilistic dynamic programming formulation that was designed specifically for scenarios of the type described. The paper is an extension of previous work from the deterministic one-farm case to allow for: the specific considerations necessary to harvest a particular crop, namely rape seed, harvesting at multiple farms, machine failure, and the fact that activity duration times are uncertain. The computational times experienced in solving practical instances of the formulation are encouraging.

Keywords: crop harvesting; operations scheduling; probabilistic dynamic programming; machine failure; rape seed harvesting; multiple farms; agriculture. (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=10213 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:1:y:2006:i:4:p:410-428

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().