Abstract
PurposeThe present study aims to analyse the presumed relationship between VLC use and students' grades.Design/methodology/approachThe research strategy unfolds as a case study (Yin, 1994), framed by how undergraduate students of pharmaceutical sciences used video lecture capture (VLC) and the impact of VLC on pedagogic differentiation. Looking at the course of Mechanistic Toxicology (MecTox), the objective is to describe this case of pharmaceutical sciences in depth.FindingsThe findings reveal that over 90% of students engaged with VLC videos, with the average viewing time exceeding the total available video minutes, indicating strong student engagement. The study particularly highlights VLC's positive impact on students with lower academic performance (grades D and E), suggesting that VLC can help reduce the performance gap and support a more inclusive educational environment.Research limitations/implicationsThe findings may have limited generalisability beyond the specific context and sample used. However, this study allows the research findings to be compared with previous research (Remi & atilde;o et al., 2022), contributing to the debate on how pedagogic research can promote evidence-based decisions regarding innovative strategies. The meaning of educational inclusion processes and diversity is, thus, contingent on the institutionalisation of research as a practice of teaching and learning.Practical implicationsThe results of this study thus provide interesting insights for the design of strategic action, considering the diversity of students as seen in parents' academic qualifications and students' conditions (e.g. student-workers, living away from home, holding a grant of economic and social support).Social implicationsThe implications of research findings for society bring the issue of equity in education to the fore. By addressing the diverse needs of students, HEIs can contribute to greater educational equity.Originality/valueUsing VLC as a differentiated pedagogic device might give diversity real content insofar as institutional and national policies can mitigate the possible negative effects of parents' low academic qualifications and the students' conditions of living away from their residence area and holding a grant of economic and social support.

Abstract
This paper describes a new heuristic for the nesting problem based on a 2-exchange neighbourhood generation strategy. This mechanism guides the search through the solution space consisting of the sequences of pieces and relies on a low-level placement heuristic to actually convert one sequence in a feasible layout. The placement heuristic is based on a bottom-left greedy procedure with the ability to fill holes in the middle of the layout at a later stage. Several variants of the 2-exchange nesting heuristic were implemented and tested with different initial solution ranking criteria, different strategies for selecting the next solution, and different neighbourhood sizes. The computational experiments were based on data sets published in the literature. In most of the cases, the 2-exchange nesting algorithm generated better solutions than the best known solutions.

Abstract
The nesting problem is a two-dimensional cutting and packing problem where the small pieces to cut have irregular shapes. A particular case of the nesting problem occurs when congruent copies of one single shape have to fill, as much as possible, a limited sheet. Traditional approaches to the nesting problem have difficulty to tackle with high number of pieces to place. Additionally, if the orientation of the given shape is not a constraint, the general nesting approaches are not particularly successful. This problem arises in practice in several industrial contexts such as footwear, metalware and furniture. A possible approach is the periodic placement of the shapes, in a lattice way. In this paper, we propose three heuristic approaches to solve this particular case of nesting problems. Experimental results are-compared with published results in literature and additional results obtained from new instances are also provided.

Abstract
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space while linear programming models are solved to generate neighbourhoods during the search process. These linear programming models, which are used to locally optimise the layouts, derive from the application of compaction and separation algorithms. Computational tests were run using instances that are commonly used as benchmarks in the literature. The best results published so far have been improved by this new hybrid packing algorithm.

Abstract
This paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional complexity and originality to the problem. In particular, this is a matter of practical and economic relevance, since the solution methods are intended to be implemented in a real-life industrial environment. The concept of dynamic graph is exploited to deal with the arc routing problem under study, which is modelled as a dynamic rural postman problem. The constructive heuristics developed, the "higher up vertex heuristic" (HUV) and the "minimum empty path heuristic" (MEP) are tested with real data sets.

Abstract
In this paper we present a new constructive algorithm for nesting problems. The layout is built by successively adding a new piece to a partial solution, i.e. to the set of pieces previously nested. Several criteria to choose the next piece Co place and its orientation are proposed and tested. Different objective functions are also proposed to evaluate and compare partial solutions. A total of 126 variants of the algorithm, generated by the complete set of combinations of criteria and objective functions, are computationally tested. The computational experiments are based on data sets published in the literature or provided by other authors. In some cases this new algorithm generates better solutions than the best known (published) solutions.