Optimization in dubbing scheduling
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.
KeywordsDubbing Scheduling Simulated annealing Binary linear programming
Mathematics Subject Classification90Cxx 90C10 90C59
- Aarts EHL, Korst JHM, van Laarhoven PJM (1997) Simulated annealing. In: Aarts E, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, New York, pp 91–120Google Scholar
- Álmos A (1998) Scheduling algorithms for a video-dubbing studio. In: INTCOM’98, MiskolcGoogle Scholar
- Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transp Res Part B 37:541–560Google Scholar
- Willis RJ, Terrill BJ (1994) Scheduling the Australian state cricket season using simulated annealing. J Oper Res Soc 45:276–280Google Scholar