.png){kind=icon}
.png){kind=icon}
Return
A fast tabu search algorithm for the permutation flow-shop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(95)00037-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation Row shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (up to 500 jobs and 20 machines) show its excellent numerical properties.
Keywords:
flow-shop scheduling
heuristics
tabu search
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
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available