Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 16 | Page No.: 2843-2850
DOI: 10.3923/jas.2008.2843.2850
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time

B Naderi, M Khalili, M.T Taghavifard and V Roshanaei

Abstract:
In this study we investigate a complex variant of scheduling environments known as hybrid flexible flowshops to minimize total completion time where setup times are sequence dependent. Since this problem belongs to NP-hard class, we propose an effective Variable Neighborhood Search (VNS) metaheuristic algorithm to tackle the problem considered. Present proposed VNS embodies three advanced insertion Neighborhood Search Structures (NSS) together with the framework of Variable Neighborhood Descent (VND) that is a special version of VNS. For the evaluation of our proposed VNS, the standard benchmark of Taillard is used to compare the VNS against some other high-performing algorithms in the literature which have already proven their effectiveness. Computational results clearly reveal that our proposed VNS is competitive when compared to many other well known algorithms.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

B Naderi, M Khalili, M.T Taghavifard and V Roshanaei, 2008. A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time. Journal of Applied Sciences, 8: 2843-2850.

DOI: 10.3923/jas.2008.2843.2850

URL: https://scialert.net/abstract/?doi=jas.2008.2843.2850

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom