Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/11441
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Agarwal, Rakesh | - |
dc.date.accessioned | 2014-11-26T11:22:15Z | - |
dc.date.available | 2014-11-26T11:22:15Z | - |
dc.date.issued | 2008 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/11441 | - |
dc.guide | Jain, Pramoad Kumar | - |
dc.description.abstract | A major obstacle for assembly process automation and its integration with other processes such as design and scheduling is the assembly sequence planning (ASP) problem. It can be simply stated as how to find the best or optimal sequence to assemble a product, given its design characteristics and CAD data. The automation of this problem proved to be very complicated, and is still performed manually in most assembly firms, thus consuming more human power and time. Assembly planning consists of two major activities: assembly modeling and assembly sequence planning. Assembly modeling starts with the CAD design model of a product, and generates the geometrical data (like weight, dimension etc.). Assembly sequence planning on the other hand is the procedure of generating an optimal or a best sequence to assemble the product, given its modeling information. One investigation found that on average, current products have around 50% more parts and assembly content and undergo more complex assembly procedures than is necessary. The objective of this dissertation work is to determine an optimized assembly sequence for an assembly. In order to find optimized assembly sequence plan, Contact and precedence relations or matrices first determined, Contact relations can be determined from Directional Accessibility Indices (DAI). Then possible assembly sequences are determined using hierarchical tree structure and geometrically non feasible sequences are eliminated using precedence relations. After that we calculate the cost of each feasible sequence by optimizing criteria, so that we get the least assembling cost of an assembly In these work, User Interface software is developed which should have the capability to analyze the various sequences on basis of various attributes and determine its relative cost. The User Interface developed gives the full flexibility to user to perform assembly analysis of any desired assembly | en_US |
dc.language.iso | en | en_US |
dc.subject | MECHANICAL INDUSTRIAL ENGINEERING | en_US |
dc.subject | MECHANICAL ASSEMBLIES | en_US |
dc.subject | COMPONENT SPECIFIC ATTRIBUTES | en_US |
dc.subject | ASSEMBLY SEQUENCE PLANNING | en_US |
dc.title | ANALYSIS OF MECHANICAL ASSEMBLIES BASED ON COMPONENT SPECIFIC ATTRIBUTES | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | G13842 | en_US |
Appears in Collections: | MASTERS' THESES (MIED) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MIEDG13842.pdf | 3.96 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.