4.2 Article

Optimization of forest harvest scheduling at the operational level, considering precedence relationship among harvesting activities

期刊

出版社

TAYLOR & FRANCIS INC
DOI: 10.1080/14942119.2022.2085464

关键词

Mix-integer linear programming; operational harvest scheduling; precedence relationship; harvesting costs

类别

向作者/读者索取更多资源

A mixed-integer linear programming model is developed in this paper to optimize the scheduling of harvesting activities, considering the precedence relationship among activities. The objective is to minimize the total costs by determining the start and end time of each activity at each cut block while considering machine movement time. The model is applied to a case study of a large forest company in British Columbia, Canada, with the result of a harvesting cost only 1.37% higher than the lowest possible cost and only 3 idle machines. A detailed harvesting schedule is generated based on the start and end time and operating time of each activity at each cut block.
The competitiveness of forest companies is strongly affected by the costs associated with getting the raw material to the mills. As harvesting costs contribute significantly to this cost, mathematical programming models were developed to optimize the scheduling of harvest activities within and between cut blocks to reduce the overall cost. However, the precedence relationship between harvesting activities occurring concurrently across multiple cut blocks has not been considered in the existing literature. In this paper, a mixed-integer linear programming model is developed to optimize the scheduling of harvesting activities, considering the precedence relationship among harvesting activities. The objective of the model is to minimize the total costs. The model determines the start time and end time of each harvesting activity at each cut block, considering the movement time of machines between cut blocks. The model is applied to the case of a large forest company in British Columbia, Canada. The model's harvesting cost is only 1.37% higher than the lowest possible harvesting cost, and only 3 assigned machines have an idle time. The detailed harvesting schedule is generated based on the start time, the end time, and the operating time for each activity at each cut block.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据