A probabilistic dynamic programming model of rape seed harvesting
by J.R. Foulds, L.R. Foulds
International Journal of Operational Research (IJOR), Vol. 1, No. 4, 2006

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.

Online publication date: Mon, 10-Jul-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com