{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00213775","sets":["1164:2592:10486:10744"]},"path":["10744"],"owner":"44499","recid":"213775","title":["時間カラーペトリネットに基づく複数資源利用生産システムスケジューリングのための整数計画問題の定式化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-11-11"},"_buckets":{"deposit":"7ccc0239-38c3-4810-ade0-e63d6f7ac542"},"_deposit":{"id":"213775","pid":{"type":"depid","value":"213775","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"時間カラーペトリネットに基づく複数資源利用生産システムスケジューリングのための整数計画問題の定式化","author_link":["547365","547366","547367","547368"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"時間カラーペトリネットに基づく複数資源利用生産システムスケジューリングのための整数計画問題の定式化"},{"subitem_title":"MILP Formulation for Optimal Resource Assignment Problems with Multiple Resource Requirements based on Timed Colored Petri Nets","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-11-11","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"琉球大学大学院理工学研究科"},{"subitem_text_value":"琉球大学大学院理工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering and Science, Univ. of the Ryukyus","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering and Science, Univ. of the Ryukyus","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/213775/files/IPSJ-AL21185014.pdf","label":"IPSJ-AL21185014.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL21185014.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"4b188150-742c-437e-a8b6-ff67763cad12","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"内原, 朝也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"名嘉村, 盛和"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tomoya, Uchihara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Morikazu, Nakamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では最適資源割当問題に対する時間カラーペトリネットに基づく混合整数線形計画問題 (MILP) の生成手法を提案する．対象システムとして，共有資源を利用する複数の逐次プロセスから構成されるシステムにおいて，各プロセスが同時に複数の異なる種類の資源を要求することを許容するケースを扱う．本論文は著者等の先行研究で ある単一種類の資源要求に対する MILP 生成アルゴリズムを拡張するものである．提案手法は時間カラーペトリネットによって資源割当問題をモデル化することによって低コストで MILP を生成することができる．本稿での拡張により，より実用的な問題に適用することが可能となる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider a mixed-integer linear programming (MILP) generation based on colored timed Petri nets for optimal resource assignment problems. As target systems, we treat a system of sequential processes with shared resources, where processes simultaneously require multiple resources for their processing. This method presented in this paper is an extension of our previous work, an MILP generation algorithm for systems of multiple sequential processes with a single resource-type requirement. We show some experimental results to confirm the usefulness and the effectiveness of our approach.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-11-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2021-AL-185"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":213775,"updated":"2025-01-19T17:01:41.371576+00:00","links":{},"created":"2025-01-19T01:14:37.372860+00:00"}