Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/20279
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGhosh, Diptesh
dc.date.accessioned2018-02-07T08:20:07Z
dc.date.available2018-02-07T08:20:07Z
dc.date.issued2016-02-29
dc.identifier.urihttp://hdl.handle.net/11718/20279
dc.description.abstractThe indexing problem in automated machining environments aims to arrange tools in tool slots of a tool magazine for faster processing of jobs. This problem is called the indexing problem and has been widely studied in the literature. We present heuristics using Lin Kernighan neighborhood structures to solve the indexing problem. Two of the heuristics are local search heuristics and one is a tabu search heuristic. To the best of our knowledge this is one of the first implementations of tabu search on a Lin Kernighan neighborhood structure.en_US
dc.language.isoen_USen_US
dc.publisherIndian Institute of Management Ahmedabaden_US
dc.relation.ispartofseriesW.P.;2016-02-13
dc.subjectNC tool magazineen_US
dc.subjectIndexingen_US
dc.subjectLin Kernighan neighborhoodsen_US
dc.subjectLocal searchen_US
dc.subjectTabu searchen_US
dc.titleExploring lin kernighan neighborhoods for the indexing problemen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP_2016_02_13.pdfWP_2016_2_13358.28 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.