...
首页> 外文期刊>Journal of Forest Planning >A Long-Term Harvest Scheduling Model Involving Two Types of Rotation and Variable Labour Requirements
【24h】

A Long-Term Harvest Scheduling Model Involving Two Types of Rotation and Variable Labour Requirements

机译:包含两种轮换和可变劳动需求的长期收获调度模型

获取原文
获取原文并翻译 | 示例
           

摘要

The objectives of this study were to formulate a long-term harvest scheduling model, involving two types of rotation constrained by the available size of the work force, using 0-1 integer programming and then apply the model to plantation forests in the University of Tokyo Chiba Forest as a case study. The following three silvicultural systems were considered: an 80-year and a 160-year rotation clearcutting system and a non-clearcutting system. The minimum amount of labour required to harvest the minimum area was calculated and then that figure was increased to model its effect on harvesting. Subcompartments better suited to timber production tended to be assigned to clearcutting. There was a tendency for subcompartments with a better site class tobe assigned to the shorter rotation and subcompartments with a shorter yarding distance to be assigned to the longer rotation. As the size of the available work force increased, subcompartments less well suited to timber production were also assigned toclearcutting and the harvest volume per person-day and the clear cut area per person-day decreased. The longer rotation was efficient with a smaller work force and the shorter rotation appeared more efficient as the size of the work force increased.
机译:这项研究的目的是使用0-1整数编程制定一个长期采伐计划模型,该模型涉及受可用劳动力规模限制的两种轮换,然后将该模型应用于东京大学的人工林以千叶森林为例。考虑了以下三个造林系统:一个80年和一个160年的轮换清除系统和一个非清除系统。计算了收获最小面积所需的最小劳动量,然后将该数字增加以模拟其对收获的影响。较适合木材生产的小班室往往被分配为伐木场。有一种趋势是,将具有更好站点类别的子隔间分配给较短的轮换,将具有更短码距的子隔间分配给较长的轮换。随着可用劳动力规模的增加,不太适合木材生产的小班也被划入了伐木区,每人日的采伐量和每人日的伐木区减少了。旋转时间越长,工作力越小,效率越高;而旋转时间越短,随着工作力大小的增加,效率越高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号