Open AccessResearch on the Scheduling Problem of Movie Scenes
Author(s) -
Yulian Liu,
Qiuji Sun,
Xiaotian Zhang,
Yiwei Wu
Publication year - 2019
Publication title -
discrete dynamics in nature and society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 39
eISSN - 1607-887X
pISSN - 1026-0226
DOI - 10.1155/2019/3737105
Subject(s) - tabu search , computer science , scheduling (production processes) , mathematical optimization , integer programming , job shop scheduling , particle swarm optimization , computer vision , artificial intelligence , algorithm , mathematics , schedule , operating system
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.