Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/2902
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSrinivas, V.-
dc.date.accessioned2014-09-29T11:45:58Z-
dc.date.available2014-09-29T11:45:58Z-
dc.date.issued1988-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/2902-
dc.guideGaindhar, J. L.-
dc.description.abstractIn this work the jobshcp,Cscheduling problems have been-, reviewed in view of the existing methods, both exact and approxifaate, fur solging the scheduling problems. Two new approximate- m.thods (heuristics) have been proposed for solving the general flowshop scheduling problem. A computational study is made on the proposed methods by generating random sets of data. The eff`ctiveness of the proposed heuristics is demonstrated by comparing the solutions obtained from heuristics with the optimal solutions. \ Suggestions for further extension of the proposed heuristics...........en_US
dc.language.isoenen_US
dc.subjectMECHANICAL & INDUSTRIAL ENGINEERINGen_US
dc.subjectJOB SHOP SCHEDULINGen_US
dc.subjectFLOW SHOP SCHEDULINGen_US
dc.subjectHEURISTIC APPROACHen_US
dc.titleJOB SHOP & FLOW SHOP SCHEDULING: DEVELOPMENT OF A HEURISTIC APPROACHen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number179718en_US
Appears in Collections:MASTERS' DISSERTATIONS (MIED)

Files in This Item:
File Description SizeFormat 
MIED179718.pdf3.24 MBAdobe PDFView/Open


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