.png){kind=icon}
Return
Computational complexity and solution algorithms for a vector sequencing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.06.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many cases, if something is done once, it can be reused faster or by a lower cost. Such dependencies occur in data processing, software development, project planning, machine purchasing or construction plans and many others. In this paper, we express related problems as a vector sequencing problem and prove it to be strongly NP-hard. To solve it, we provide an exact branch and bound method. Furthermore, efficient heuristic and parallel metaheuristic algorithms are constructed that are based on a fast neighborhood search. Their efficiency is verified during an extensive computational experiments. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Combinatorial optimization
Computational complexity
Metaheuristic
Parallel algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
View more