Arık, Oğuzhan Ahmet2025-02-242025-02-2420212662-255610.1007/s43069-021-00069-w2-s2.0-85126296917https://doi.org/10.1007/s43069-021-00069-whttps://hdl.handle.net/20.500.14440/567This paper integrates forest harvesting and plantation operations considering the industry’s long-term demand. Forest harvesting problem has been still one of the open problems in operational research, and the problem is interesting because forests are nonrenewable natural resources in short term. Each harvested tree must be replanted within a plantation plan in order to protect the ecosystem and future generation’s needs for forestry goods. A dynamic mixed integer programming approach is proposed for the problem. Furthermore, three hypothetical examples of different sizes are presented for the problem. © 2021, The Author(s), under exclusive licence to Springer Nature Switzerland AG.eninfo:eu-repo/semantics/closedAccess90C27Adjacency constraintForest managementHarvestingMaximum area restrictionMixed integer programmingPlantationArticle2Q22