{"created":"2023-06-19T08:09:01.249595+00:00","id":65,"links":{},"metadata":{"_buckets":{"deposit":"ee3ffb3c-3805-47d7-b1ea-ed6b75138c19"},"_deposit":{"created_by":15,"id":"65","owners":[15],"pid":{"revision_id":0,"type":"depid","value":"65"},"status":"published"},"_oai":{"id":"oai:edo.repo.nii.ac.jp:00000065","sets":["1:6"]},"author_link":["72","11"],"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Lot-sizing problem has been extensively researched in many aspects. In this review, we summarize key points of dynamic programming algorithms in lot-sizing problems and give some hints helping further designing algorithms for more variations of lot-sizing problems ([4]).","subitem_description_type":"Abstract"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"ザン, ピン"},{"creatorName":"ザン, ピン","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Zhan, Ping","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2013-12-13"}],"displaytype":"simple","filename":"27.zhan_22.pdf","filesize":[{"value":"920.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Dynamic Programming Algorithms for Lot-Sizing Problems","url":"https://edo.repo.nii.ac.jp/record/65/files/27.zhan_22.pdf"},"version_id":"7290d580-859a-4907-b49c-83c84b3d5605"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Lot-sizing","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Dynamic programming","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Minimum cost flows","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Dynamic Programming Algorithms for Lot-Sizing Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Dynamic Programming Algorithms for Lot-Sizing Problems"}]},"item_type_id":"10002","owner":"15","path":["6"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-12-13"},"publish_date":"2013-12-13","publish_status":"0","recid":"65","relation_version_is_last":true,"title":["Dynamic Programming Algorithms for Lot-Sizing Problems"],"weko_creator_id":"15","weko_shared_id":-1},"updated":"2023-06-19T08:31:43.237127+00:00"}