Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines
Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 258 |
---|---|
container_issue | |
container_start_page | 251 |
container_title | |
container_volume | |
creator | Xiaowei Zhu Hu, S.J. Yoram Koren Marin, S.P. Ningjian Huang |
description | Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity. |
doi_str_mv | 10.1109/ISAM.2007.4288481 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4288481</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4288481</ieee_id><sourcerecordid>4288481</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e52b1aef05d060a51a145fb90089df8e32b165a18246103c1acd99b2e44f8fe73</originalsourceid><addsrcrecordid>eNo1j1FLhEAUhSciqDZ_QPQyf0C7d5zRmUeRtl1QCrael1GvMaHjthqs_fqEtqfDOR_nwGHsHiFCBPO43WVlJADSSAqtpcYLFphUoxRSgkri-JLd_hthrlkwjp8AgGkil9YNW-_o65t8Tfy1s947_8GngZfOu979EM-H_tDRyU0zd36JT9SE5dBQx7NxpL7qZl44T-Mdu2ptN1Jw1hV7Xz-95ZuweHne5lkROkzVFJISFVpqQTWQgFVoUaq2MgDaNK2meMGJsqiFTBDiGm3dGFMJkrLVLaXxij387Toi2h-OrrfHeX--Hv8CkcBMHw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xiaowei Zhu ; Hu, S.J. ; Yoram Koren ; Marin, S.P. ; Ningjian Huang</creator><creatorcontrib>Xiaowei Zhu ; Hu, S.J. ; Yoram Koren ; Marin, S.P. ; Ningjian Huang</creatorcontrib><description>Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.</description><identifier>ISBN: 1424405629</identifier><identifier>ISBN: 9781424405626</identifier><identifier>EISBN: 9781424405633</identifier><identifier>EISBN: 1424405637</identifier><identifier>DOI: 10.1109/ISAM.2007.4288481</identifier><language>eng</language><publisher>IEEE</publisher><subject>Anthropometry ; Application specific processors ; Assembly systems ; Costs ; Dynamic programming ; Fixtures ; Humans ; Investments ; Lifting equipment ; Manufacturing systems</subject><ispartof>2007 IEEE International Symposium on Assembly and Manufacturing, 2007, p.251-258</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4288481$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4288481$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xiaowei Zhu</creatorcontrib><creatorcontrib>Hu, S.J.</creatorcontrib><creatorcontrib>Yoram Koren</creatorcontrib><creatorcontrib>Marin, S.P.</creatorcontrib><creatorcontrib>Ningjian Huang</creatorcontrib><title>Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines</title><title>2007 IEEE International Symposium on Assembly and Manufacturing</title><addtitle>ISAM</addtitle><description>Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.</description><subject>Anthropometry</subject><subject>Application specific processors</subject><subject>Assembly systems</subject><subject>Costs</subject><subject>Dynamic programming</subject><subject>Fixtures</subject><subject>Humans</subject><subject>Investments</subject><subject>Lifting equipment</subject><subject>Manufacturing systems</subject><isbn>1424405629</isbn><isbn>9781424405626</isbn><isbn>9781424405633</isbn><isbn>1424405637</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j1FLhEAUhSciqDZ_QPQyf0C7d5zRmUeRtl1QCrael1GvMaHjthqs_fqEtqfDOR_nwGHsHiFCBPO43WVlJADSSAqtpcYLFphUoxRSgkri-JLd_hthrlkwjp8AgGkil9YNW-_o65t8Tfy1s947_8GngZfOu979EM-H_tDRyU0zd36JT9SE5dBQx7NxpL7qZl44T-Mdu2ptN1Jw1hV7Xz-95ZuweHne5lkROkzVFJISFVpqQTWQgFVoUaq2MgDaNK2meMGJsqiFTBDiGm3dGFMJkrLVLaXxij387Toi2h-OrrfHeX--Hv8CkcBMHw</recordid><startdate>200707</startdate><enddate>200707</enddate><creator>Xiaowei Zhu</creator><creator>Hu, S.J.</creator><creator>Yoram Koren</creator><creator>Marin, S.P.</creator><creator>Ningjian Huang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200707</creationdate><title>Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines</title><author>Xiaowei Zhu ; Hu, S.J. ; Yoram Koren ; Marin, S.P. ; Ningjian Huang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e52b1aef05d060a51a145fb90089df8e32b165a18246103c1acd99b2e44f8fe73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Anthropometry</topic><topic>Application specific processors</topic><topic>Assembly systems</topic><topic>Costs</topic><topic>Dynamic programming</topic><topic>Fixtures</topic><topic>Humans</topic><topic>Investments</topic><topic>Lifting equipment</topic><topic>Manufacturing systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Xiaowei Zhu</creatorcontrib><creatorcontrib>Hu, S.J.</creatorcontrib><creatorcontrib>Yoram Koren</creatorcontrib><creatorcontrib>Marin, S.P.</creatorcontrib><creatorcontrib>Ningjian Huang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xiaowei Zhu</au><au>Hu, S.J.</au><au>Yoram Koren</au><au>Marin, S.P.</au><au>Ningjian Huang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines</atitle><btitle>2007 IEEE International Symposium on Assembly and Manufacturing</btitle><stitle>ISAM</stitle><date>2007-07</date><risdate>2007</risdate><spage>251</spage><epage>258</epage><pages>251-258</pages><isbn>1424405629</isbn><isbn>9781424405626</isbn><eisbn>9781424405633</eisbn><eisbn>1424405637</eisbn><abstract>Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.</abstract><pub>IEEE</pub><doi>10.1109/ISAM.2007.4288481</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1424405629 |
ispartof | 2007 IEEE International Symposium on Assembly and Manufacturing, 2007, p.251-258 |
issn | |
language | eng |
recordid | cdi_ieee_primary_4288481 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Anthropometry Application specific processors Assembly systems Costs Dynamic programming Fixtures Humans Investments Lifting equipment Manufacturing systems |
title | Sequence Planning to Minimize Complexity in Mixed-Model Assembly Lines |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T01%3A37%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Sequence%20Planning%20to%20Minimize%20Complexity%20in%20Mixed-Model%20Assembly%20Lines&rft.btitle=2007%20IEEE%20International%20Symposium%20on%20Assembly%20and%20Manufacturing&rft.au=Xiaowei%20Zhu&rft.date=2007-07&rft.spage=251&rft.epage=258&rft.pages=251-258&rft.isbn=1424405629&rft.isbn_list=9781424405626&rft_id=info:doi/10.1109/ISAM.2007.4288481&rft_dat=%3Cieee_6IE%3E4288481%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424405633&rft.eisbn_list=1424405637&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4288481&rfr_iscdi=true |