Publication: Two alternative models for farm management: Discrete versus continuous time horizon
Loading...
Full text at PDC
Publication Date
2003-02-01
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science
Citations
Exportar
Abstract
Crop production entails many decision making processes aimed at improving productivity and achieving the best yield from scarce resources. Assuming that there is a set of tasks to be carried out within a given time horizon, and each task can be performed in different ways, the problem consists of determining how and when to carry out each task, in such a way that the tasks are scheduled in sequence at the minimum cost, taking into account any precedence relationships among them, the time window constraints for performing the tasks and the resources availability. This paper presents two alternative mathematical models to attain the proposed objective. The first model splits the time into discrete units spread throughout the planning horizon; it is presented in connection with flexible manufacturing. The second model keeps a continuous time horizon; a scheduling model is used for which a family of incompatibility conditions is introduced to avoid a certain type of simultaneous usage of resources. This type of conditions require to introduce a new structure so-called conditional disjunction. Computational experience is reported for real-life problems.
Description
UCM subjects
Unesco subjects
Keywords
Citation
M. van den Akker, C.A.J. Hurkens, M.W.P. Savelsbergh, Time-indexed formulations for machine scheduling problems: Column generation, INFORMS Journal on Computing 12 (2000) 111–124.
E. Balas, Machine sequencing via disjunctive graphs: An implicit enumeration algorithm, Operations Research 17 (1969) 941–957.
E.M.L. Beale, J.A. Tomlin, Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables, in: J. Lawrence (Ed.), Proceedings of the Fifth International Conference on Operations Research, Tavistock Publications, London, 1970, pp. 447–454.
J.R. Birge, F. Louveaux, Introduction to Stochastic Programming, Springer-Verlag, Berlin, 1997.
K. Darby-Dowman, S. Barker, E. Audsley, D. Parsons, A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture, Journal of the Operational Research Society 51 (2000) 83–89.
J. van Elderen, Heuristic strategy for scheduling farm operations, Centre for Agricultural Publishing and Documentation, PUDOC Wageningen, 1977.
J. van Elderen, Scheduling of Field Operations, Bayer. Landwirtsch, 1981.
L.F. Escudero, S3 sets. An extension of the Beale–Tomlin special ordered sets, Mathematical Programming 42 (1988) 113–123.
G. Fokkens, R.J. Puylaert, A Linear Programming Model for daily harvesting operations at the large-scale grain farm of the IJsselmeerpolders Development Authority, Journal of the Operational Research Society 32 (1981) 535–547.
Z. Gu, G.L. Nemhauser, M.W.P. Savelsberg, Lifted cover inequalities for 0–1 integer programs, In: Computation, COG 94-09, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA, 1994.
Y. Lee, H.F. Sherali, Unrelated machine scheduling with time-window and machine-downtime constraints: An application to a naval battle group problem, Annals of Operations Research 50 (1994) 339–365.
G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
M.T. Ortuño, B. Recio, B. Vitoriano, Modelizaci_on del Problema de Planificaci_on y Asignaci_on de Recursos para una explotaci_on agraria, Investigaci_on Operacional 19 (1998) 116–127.
B. Recio, Sistema de Soporte a la Decisi_on para la Planificaci_on de Operaciones de Cultivo, Aplicaci_on al Cultivo de Cereal en Navarra, PhD Thesis, Universidad Polit_ecnica de Madrid, 1992.
J. Sousa, L.A. Wolsey, Time-indexed formulations of non-preemptive single machine scheduling problems, Mathematical Programming 54 (1992) 353–367.
L.A. Wolsey, Valid inequalities for mixed integer programs with generalised and variable upper bound constraints, Discrete Applied Mathematics 25 (1990) 251–261.
L.A. Wolsey, MIP modelling of changeouvers in production planning and scheduling problems, European Journal of Operational Research 99 (1997) 154–165.