<p>This paper considers a recently introduced NP-hard problem called the single-machine scheduling problem with periodical resource constraints (SMPRC). The goal is to minimize the total time required for all jobs to be completed on a single machine, taking into account the time and resource consumption constraints per period. In order to solve this problem, a heuristic based on Variable Neighborhood Search (VNS) is developed. To the author’s knowledge, this problem has not yet been solved using VNS-based methods. Computational experiments were carried out on a set of test instances from the literature, and the obtained results are compared with the results of other methods from the literature. In addition, optimality of some VNS solutions was verified with the CPLEX solver.</p>