Abstract
To obtain a schedule for farm operations with techniques like linear programming or dynamic programming is a time-consuming task. It asks for a lot of computer-memory and therefore, only small problems can be solved. But, practice asks for better solvers which can be used for large problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wijngaard, P. (1988). A Heuristic for Scheduling Problems Especially for Scheduling Farm Operations. In: Schellhaas, H., van Beek, P., Isermann, H., Schmidt, R., Zijlstra, M. (eds) DGOR/NSOR. Operations Research Proceedings, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73778-7_171
Download citation
DOI: https://doi.org/10.1007/978-3-642-73778-7_171
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19365-4
Online ISBN: 978-3-642-73778-7
eBook Packages: Springer Book Archive