Local search approaches for the test laboratory scheduling problem with variable task grouping

Abstract The Test Laboratory Scheduling Problem (TLSP) is a real-world scheduling problem that extends the well-known Resource-Constrained Project (RCPSP) by several new constraints. Most importantly, jobs have to be assembled out of smaller tasks solver, before they can scheduled. In this paper, we introduce different metaheuristic solution approaches for problem. We propose four neighborhoods modify grouping tasks. combination with scheduling, are used our metaheuristics produce high-quality solutions both randomly generated and instances. particular, Simulated Annealing managed find competitive best known results improve upon state-of-the-art larger algorithm currently daily planning large laboratory.