{"created":"2023-06-19T08:09:03.832600+00:00","id":134,"links":{},"metadata":{"_buckets":{"deposit":"7640cb6f-c5a7-4417-bf2e-be62d22e17b6"},"_deposit":{"created_by":15,"id":"134","owners":[15],"pid":{"revision_id":0,"type":"depid","value":"134"},"status":"published"},"_oai":{"id":"oai:edo.repo.nii.ac.jp:00000134","sets":["1:25"]},"author_link":["11"],"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Recently. we proposed a lot-sizing model with outsourcing and also developed algorithms to solve it ([8]-[10]).Since lot-sizing problems are mixed integer programming, reformulate them in compact linear programming is always a challenge.\nIn this manuscript, we review reformulation theory developed for lot-sizing models, especially these related to outsourcing models. Although relaxed reformulation of outsourcing model is same as the one with backlogging which has been solved and published, these two models differ. We show their differences in structure of extreme optimal solutions. Finally we give a linear reformulation for discrete lot-sizing model with outsourcing for a regeneration interval.","subitem_description_type":"Abstract"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifier":"","affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationName":"","affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"Zhan, Ping","creatorNameLang":"en"}],"familyNames":[{"familyName":"Zhan","familyNameLang":"en"}],"givenNames":[{"givenName":"Ping","givenNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"11","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2014-08-27"}],"displaytype":"simple","filename":"29-Zhan先生-2WEB.pdf","filesize":[{"value":"2.2 MB"}],"format":"application/pdf","license_note":"Recently. we proposed a lot-sizing model with outsourcing and also developed algorithms to solve it ([8]-[10]).Since lot-sizing problems are mixed integer programming, reformulate them in compact linear programming is always a challenge.\nIn this manuscript, we review reformulation theory developed for lot-sizing models, especially these related to outsourcing models. Although relaxed reformulation of outsourcing model is same as the one with backlogging which has been solved and published, these two models differ. We show their differences in structure of extreme optimal solutions. Finally we give a linear reformulation for discrete lot-sizing model with outsourcing for a regeneration interval.","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Reformulation of Lot-Sizing Problems with Backlogging and Outsourcing","url":"https://edo.repo.nii.ac.jp/record/134/files/29-Zhan先生-2WEB.pdf"},"version_id":"5744ed69-7c2b-4b28-873e-df214158396e"}]},"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":"Reformulation of Lot-Sizing Problems with Backlogging and Outsourcing","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Reformulation of Lot-Sizing Problems with Backlogging and Outsourcing"},{"subitem_title":"Reformulation of Lot-Sizing Problems with Backlogging and Outsourcing","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"15","path":["25"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-08-27"},"publish_date":"2014-08-27","publish_status":"0","recid":"134","relation_version_is_last":true,"title":["Reformulation of Lot-Sizing Problems with Backlogging and Outsourcing"],"weko_creator_id":"15","weko_shared_id":-1},"updated":"2024-05-16T02:42:37.767941+00:00"}