A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING
The adaptive distance between the neighbourhood’s makespans influences the local search to explore the non-investigated areas of the solutions space. A Tabu Search with the intensive concentric exploration over non-explored areas is proposed as an alternative solution to the simplest Tabu Search wi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Babes-Bolyai University, Cluj-Napoca
2020-06-01
|
| Series: | Studia Universitatis Babes-Bolyai: Series Informatica |
| Subjects: | |
| Online Access: | http://193.231.18.162/index.php/subbinformatica/article/view/3857 |
| Summary: | The adaptive distance between the neighbourhood’s makespans influences the local search to explore the non-investigated areas of the solutions space. A Tabu Search with the intensive concentric exploration over non-explored areas is proposed as an alternative solution to the simplest Tabu Search with the random shifting of two jobs indexes operation for Permutation Flow Shop Problem (PFSP) with the makespan minimization criteria.
|
|---|---|
| ISSN: | 2065-9601 |