TOP

, Volume 23, Issue 3, pp 685–702

Optimization in dubbing scheduling

  • Nieves R. Brisaboa
  • Luisa Carpente
  • Ana Cerdeira-Pena
  • Silvia Lorenzo-Freire
Original Paper

DOI: 10.1007/s11750-015-0361-4

Cite this article as:
Brisaboa, N.R., Carpente, L., Cerdeira-Pena, A. et al. TOP (2015) 23: 685. doi:10.1007/s11750-015-0361-4
  • 150 Downloads

Abstract

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.

Keywords

Dubbing Scheduling Simulated annealing Binary linear programming 

Mathematics Subject Classification

90Cxx 90C10 90C59 

Copyright information

© Sociedad de Estadística e Investigación Operativa 2015

Authors and Affiliations

  • Nieves R. Brisaboa
    • 1
  • Luisa Carpente
    • 2
  • Ana Cerdeira-Pena
    • 1
  • Silvia Lorenzo-Freire
    • 2
  1. 1.Database Laboratory, Department of Computer Science, Faculty of Computer ScienceUniversity of A CoruñaA CoruñaSpain
  2. 2.MODES Research Group, Department of Mathematics, Faculty of Computer ScienceUniversity of A CoruñaA CoruñaSpain

Personalised recommendations