The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2020  
         
  Article:   A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING .

Authors:  C.E. DODU, M. ANCĂU.
 
       
         
  Abstract:  
DOI: 10.24193/subbi.2020.1.08
Published Online: 2020-06-30
Published Print: 2020-06-30
pp. 104-115

FULL PDF

VIEW PDF

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.
Key words and phrases. Metaheuristics, PFSP, Permutation Flow Shop Problem, Scheduling Flow shop with concentric exporation, Local search, Tabu Search.
2010 Mathematics Subject Classi_cation. 68T20, 68P10.
 
         
     
         
         
      Back to previous page