scholarly journals MINIMIZAÇÃO DE CUSTOS DE TRANSPORTE FLORESTAL COM A UTILIZAÇÃO DA PROGRAMAÇÃO LINEAR

FLORESTA ◽  
2003 ◽  
Vol 33 (1) ◽  
Author(s):  
Ricardo Berger ◽  
Romano Timofeiczyk Jr ◽  
Celso Carnieri ◽  
Pedro Giovani Lacowicz ◽  
José Sawinski Junior ◽  
...  
Keyword(s):  
Linear Programming ◽  
Unit Volume ◽  
Lower Cost ◽  
Maximum Volume ◽  
Truck Loading ◽  
Ideal Number ◽  
The Cost ◽  
The Ideal

A complexidade do planejamento do transporte florestal de madeira levou ao desenvolvimento de um método que auxiliasse na determinação das melhores rotas a serem seguidas por caminhões, para se conseguir um menor custo possível para um máximo volume de madeira posto pátio. Baseando-se na solução do problema do transporte através da programação linear, o método descrito neste trabalho permite, em uma situação de diversas origens e um único destino, análises quanto ao número ideal de viagens, carga ótima por veículo, menor custo por unidade de volume e quilometragem máxima mensal. Os resultados obtidos nos estudos de casos mostram adequação econômica do método de planejamento do transporte por programação linear, havendo um aumento de 22,70% no volume de madeira posto pátio e uma redução de 18,33% no custo por estéreo posto pátio. FORESTRY TRANSPORTATION COSTS MINIMIZATION USING LINEAR PROGRAMMING Abstract The complexity of planning the forest transport leads to developing of a method to aid in the determination of the best routes to be used for trucks, aiming to the lower cost possible for de maximum volume of wood transported. Aiming to the solution of this problem of transport trough linear programming, the method reported in this work allows in situation of several wood origins and just one destine, analyzes on the ideal number of traveling, the optimum truck loading, the lower cost per wood unit volume and the maximum monthly truck mileage. The results obtained in this case study showed economic adequation of the method to transport planning using linear programming, accounting the increase of 22,7% in the wood volume delivery and reduction of 18,33% in the cost on the same number of trucks.

Developing Schedule With Linear Programming (Case Study: STTF II Project Komplek Sukamukti Banjaran)

2020 ◽  
Vol 4 (02) ◽  
pp. 34-45
Author(s):  
Naufal Dzikri Afifi ◽  
Ika Arum Puspita ◽  
Mohammad Deni Akbar
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Time Limit ◽  
Minimum Time ◽  
Service Cost ◽  
Trade Off ◽  
Overtime Work ◽  
The Cost

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

scholarly journals A new stemming application for blasting: a case study

2013 ◽  
Vol 66 (4) ◽  
pp. 513-519 ◽  
Author(s):  
Halim Cevizci
Keyword(s):  
Conventional Method ◽  
Unit Volume ◽  
Drill Cuttings ◽  
Explosive Energy ◽  
Limestone Quarry ◽  
Conventional Methods ◽  
Quarry Blasting ◽  
The Cost ◽  
Better Than

Drill cuttings are generally used in open pits and quarries as the most common stemming material, since these are most readily available at blast sites. The plaster stemming method has been found to be better than the drill cuttings stemming method, due to increased confinement inside the hole and better utilization of blast explosive energy in the rock. The main advantage of the new stemming method is the reduction in the cost of blasting. At a limestone quarry, blasting costs per unit volume of rock were reduced by 7%. This is obtained by increasing burden and spacing distances. In addition, better fragmentation was obtained by using the plaster stemming method. Blast trials showed that plaster stemming produced finer material than the conventional methods. In the same blast tests, +20 cm size fragments reduced to 42.6% of the total, compared to 48.7% in the conventional method of drill cuttings stemming.

scholarly journals Integer linear programming outperforms simulated annealing for solving conservation planning problems

2019 ◽  
Author(s):  
Richard Schuster ◽  
Jeffrey O. Hanson ◽  
Matt Strimas-Mackey ◽  
Joseph R. Bennett
Keyword(s):  
Linear Programming ◽  
Simulated Annealing ◽  
Integer Linear Programming ◽  
Conservation Planning ◽  
Practical Advantage ◽  
Processing Times ◽  
Conservation Plans ◽  
The Cost ◽  
Planning Problems

AbstractThe resources available for conserving biodiversity are limited, and so protected areas need to be established in places that will achieve objectives for minimal cost. Two of the main algorithms for solving systematic conservation planning problems are Simulated Annealing (SA) and Integer linear programming (ILP). Using a case study in British Columbia, Canada, we compare the cost-effectiveness and processing times of SA versus ILP using both commercial and open-source algorithms. Plans for expanding protected area systems based on ILP algorithms were 12 to 30% cheaper than plans using SA. The best ILP solver we examined was on average 1071 times faster than the SA algorithm tested. The performance advantages of ILP solvers were also observed when we aimed for spatially compact solutions by including a boundary penalty. One practical advantage of using ILP over SA is that the analysis does not require calibration, saving even more time. Given the performance of ILP solvers, they can be used to generate conservation plans in real-time during stakeholder meetings and can facilitate rapid sensitivity analysis, and contribute to a more transparent, inclusive, and defensible decision-making process.

scholarly journals KERAGAAN AGROINDUSTRI DAN POSISI PRODUK BERDASARKAN SIKLUS HIDUP PRODUK PADA SOSIS GULUNG VARIAN NOODLE DI CV CUCURUTUKU CERIA

