.png){kind=icon}
返回
A generalized variable neighborhood search algorithm for the talent scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2018.10.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An important part of the movie production process is to determine a shooting sequence of scenes to minimize the total cost of the actors, called the talent scheduling problem. We first modify a previously developed formulation of the problem as an integer linear programming model and develop a metaheuristic based on the generalized variable neighborhood search algorithm to solve it. The computational experiments based upon available test instances in the literature suggest that our algorithm outperforms previously developed algorithms especially for large-scale instances.
Keyword:
Talent scheduling
Metaheuristic
Generalized variable neighborhood search algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Applications of modern heuristic search methods to pattern sequencing problems现代启发式搜索方法在模式排序问题中的应用
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容