Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/10910
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Verma, Vikas | - |
dc.date.accessioned | 2014-11-25T07:27:11Z | - |
dc.date.available | 2014-11-25T07:27:11Z | - |
dc.date.issued | 2001 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/10910 | - |
dc.guide | kHARE, M. K. | - |
dc.description.abstract | A simulation of a CNC lathe and optimise whose cutting parameters under the certain criteria in this dissertation work. And a software is developed for optimisation of the cutting parameters like as cutting speed or machining speed and fede rate. This software is developed in C++. Here in this work two criteria are being considered the firestone is minimum production cost criteria. Under these criteria consideration a mathematical model developed. And this mathematical model developed for the optimisation of the cutting parameters like, feed and cutting speed. Based on the both criteria the optimal values of cutting speed and feed rate are calculated. By that, an optimal range will define, this range is called high efficiency range, a range in which the cutting speed should keep for more production. That range also define the how much weightage should give to each criteria as well as minimisation of production cost as well as minimisation of machining | en_US |
dc.language.iso | en | en_US |
dc.subject | MECHANICAL INDUSTRIAL ENGINEERING | en_US |
dc.subject | CNC LATHE | en_US |
dc.subject | ON LINE MULTIOBJECTIVE OPTIMISATION | en_US |
dc.subject | CUTTING SPEED | en_US |
dc.title | SIMULATION OF A CNC LATHE FOR ON LINE MULTIOBJECTIVE OPTIMISATION | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | g10558 | en_US |
Appears in Collections: | MASTERS' THESES (MIED) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MIEDG10558.pdf | 1.55 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.