NISCAIR Online Periodicals Repository

NISCAIR ONLINE PERIODICALS REPOSITORY (NOPR)  >
NISCAIR PUBLICATIONS >
Research Journals >
Journal of Scientific and Industrial Research (JSIR) >
JSIR Vol.67 [2008] >
JSIR Vol.67(08) [August 2008] >


Title: New algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Authors: Eswaramurthy, V P
Keywords: Job shop scheduling
Makespan
Neighborhood structures
Pheromone trail
Tabu length
Tabu list
Issue Date: Aug-2008
Publisher: CSIR
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.
Page(s): 579-588
ISSN: 0022-4456
Source: JSIR Vol.67(08) [August 2008]

Files in This Item:

File Description SizeFormat
JSIR 67(8) 579-588.pdf111.98 kBAdobe PDFView/Open
 Current Page Visits: 582 
Recommend this item

 

National Knowledge Resources Consortium |  NISCAIR Website |  Contact us |  Feedback

Disclaimer: NISCAIR assumes no responsibility for the statements and opinions advanced by contributors. The editorial staff in its work of examining papers received for publication is helped, in an honorary capacity, by many distinguished engineers and scientists.

CC License Except where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India

Copyright © 2012 The Council of Scientific and Industrial Research, New Delhi. All rights reserved.

Powered by DSpace Copyright © 2002-2007 MIT and Hewlett-Packard | Compliant to OAI-PMH V 2.0

Home Page Total Visits: 602915 since 06-Feb-2009  Last updated on 21-Oct-2014Webmaster: nopr@niscair.res.in