期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Evaluation of Replacement Policies in Sow Farms Using Arena^(TM) Simulation Software
1
作者 Marco Antonio Montufar Benitez Luis M.Pla Aragones +2 位作者 Marco A.Serrato Garcia Oscar Montano Arango jose ramon corona armenta 《Intelligent Control and Automation》 2014年第3期126-135,共10页
This paper presents an application of the simulation of discrete events (SED) using ARENATM in the management of large-scale breeding farms. The main objective of the simulation model is to find a policy of replacemen... This paper presents an application of the simulation of discrete events (SED) using ARENATM in the management of large-scale breeding farms. The main objective of the simulation model is to find a policy of replacement, to ensure the best economic performance of a farm. The only variant analyzed of replacement policy was the number of cycles set in permanency for a sow in the herd. Considered incomes come from the sale of piglets and unproductive sows, and costs are due to the feeding of animals, replacement sows purchases, and the operation expenses of the farm. For this analysis, the production process was divided into three major stages called: mating, pregnancy or gestation and lactation. The sow’s movement from one stage to other was modeled by cycle-dependent transition probabilities. Considering the daily utility, as response variable, the model shows the best number of cycles to maintain the sows. 展开更多
关键词 Simulation ARENA^(TM) Farm Management Sows Replacement
下载PDF
A Reward Functional to Solve the Replacement Problem
2
作者 Eva Selene Hernández Gress Oscar Montano Arango +1 位作者 jose ramon corona armenta Antonio Oswaldo Ortega Reyes 《Intelligent Control and Automation》 2012年第4期413-418,共6页
The replacement problem can be modeled as a finite, irreducible, homogeneous Markov Chain. In our proposal the problem was modeled using a Markov decision process and then, the instance was optimized using dynamic pro... The replacement problem can be modeled as a finite, irreducible, homogeneous Markov Chain. In our proposal the problem was modeled using a Markov decision process and then, the instance was optimized using dynamic programming. We proposed a new functional that includes a reward functional, that can be more helpful in processing industries because it considerate instances like incomes, maintenance costs, fixed costs to replace equipment, purchase price and salvage values;and this functional can be solved with dynamic programming and used to make effective decisions. Two theorems are proved related with this new functional. A numerical example is presented in order to demonstrate the utility of this proposal. 展开更多
关键词 Markov Chains Dynamic Programming Replacement Problem
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部