Please use this identifier to cite or link to this item:
http://nopr.niscpr.res.in/handle/123456789/1803Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Eswaramurthy, V P | - |
| dc.date.accessioned | 2008-08-05T10:31:41Z | - |
| dc.date.available | 2008-08-05T10:31:41Z | - |
| dc.date.issued | 2008-08 | - |
| dc.identifier.issn | 0022-4456 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/1803 | - |
| dc.description | 579-588 | en_US |
| dc.description.abstract | This paper presents tabu search to solve job shop scheduling problems. Various neighborhood strategies are introduced and an algorithm is developed to analyze performance of these strategies with new dynamic tabu length strategy. Performance of algorithm is tested using well-known benchmark problems and also compared with other algorithms. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | CSIR | en_US |
| dc.source | JSIR Vol.67(8) [August 2008] | en_US |
| dc.subject | Job shop scheduling | en_US |
| dc.subject | Makespan | en_US |
| dc.subject | Neighborhood structures | en_US |
| dc.subject | Pheromone trail | en_US |
| dc.subject | Tabu length | en_US |
| dc.subject | Tabu list | en_US |
| dc.title | New algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | JSIR Vol.67(08) [August 2008] | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| JSIR 67(8) 579-588.pdf | 111.98 kB | Adobe PDF | View/Open |
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.