Brisaboa, N.R., Carpente, L., Cerdeira-Pena, A. et al. TOP (2015) 23: 685. doi:10.1007/s11750-015-0361-4
One of the main tasks in dubbing studios is to design good schedules to assign actors/actresses to dubbing sessions. This paper provides an effective tool based on the simulated annealing philosophy. The performance of the proposed heuristic is guaranteed by a binary linear programming model (BP model). By relaxing some integrality conditions in the BP model, we can achieve optimal schedules in real instances gathered from several dubbed films. Yet, in most cases, it is not possible to obtain these optimal schedules in a suitable computational time. On the contrary, the heuristic algorithm gets high quality solutions (and even the optimal ones) in just few seconds.
Dubbing Scheduling Simulated annealing Binary linear programming