YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Assembly System Reconfiguration Planning

    Source: Journal of Manufacturing Science and Engineering:;2013:;volume( 135 ):;issue: 004::page 41005
    Author:
    Bryan, April
    ,
    Hu, S. Jack
    ,
    Koren, Yoram
    DOI: 10.1115/1.4024288
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: Decreasing product life cycles and reduced product development times have led to a need for new strategies for coping with the rapid rate of product family design changes. In this paper, assembly system reconfiguration planning (ASRP) is introduced as a method for cost effectively designing several generations of assembly systems in order to produce a product family that gradually evolves over time. In the ASRP approach, the possible assembly systems for each generation are first considered and then the sequence of assembly system configurations that minimize the life cycle cost of the process are selected. A nonlinear integer optimization formulation is developed for finding the cost minimizing assembly system reconfiguration plan using the ASRP approach. Dynamic programming and genetic algorithm are used to solve the optimization problem. Simulation results indicate that the ASRP approach leads to the minimum life cycle costs of the assembly system, and the relative cost of reconfiguration and production have an impact on the assembly system reconfiguration plan selected. Comparison of the results of the dynamic program and genetic algorithm indicate that the dynamic program is more computationally efficient for small problems and genetic algorithm is preferred for larger problems.
    • Download: (1.142Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Assembly System Reconfiguration Planning

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/152363
    Collections
    • Journal of Manufacturing Science and Engineering

    Show full item record

    contributor authorBryan, April
    contributor authorHu, S. Jack
    contributor authorKoren, Yoram
    date accessioned2017-05-09T01:00:28Z
    date available2017-05-09T01:00:28Z
    date issued2013
    identifier issn1087-1357
    identifier othermanu_135_04_041005.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/152363
    description abstractDecreasing product life cycles and reduced product development times have led to a need for new strategies for coping with the rapid rate of product family design changes. In this paper, assembly system reconfiguration planning (ASRP) is introduced as a method for cost effectively designing several generations of assembly systems in order to produce a product family that gradually evolves over time. In the ASRP approach, the possible assembly systems for each generation are first considered and then the sequence of assembly system configurations that minimize the life cycle cost of the process are selected. A nonlinear integer optimization formulation is developed for finding the cost minimizing assembly system reconfiguration plan using the ASRP approach. Dynamic programming and genetic algorithm are used to solve the optimization problem. Simulation results indicate that the ASRP approach leads to the minimum life cycle costs of the assembly system, and the relative cost of reconfiguration and production have an impact on the assembly system reconfiguration plan selected. Comparison of the results of the dynamic program and genetic algorithm indicate that the dynamic program is more computationally efficient for small problems and genetic algorithm is preferred for larger problems.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleAssembly System Reconfiguration Planning
    typeJournal Paper
    journal volume135
    journal issue4
    journal titleJournal of Manufacturing Science and Engineering
    identifier doi10.1115/1.4024288
    journal fristpage41005
    journal lastpage41005
    identifier eissn1528-8935
    treeJournal of Manufacturing Science and Engineering:;2013:;volume( 135 ):;issue: 004
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian