Packing and cutting problems have been considered a subdiscipline of operation research for more than half a century. These problems can arise in numerous settings, including pallet loading, fabric, paper, wood, metal, glass cutting, textile production, and multiprocessing scheduling. This article focuses on the 2D strip packing problem, which belongs to the NP-hard class of problems. There are three categories of rectangular strip packing problems (offline, online, and almost). The main objective of this paper is to provide a concise overview of the effective heuristics used to solve the 2D offline rectangular strip packing problem over the past twelve years. Based on a search methodology, 31 papers are found and analyzed. The statistical analysis indicates that 62% of researchers tend to implement heuristic methods. In addition, the most optimal solutions for the most recent updates of the 2DSPPs, which account for less than 15% of collected papers, are still necessary to cope with changes and assess the quality of the proposed solution approaches. Some recommendations for future research are presented in the conclusion.