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 |
_version_ | 1797322216726069248 |
---|---|
author | Cristina Elena DODU Mircea ANCĂU |
author_facet | Cristina Elena DODU Mircea ANCĂU |
author_sort | Cristina Elena DODU |
collection | DOAJ |
description |
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.
|
first_indexed | 2024-03-08T05:11:00Z |
format | Article |
id | doaj.art-402f57e963734e4eb5d60e81ca813b30 |
institution | Directory Open Access Journal |
issn | 2065-9601 |
language | English |
last_indexed | 2024-03-08T05:11:00Z |
publishDate | 2020-06-01 |
publisher | Babes-Bolyai University, Cluj-Napoca |
record_format | Article |
series | Studia Universitatis Babes-Bolyai: Series Informatica |
spelling | doaj.art-402f57e963734e4eb5d60e81ca813b302024-02-07T10:03:37ZengBabes-Bolyai University, Cluj-NapocaStudia Universitatis Babes-Bolyai: Series Informatica2065-96012020-06-0165110.24193/subbi.2020.1.08A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULINGCristina Elena DODU0Mircea ANCĂU1Technical University of Cluj-Napoca, Romania. Email address: cristina.dodu@tcm.utcluj.roTechnical University of Cluj-Napoca, Romania. Email address: mircea.ancau@tcm.utcluj.ro 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. http://193.231.18.162/index.php/subbinformatica/article/view/3857Metaheuristics, PFSP, Permutation Flow Shop Problem, Scheduling Flow shop with concentric exporation, Local search, Tabu Search. |
spellingShingle | Cristina Elena DODU Mircea ANCĂU A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING Studia Universitatis Babes-Bolyai: Series Informatica Metaheuristics, PFSP, Permutation Flow Shop Problem, Scheduling Flow shop with concentric exporation, Local search, Tabu Search. |
title | A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING |
title_full | A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING |
title_fullStr | A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING |
title_full_unstemmed | A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING |
title_short | A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING |
title_sort | tabu search approach for permutation flow shop scheduling |
topic | Metaheuristics, PFSP, Permutation Flow Shop Problem, Scheduling Flow shop with concentric exporation, Local search, Tabu Search. |
url | http://193.231.18.162/index.php/subbinformatica/article/view/3857 |
work_keys_str_mv | AT cristinaelenadodu atabusearchapproachforpermutationflowshopscheduling AT mirceaancau atabusearchapproachforpermutationflowshopscheduling AT cristinaelenadodu tabusearchapproachforpermutationflowshopscheduling AT mirceaancau tabusearchapproachforpermutationflowshopscheduling |