WEKO3
アイテム
{"_buckets": {"deposit": "ccf74c46-1503-43bc-9382-0c3af5ed68b0"}, "_deposit": {"id": "28855", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "28855"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00028855", "sets": ["322"]}, "author_link": ["94960", "94961", "94962", "94963"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2019-09-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "208", "bibliographicPageStart": "195", "bibliographicVolumeNumber": "149", "bibliographic_titles": [{"bibliographic_title": "Chemical Engineering Research and Design", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The CPM (Critical Path Method) is a network-based approach for project management. This method identifies the longest path, which allows us to find the critical path that must be shortened so that the completion time of the whole project can be shortened. However, considering uncertainty in CPM is not straightforward. In this paper, we consider an optimization problem for stochastic CPM problems, where task durations are expressed as discrete histograms obtained from historical operation data, that maximizes the probability that all tasks are completed within a given completion time by improving the task durations on the critical path. We propose two reformulations of the problem as a mixed-integer linear programming problem: one based on tasks, and the other based on paths. In addition, we propose an iterative method to solve the problem efficiently by reducing the number of binary variables. Finally, we demonstrate efficiency of our proposed methods in some case studies.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "ファイル公開:2021-09-01", "subitem_description_language": "ja", "subitem_description_type": "Other"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1016/j.cherd.2019.06.027", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_10_source_id_61": {"attribute_name": "ISSN(print)", "attribute_value_mlt": [{"subitem_source_identifier": "02638762", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Takakura, Yuya", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "94960", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yajima, Tomoyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "94961", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kawajiri, Yoshiaki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "94962", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Hashizume, Susumu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "94963", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-09-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Takura_etal_2019.pdf", "filesize": [{"value": "1.8 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 1800000.0, "url": {"label": "Takura_etal_2019", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/28855/files/Takura_etal_2019.pdf"}, "version_id": "2b0d779e-c3fd-4f70-ba6d-82a5a2e48053"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Critical path method", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Project scheduling", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Time-cost trade off problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Uncertain durations", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Mixed-integer linear programming", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Historical operation data", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Application of critical path method to stochastic processes with historical operation data", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Application of critical path method to stochastic processes with historical operation data", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/00031042", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2019-12-24"}, "publish_date": "2019-12-24", "publish_status": "0", "recid": "28855", "relation": {}, "relation_version_is_last": true, "title": ["Application of critical path method to stochastic processes with historical operation data"], "weko_shared_id": -1}
Application of critical path method to stochastic processes with historical operation data
http://hdl.handle.net/2237/00031042
http://hdl.handle.net/2237/0003104295b94fe3-7abd-40fc-b661-b70e9345eab0
名前 / ファイル | ライセンス | アクション |
---|---|---|
Takura_etal_2019 (1.8 MB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2019-12-24 | |||||
タイトル | ||||||
タイトル | Application of critical path method to stochastic processes with historical operation data | |||||
言語 | en | |||||
著者 |
Takakura, Yuya
× Takakura, Yuya× Yajima, Tomoyuki× Kawajiri, Yoshiaki× Hashizume, Susumu |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Critical path method | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Project scheduling | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Time-cost trade off problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Uncertain durations | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Mixed-integer linear programming | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Historical operation data | |||||
抄録 | ||||||
内容記述 | The CPM (Critical Path Method) is a network-based approach for project management. This method identifies the longest path, which allows us to find the critical path that must be shortened so that the completion time of the whole project can be shortened. However, considering uncertainty in CPM is not straightforward. In this paper, we consider an optimization problem for stochastic CPM problems, where task durations are expressed as discrete histograms obtained from historical operation data, that maximizes the probability that all tasks are completed within a given completion time by improving the task durations on the critical path. We propose two reformulations of the problem as a mixed-integer linear programming problem: one based on tasks, and the other based on paths. In addition, we propose an iterative method to solve the problem efficiently by reducing the number of binary variables. Finally, we demonstrate efficiency of our proposed methods in some case studies. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
内容記述 | ||||||
内容記述 | ファイル公開:2021-09-01 | |||||
言語 | ja | |||||
内容記述タイプ | Other | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | Elsevier | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1016/j.cherd.2019.06.027 | |||||
ISSN(print) | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 02638762 | |||||
書誌情報 |
en : Chemical Engineering Research and Design 巻 149, p. 195-208, 発行日 2019-09-01 |
|||||
著者版フラグ | ||||||
値 | author |