Computational complexity and solution algorithms for a vector sequencing problem
详细信息 查看全文
- 作者：Radosław Rudek rudek.radoslaw@gmail.com" class="auth_mail" title="E-mail the corresponding author
- 关键词：Scheduling ; Combinatorial optimization ; Computational complexity ; Metaheuristic ; Parallel algorithm
- 刊名：Computers & Industrial Engineering
- 出版年：2016
- 出版时间：August 2016
- 年：2016
- 卷：98
- 期：Complete
- 页码：384-400
- 全文大小：1194 K
文摘
- •
The considered vector sequencing problem is strongly NP-hard.
- •
A fast neighborhood search is constructed.
- •
Branch and bound and parallel metaheuristic algorithms are proposed.
- •
Numerical analysis of the algorithms is provided.