WEKO3
アイテム
{"_buckets": {"deposit": "77debd11-e11b-4121-8501-c6b944f00af5"}, "_deposit": {"created_by": 15, "id": "666", "owners": [15], "pid": {"revision_id": 0, "type": "depid", "value": "666"}, "status": "published"}, "_oai": {"id": "oai:edo.repo.nii.ac.jp:00000666", "sets": ["50"]}, "author_link": ["1188", "1189"], "item_1_biblio_info_14": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016-03-15", "bibliographicIssueDateType": "Issued"}, "bibliographicVolumeNumber": "26", "bibliographic_titles": [{"bibliographic_title": "江戸川大学紀要"}, {"bibliographic_title": "Bulletin of Edogawa University", "bibliographic_titleLang": "en"}]}]}, "item_1_creator_6": {"attribute_name": "著者名(日)", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ザン ピン"}], "nameIdentifiers": [{"nameIdentifier": "1188", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_creator_8": {"attribute_name": "著者名(英)", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Ping Zhan", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "1189", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_description_1": {"attribute_name": "ページ属性", "attribute_value_mlt": [{"subitem_description": "P(論文)", "subitem_description_type": "Other"}]}, "item_1_description_12": {"attribute_name": "抄録(英)", "attribute_value_mlt": [{"subitem_description": "Lot-sizing problems have been extensively researched for more than half century.There are relative small number of papers on lot-sizing models with outsourcing, despite its important applications in operations research. Recently several papers related to out-sourcing models are published.When there is no bound on production capacity, linear algorithm( totally square) is possible. Period varying capacitated lot-sizing model is known as NP-hard even outsourcing is not allowed. In this manuscript, we treat these two extreme cases, we give a efficient algorithm for former case, and propose a pseudo-polynomial scheme for period varying production capacities.", "subitem_description_type": "Other"}]}, "item_1_source_id_13": {"attribute_name": "雑誌書誌ID", "attribute_value_mlt": [{"subitem_source_identifier": "AA12560733", "subitem_source_identifier_type": "NCID"}]}, "item_1_text_2": {"attribute_name": "記事種別(日)", "attribute_value_mlt": [{"subitem_text_value": "論文"}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-03-15"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "DK26-27z.pdf", "filesize": [{"value": "2.6 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 2600000.0, "url": {"url": "https://edo.repo.nii.ac.jp/record/666/files/DK26-27z.pdf"}, "version_id": "13189c4c-29d4-4996-a172-49b01f1d75a1"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Unbounded and period varying capacitated lot-sizing models", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Outsourcing", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Dynamic programming", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing", "subitem_title_language": "en"}]}, "item_type_id": "1", "owner": "15", "path": ["50"], "permalink_uri": "https://edo.repo.nii.ac.jp/records/666", "pubdate": {"attribute_name": "公開日", "attribute_value": "2016-03-15"}, "publish_date": "2016-03-15", "publish_status": "0", "recid": "666", "relation": {}, "relation_version_is_last": true, "title": ["Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing"], "weko_shared_id": -1}
Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing
https://edo.repo.nii.ac.jp/records/666
https://edo.repo.nii.ac.jp/records/6668608d009-1e4d-45b9-8cb9-4ab64cbe5d63
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 紀要論文(ELS) / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2016-03-15 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Unbounded and period varying capacitated lot-sizing models | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Outsourcing | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | Dynamic programming | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
ページ属性 | ||||||
内容記述タイプ | Other | |||||
内容記述 | P(論文) | |||||
記事種別(日) | ||||||
論文 | ||||||
著者名(日) |
ザン ピン
× ザン ピン |
|||||
著者名(英) |
Ping Zhan
× Ping Zhan |
|||||
抄録(英) | ||||||
内容記述タイプ | Other | |||||
内容記述 | Lot-sizing problems have been extensively researched for more than half century.There are relative small number of papers on lot-sizing models with outsourcing, despite its important applications in operations research. Recently several papers related to out-sourcing models are published.When there is no bound on production capacity, linear algorithm( totally square) is possible. Period varying capacitated lot-sizing model is known as NP-hard even outsourcing is not allowed. In this manuscript, we treat these two extreme cases, we give a efficient algorithm for former case, and propose a pseudo-polynomial scheme for period varying production capacities. | |||||
雑誌書誌ID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA12560733 | |||||
書誌情報 |
江戸川大学紀要 en : Bulletin of Edogawa University 巻 26, 発行日 2016-03-15 |