Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/11239
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Pankaj Kumar-
dc.date.accessioned2014-11-26T07:12:28Z-
dc.date.available2014-11-26T07:12:28Z-
dc.date.issued2005-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/11239-
dc.guideJain, P. K.-
dc.description.abstractIn the present work the facility layout problem is being solved for a job shop type layout. In a job shop, the interdepartmental material flow is usually large enough and hence the relative placement of the departments is a very important problem, which if solve properly might result in huge savings in material handling costs and enable greater ease in carrying out the manufacturing operations. The objective may be stated as the formulation of an algorithmic approach, which will allow facility layout problems to be solved for multipleā€¢ factors, handle qualitative and quantitative factors simultaneously, and a meta-heuristic, which will generate a good facility layout quickly. A new optimization technique known as ant colony . optimization technique is gaining momentum, it is a multi-agent approach, and is found effective in solving combinatorial optimization problem. A sample problem is taken to illustrate and compare the results obtained by this technique, with the results obtained by other heuristics.en_US
dc.language.isoenen_US
dc.subjectMECHANICAL INDUSTRIAL ENGINEERINGen_US
dc.subjectSOLVING JOB-SHOP LAYOUT PROBLEMen_US
dc.subjectANT COLONY OPTIMIZATIONen_US
dc.subjectMATERIAL HANDLING COSTSen_US
dc.titleSOLVING JOB-SHOP LAYOUT PROBLEM BY ANT COLONY OPTIMIZATIONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG12445en_US
Appears in Collections:MASTERS' THESES (MIED)

Files in This Item:
File Description SizeFormat 
MIEDG12445.pdf5.85 MBAdobe PDFView/Open


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