{"id":235645,"updated":"2025-01-19T09:34:41.211398+00:00","links":{},"created":"2025-01-19T01:37:14.248413+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235645","sets":["6504:11678:11698"]},"path":["11698"],"owner":"44499","recid":"235645","title":["DF/IHS法の木構造を用いたタスクスケジューリング問題の下界値計算手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"cadd5200-5eb5-4381-beee-512d8ae27d78"},"_deposit":{"id":"235645","pid":{"type":"depid","value":"235645","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"DF/IHS法の木構造を用いたタスクスケジューリング問題の下界値計算手法","author_link":["643962","643964","643963"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"DF/IHS法の木構造を用いたタスクスケジューリング問題の下界値計算手法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンピュータシステム","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2024-03-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"千葉工大"},{"subitem_text_value":"千葉工大"},{"subitem_text_value":"千葉工大"}]},"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/235645/files/IPSJ-Z86-5J-06.pdf","label":"IPSJ-Z86-5J-06.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-5J-06.pdf","filesize":[{"value":"257.8 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"3c619daa-98d4-4322-9b3d-bcd6a65d903f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"薬師, 啓太"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"中村, あすか"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"前川, 仁孝"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本発表では, DF/IHS法を用いたタスクスケジューリング問題の最適解求解を高速化するため,下界値の計算を簡単化する手法を提案する.DF/IHS法は分枝限定法に基づいて最も短いスケジュール長となるタスクの組合せを求める.DF/IHS法の下界値計算はすべての未割当てタスクの実行に必要な時間を予測するため, 未割当てタスクが同じ部分問題に対して同じ計算を実行する場合があり, 計算に無駄が生じる.そこで, 未割当てタスクが同じ部分問題をDF/IHSの木構造に基づいて検出し, 下界値の計算を簡単化することで, 探索の高速化が期待できる.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"70","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"69","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}