Two alternative models for farm management: Discrete versus continuous time horizon
暂无分享,去创建一个
Begoña Vitoriano | Antonio Alonso-Ayuso | M. Teresa Ortuño | B. Recio | F. Rubio | M. T. Ortuño | F. Rubio | B. Vitoriano | A. Alonso-Ayuso | B. Recio
[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..