{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00083732","sets":["1164:2735:6701:6859"]},"path":["6859"],"owner":"11","recid":"83732","title":["電子基板生産のラインバランシング問題に対するヒューリスティックな解法-ノズル・部品の割当てに制約がある場合-"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-09-12"},"_buckets":{"deposit":"5df5bbcf-fe6b-4b58-8989-751987ee368a"},"_deposit":{"id":"83732","pid":{"type":"depid","value":"83732","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"電子基板生産のラインバランシング問題に対するヒューリスティックな解法-ノズル・部品の割当てに制約がある場合-","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"電子基板生産のラインバランシング問題に対するヒューリスティックな解法-ノズル・部品の割当てに制約がある場合-"},{"subitem_title":"A Heuristic Algorithm for the Line Balancing Problem in Printed Circuit Board Assembly - The Case with Constraints on Component-nozzle Assignment -","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2012-09-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学"},{"subitem_text_value":"東京農工大学"},{"subitem_text_value":"東京農工大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo university of agriculture and technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo university of agriculture and technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo university of agriculture and technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/83732/files/IPSJ-MPS12090010.pdf"},"date":[{"dateType":"Available","dateValue":"2014-09-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS12090010.pdf","filesize":[{"value":"337.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"54f76a6d-5462-42f6-aa0e-ecfb25c2935e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岡本, 大輔"},{"creatorName":"太田, 秀典"},{"creatorName":"中森, 眞理雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Daisuke, Okamoto","creatorNameLang":"en"},{"creatorName":"Hidenori, Ohta","creatorNameLang":"en"},{"creatorName":"Mario, Nakamori","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"電子基板の生産では，部品装着機と呼ばれる機械を複数台，直列に連結して生産ラインを形成し，電子部品の基板への装着を自動で行う．ライン全体の生産能率が高くなるような各部品装着機へ部品を割当てる手法として，装着経路を考慮して部品割当てを行う手法が，既に提案されている．しかし，この手法はノズルと部品の制約を全く考慮しておらず，部品の大きさに応じてノズルを使い分けるような生産ラインに対しては適用が困難である．本論文ではこの手法を拡張し，ノズルと部品の組合せに制約がある場合の各部品装着機への部品の割当てを求めるヒューリスティックな解法を提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Electronic circuit boards are produced automatically through a production line that consists of chip mounting machines arranged in series. Algorithms of assigning chips (components) to these machines have been proposed that makes the throughput of the line to be the maximum. These algorithms, however, do not take constraints between nozzles and chips into account and so are impossible to apply to the practical case where an adequate nozzle has to be chosen for each chip. In the present paper we extend the algorithm to the case that has constraints between nozzles and chips and propose a heuristic algorithm of assigning chips to machines.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2012-09-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2012-MPS-90"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":83732,"updated":"2025-01-21T18:15:20.789527+00:00","links":{},"created":"2025-01-18T23:37:08.826871+00:00"}