Heuristics for the Response Time Variability problem
Tipus de documentReport de recerca
Condicions d'accésAccés obert
The recently introduced Response Time Variability Problem (RTVP) is a scheduling problem that has a broad range of real-life applications, for example, to sequence the models to be produced on a mixed-model assembly line. Previous studies include heuristic algorithms and mathematical programming models, whose practical limit for obtaining optimal solutions is around 40 units to be scheduled. In this paper, we propose and test new algorithms that combine heuristic procedures for obtaining initial sequences and several local optimization procedures.