2021 ◽  
Vol 9 (4) ◽  
pp. 561
Author(s):  
Meliani Indah Sari ◽  
Dyah Aring Hepiana Lestari ◽  
Wuryaningsih Dwi Sayekti
Keyword(s):  
Life Cycle ◽  
Product Life Cycle ◽  
Production Costs ◽  
Selling Price ◽  
Long Time ◽  
The Government ◽  
The Cost

This study aims to analyze the process production of sausage noodle roll, the income and production costs, the marketing action and determine the position based on the life cycle of sausage noodle roll as well learn the role of supporting service for sausage noodle roll in CV Cucurutuku Ceria. This research method is a case study. The determination of consumer samples is taken by Convenience Sampling. Analysis of the data used in this research is descriptive qualitative and quantitative analysis. The data of this study was collected in May 2019 until June 2019. The results showed that the value R/C>1, that means sausage noodle roll business was profitable. Calculation of the cost of production on sausage rolls noodles amounted to Rp1,046.53. The BEP unit calculation has been achieved for a long time, in the amount of 42,791 units from the BEP calculation of 604 units. The noodle rolls sausage has also obtained a profit from the selling price of Rp ,000.00 per pcs from the calculation of the BEP price of Rp1,238.58 per pcs. The marketing mix that has been utilized by CV Cucurutuku Ceria is collaboration with e-commerce companies namely gofood and grabfood to facilitate consumers in the ordering process and CV Cucurutuku Ceria has utilized social media as promotional activities for sausage noodle roll product. In the product life cycle, sausage noodle roll are in a stage of decline. CV Cucurutuku Ceria has not fully utilized the government policies regarding the protection and empowerment of Micro, Small and Medium Enterprises.Keywords: cost, noodle, position, and sausage

scholarly journals Evaluating The Performance of Inventory Management The Production Division of PT. Tiga Serangkai Surakarta as a Case Study

2016 ◽  
Vol 1 (1) ◽  
pp. 93
Author(s):  
Sri Maryati
Keyword(s):  
Inventory Management ◽  
System Performance ◽  
Service Level ◽  
Inventory System ◽  
Order Quantity ◽  
Safety Stock ◽  
Production Employee ◽  
The Cost

This research aims to understand the process of production and to analyze the performance of inventory system on production division of PT. Tiga Serangkai. The data has been gathered from direct observation of the process production and warehouse and the interview with the production employee, the employee of warehouse division, supervisor of purchasing and finance manager. This research demonstrates that inventory system performance of PT. Tiga Serangkai Surakarta can be optimized through the determination of inventory policy, applying a model minimum and maximum inventory that considers the safety stock in accordance with service level plan, implementing model Reorder Point (ROP) which can be used as guidelines in charging supply back, and applying the model economic ordering quantity. In doing so, they can save the cost of inventory. Keywords: inventory management, economic order quantity (EOQ), PT. Tiga Serangkai 

Determination of the Optimal Number of Suppliers Considering the Risk: Emersun Company as a Case Study

2012 ◽  
Vol 433-440 ◽  
pp. 5873-5880 ◽  
Author(s):  
Nasim Mirahmadi ◽  
Esmaeel Saberi ◽  
Ebrahim Teimoury
Keyword(s):  
Supply Chain ◽  
Optimal Number ◽  
Development Cost ◽  
Supply Risk ◽  
Proposed Model ◽  
Management Area ◽  
The Cost ◽  
Tree Approach

Determining the number of suppliers chosen for cooperation in a supply chain is one of the most important problems in the supply chain management area. Regarding the fact that simultaneously decreasing the risk and cost is one of the most important objectives of every organization, besides the cost, the risk has also been introduced in the recent researches, as one of the most important criteria. In this paper, the decision tree approach is used for determining the optimal number of suppliers considering the supply risk and it has been tried to develop an applied method through expanding the cost criteria. The proposed model in this paper, therefore, contains any kind of cost ingredients such as cost of suppliers development, cost of suppliers management, cost of missing discount in volume due to increase in number of suppliers in supply base, and loss cost due to supply postponement from suppliers. This approach is implemented in Emersun Company.

scholarly journals THE LEAST COST SUPER REPLICATING PORTFOLIO IN THE BOYLE–VORST MODEL WITH TRANSACTION COSTS

2008 ◽  
Vol 11 (01) ◽  
pp. 55-85 ◽  
Author(s):  
GUAN-YU CHEN ◽  
KEN PALMER ◽  
YUAN-CHUNG SHEU
Keyword(s):  
Linear Programming ◽  
Transaction Costs ◽  
Lower Cost ◽  
Contingent Claim ◽  
Binomial Model ◽  
Transactions Costs ◽  
Put Options ◽  
The Cost ◽  
Replicating Portfolio ◽  
Period Model

Boyle and Vorst work in the framework of the binomial model and derive self-financing strategies perfectly replicating the final payoffs to long and short positions in call and put options, assuming proportional transactions costs on trades in the stock and no transactions costs on trades in the bond. Even when the market is arbitrage-free and a given contingent claim has a unique replicating portfolio, there may exist super replicating portfolios of lower cost. Bensaid et al. gave conditions under which the cost of the replicating portfolio does not exceed the cost of any super replicating portfolio. These results were generalized by Stettner, Rutkowski and Palmer to the case of asymmetric transaction costs. In this paper, we first determine the number of replicating portfolios and then compute the least cost super replicating portfolio for any contingent claim in a one-period binomial model. By using the fundamental theorem of linear programming, we show that there are only finitely many possibilities for a least cost super replicating portfolio for any contingent claim in a two-period binomial model. As an application of our results, we give an example in which we compute the least cost super replicating portfolio for a butterfly spread in a two-period model.

Sign in / Sign up

Export Citation Format

Share Document