{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214726","sets":["6504:10735:10805"]},"path":["10805"],"owner":"44499","recid":"214726","title":["処理時間の不確かさを考慮した総滞留時間最小化単一機械バッチスケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"ac002afb-8137-4e2d-9b7e-d7878a088b47"},"_deposit":{"id":"214726","pid":{"type":"depid","value":"214726","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"処理時間の不確かさを考慮した総滞留時間最小化単一機械バッチスケジューリング","author_link":["552029","552028","552030"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"処理時間の不確かさを考慮した総滞留時間最小化単一機械バッチスケジューリング"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2021-03-04","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/214726/files/IPSJ-Z83-7J-02.pdf","label":"IPSJ-Z83-7J-02.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-7J-02.pdf","filesize":[{"value":"371.7 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"710d8452-c87f-41b1-9f45-6be559931e1c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":"総滞留時間最小化単一機械バッチスケジューリング問題は多項式時間で厳密に解けることが知られている．本研究では，不良品の発生や作業員の欠員などによる不確かな処理時間を考慮し，通常通り実行できた場合の基準処理時間，不良品の発生などによる追加処理時間の上限，追加処理発生頻度が与えられたバッチスケジューリングのロバスト最適化問題を考える．この問題における最悪シナリオ(与えられた解の目的関数値を最大にするシナリオ)の性質を明らかにし，その下で，基準処理時間と追加処理時間が比例関係である状況を含む特殊ケースにおいて，条件付き最短路問題に帰着させることで，最適解を求める多項式時間アルゴリズムを示す．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"238","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"237","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214726,"updated":"2025-01-19T16:29:48.783961+00:00","links":{},"created":"2025-01-19T01:15:31.637621+00:00"}