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 de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 2003-02, Vol.144 (3), p.613-628
Hauptverfasser: Vitoriano, B, Ortuño, M.T, Recio, B, Rubio, F, Alonso-Ayuso, A
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 628
container_issue 3
container_start_page 613
container_title European journal of operational research
container_volume 144
creator Vitoriano, B
Ortuño, M.T
Recio, B
Rubio, F
Alonso-Ayuso, A
description 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.
doi_str_mv 10.1016/S0377-2217(02)00143-1
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204155272</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221702001431</els_id><sourcerecordid>260768651</sourcerecordid><originalsourceid>FETCH-LOGICAL-c456t-dd19528a54b278278c86570548495c19fa975cb904e7adc3a430a858cdd8dec43</originalsourceid><addsrcrecordid>eNqFUE1PAyEUJEYT68dPMCGe9LAKLCysF2P8jk08VM8E4a3SdJcKtEZ_vdQar5I3DIeZCW8QOqDkhBLanE5ILWXFGJVHhB0TQnld0Q00okqyqlEN2USjP8k22klpSopKUDFCk6ePgM0sQxxM9kvAfXAwS7gLEXcm9rg3g3mFHoZ8hq98shEy4CXEtEjYhiH7YRHKM_se8FuI_isMe2irM7ME-7-8i55vrp8u76rx4-395cW4slw0uXKOtoIpI_gLk6qMVY2QRHDFW2Fp25lWCvvSEg7SOFsbXhOjhLLOKQeW17vocJ07j-F9ASnraViUPWZJM8KpEEyyIhJrkY0hpQidnkffm_ipKdGr-vRPfXrVjSZM_9SnafE9rH0R5mD_TFDONERIeqlrQzkv92cBI6Qu5AtWPC9oaK0bpvRb7kva-TqtdAtLD1En62Gw4HwEm7UL_p__fAP_uZCc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204155272</pqid></control><display><type>article</type><title>Two alternative models for farm management: Discrete versus continuous time horizon</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Vitoriano, B ; Ortuño, M.T ; Recio, B ; Rubio, F ; Alonso-Ayuso, A</creator><creatorcontrib>Vitoriano, B ; Ortuño, M.T ; Recio, B ; Rubio, F ; Alonso-Ayuso, A</creatorcontrib><description>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><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(02)00143-1</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Comparative analysis ; Decision making ; Farm management ; Farming ; Logical constraints ; Mathematical models ; Planning ; Scheduling ; Studies ; Time-indexed constraints</subject><ispartof>European journal of operational research, 2003-02, Vol.144 (3), p.613-628</ispartof><rights>2002 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Feb 1, 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c456t-dd19528a54b278278c86570548495c19fa975cb904e7adc3a430a858cdd8dec43</citedby><cites>FETCH-LOGICAL-c456t-dd19528a54b278278c86570548495c19fa975cb904e7adc3a430a858cdd8dec43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(02)00143-1$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,777,781,3537,3994,27905,27906,45976</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a144_3ay_3a2003_3ai_3a3_3ap_3a613-628.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Vitoriano, B</creatorcontrib><creatorcontrib>Ortuño, M.T</creatorcontrib><creatorcontrib>Recio, B</creatorcontrib><creatorcontrib>Rubio, F</creatorcontrib><creatorcontrib>Alonso-Ayuso, A</creatorcontrib><title>Two alternative models for farm management: Discrete versus continuous time horizon</title><title>European journal of operational research</title><description>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><subject>Comparative analysis</subject><subject>Decision making</subject><subject>Farm management</subject><subject>Farming</subject><subject>Logical constraints</subject><subject>Mathematical models</subject><subject>Planning</subject><subject>Scheduling</subject><subject>Studies</subject><subject>Time-indexed constraints</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFUE1PAyEUJEYT68dPMCGe9LAKLCysF2P8jk08VM8E4a3SdJcKtEZ_vdQar5I3DIeZCW8QOqDkhBLanE5ILWXFGJVHhB0TQnld0Q00okqyqlEN2USjP8k22klpSopKUDFCk6ePgM0sQxxM9kvAfXAwS7gLEXcm9rg3g3mFHoZ8hq98shEy4CXEtEjYhiH7YRHKM_se8FuI_isMe2irM7ME-7-8i55vrp8u76rx4-395cW4slw0uXKOtoIpI_gLk6qMVY2QRHDFW2Fp25lWCvvSEg7SOFsbXhOjhLLOKQeW17vocJ07j-F9ASnraViUPWZJM8KpEEyyIhJrkY0hpQidnkffm_ipKdGr-vRPfXrVjSZM_9SnafE9rH0R5mD_TFDONERIeqlrQzkv92cBI6Qu5AtWPC9oaK0bpvRb7kva-TqtdAtLD1En62Gw4HwEm7UL_p__fAP_uZCc</recordid><startdate>20030201</startdate><enddate>20030201</enddate><creator>Vitoriano, B</creator><creator>Ortuño, M.T</creator><creator>Recio, B</creator><creator>Rubio, F</creator><creator>Alonso-Ayuso, A</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20030201</creationdate><title>Two alternative models for farm management: Discrete versus continuous time horizon</title><author>Vitoriano, B ; Ortuño, M.T ; Recio, B ; Rubio, F ; Alonso-Ayuso, A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c456t-dd19528a54b278278c86570548495c19fa975cb904e7adc3a430a858cdd8dec43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Comparative analysis</topic><topic>Decision making</topic><topic>Farm management</topic><topic>Farming</topic><topic>Logical constraints</topic><topic>Mathematical models</topic><topic>Planning</topic><topic>Scheduling</topic><topic>Studies</topic><topic>Time-indexed constraints</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vitoriano, B</creatorcontrib><creatorcontrib>Ortuño, M.T</creatorcontrib><creatorcontrib>Recio, B</creatorcontrib><creatorcontrib>Rubio, F</creatorcontrib><creatorcontrib>Alonso-Ayuso, A</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vitoriano, B</au><au>Ortuño, M.T</au><au>Recio, B</au><au>Rubio, F</au><au>Alonso-Ayuso, A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two alternative models for farm management: Discrete versus continuous time horizon</atitle><jtitle>European journal of operational research</jtitle><date>2003-02-01</date><risdate>2003</risdate><volume>144</volume><issue>3</issue><spage>613</spage><epage>628</epage><pages>613-628</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(02)00143-1</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 2003-02, Vol.144 (3), p.613-628
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204155272
source RePEc; Elsevier ScienceDirect Journals
subjects Comparative analysis
Decision making
Farm management
Farming
Logical constraints
Mathematical models
Planning
Scheduling
Studies
Time-indexed constraints
title Two alternative models for farm management: Discrete versus continuous time horizon
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T14%3A05%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Two%20alternative%20models%20for%20farm%20management:%20Discrete%20versus%20continuous%20time%20horizon&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Vitoriano,%20B&rft.date=2003-02-01&rft.volume=144&rft.issue=3&rft.spage=613&rft.epage=628&rft.pages=613-628&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(02)00143-1&rft_dat=%3Cproquest_cross%3E260768651%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204155272&rft_id=info:pmid/&rft_els_id=S0377221702001431&rfr_iscdi=true