|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Mechanical Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/1306
|
Full metadata record
| DC Field | Value | Language |
| contributor.author | Solimanpur, M | - |
| contributor.author | Vrat, P | - |
| contributor.author | Shankar, R | - |
| date.accessioned | 2006-02-18T09:35:31Z | - |
| date.available | 2006-02-18T09:35:31Z | - |
| date.issued | 2004 | - |
| identifier.citation | Computers & Operations Research, 31(13), 2151-2164 | en |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/1306 | - |
| description.abstract | Flow 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 |
| format.extent | 533383 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| subject | Scheduling | en |
| subject | Flow shop scheduling | en |
| subject | Tabu search | en |
| subject | Exponential tabu search | en |
| subject | Neural networks | en |
| title | A neuro-tabu search heuristic for the flow shop scheduling problem | en |
| type | Article | en |
| Appears in Collections: | Mechanical Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
| salimanpurneu2004.pdf | | 520Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|