DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Mechanical Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1306

Full metadata record

DC FieldValueLanguage
dc.contributor.authorSolimanpur, M-
dc.contributor.authorVrat, P-
dc.contributor.authorShankar, R-
dc.date.accessioned2006-02-18T09:35:31Z-
dc.date.available2006-02-18T09:35:31Z-
dc.date.issued2004-
dc.identifier.citationComputers & Operations Research, 31(13), 2151-2164en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/1306-
dc.description.abstractFlow shop scheduling deals with the sequencing of different jobs that visit a set of machines in the same order. A neural networks-based tabu search method, namely EXTS, is proposed for the flow shop scheduling. Unlike the other tabu search-based methods, the proposed approach helps diminishing the tabu effect in an exponential way rather than most commonly used way of diminishing it in a sudden manner. On the basis of the conducted tests, some rules are evolved to set the values for different parameters. The effectiveness of the proposed method is tested with 23 problems selected from literature. The computational results indicate that the proposed approach is effective in terms of reduced makespan for the attempted problems.en
dc.format.extent533383 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectSchedulingen
dc.subjectFlow shop schedulingen
dc.subjectTabu searchen
dc.subjectExponential tabu searchen
dc.subjectNeural networksen
dc.titleA neuro-tabu search heuristic for the flow shop scheduling problemen
dc.typeArticleen
Appears in Collections:Mechanical Engineering

Files in This Item:

File Description SizeFormat
salimanpurneu2004.pdf520.88 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback