Two alternative models for farm management: Discrete versus continuous time horizon

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.

[1]  Laurence A. Wolsey,et al.  MIP modelling of changeovers in production planning and scheduling problems , 1997 .

[2]  Laureano F. Escudero,et al.  S3 sets. An extension of the Beale-Tomlin special ordered sets , 1988, Math. Program..

[3]  B. Fokkens,et al.  A Linear Programming Model for Daily Harvesting Operations at the Large-Scale Grain Farm of the IJsselmeerpolders Development Authority , 1981 .

[4]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[5]  K Darby-Dowman,et al.  A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture , 2000, J. Oper. Res. Soc..

[6]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[7]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[9]  Hanif D. Sherali,et al.  Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem , 1994, Ann. Oper. Res..

[10]  van E. Elderen Scheduling of field operations , 1981 .

[11]  W. R. Buckland,et al.  Proceedings of the Fifth International Conference on Operational Research. OR 69. , 1971 .

[12]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..