Abstract
The scheduling problem of movie scenes refers to the reasonable ordering of the shooting sequence of the scene, thereby minimizing the total cost of the movie scenes. This paper considers the factors affecting the cost of movie scenes shooting in the real world and constructs an integer linear programming model. A tabu search based method (TSBM) and a particle swarm optimization based method (PSOBM) are designed to solve larger-scale problems. Numerical experiments show that both TSBM and PSOBM are suitable for solving small-scale movie scenes scheduling problem. Moreover, through the comparison experiments between TSBM and PSOBM, it is verified that the TSBM can effectively solve the large-scale movie scenes scheduling problem.
Highlights
In the real world, the sequence of movie scenes shoot is not the final sequence
Different movie scenes may be taken at different locations, so there is a high potential for transfer costs between the scene and the scene transition during movie scenes shooting process
This paper mainly studies the optimization problem of movie scenes scheduling by considering transfer costs and certain shooting duration
Summary
The sequence of movie scenes shoot is not the final sequence. we do this research in order to find the optimal sequence. The movie scenes scheduling problem can be described as follows. Pm} mean the wage of m actors in one day. The movie scenes scheduling problem is how to reduce the transfer cost in consideration of actors with different wages so as to minimize the total cost. The movie scenes scheduling problem is a multifactor optimization problem. The location of the movie scenes is considered. This paper considers different wage of actors and different scenes shooting duration in order to construct an integer linear programming model.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
