{"created":"2022-02-01T06:41:15.358783+00:00","id":2011305,"links":{},"metadata":{"_buckets":{"deposit":"5d5c779e-b4a9-48e8-bb97-311dcc4345c3"},"_deposit":{"id":"2011305","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2011305"},"status":"published"},"_oai":{"id":"oai:u-ryukyu.repo.nii.ac.jp:02011305","sets":["1642838163960:1642838338003","1642838403551:1642838406845"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets","subitem_1551255648112":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Porco, Andrea Veronica","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Ushijima, Ryosuke","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Nakamura, Morikazu","creatorNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_1522299639480":"open access","subitem_1600958577026":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186499011":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_1522650717957":"ja","subitem_1522651041219":"©2018 IEICE"}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_1522299896455":"en","subitem_1522300014469":"Other","subitem_1523261968819":"scheduling problem"},{"subitem_1522299896455":"en","subitem_1522300014469":"Other","subitem_1523261968819":"mixed integer programming"},{"subitem_1522299896455":"en","subitem_1522300014469":"Other","subitem_1523261968819":"Petri nets"},{"subitem_1522299896455":"en","subitem_1522300014469":"Other","subitem_1523261968819":"colored timed Petri net"},{"subitem_1522299896455":"en","subitem_1522300014469":"Other","subitem_1523261968819":"automatic generation"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"This paper proposes a scheme for automatic generation of mixed-integer programming problems for scheduling with multiple resources based on colored timed Petri nets. Our method reads Petri net data modeled by users, extracts the precedence and conflict relations among transitions, information on the available resources, and finally generates a mixed integer linear programming for exactly solving the target scheduling problem. The mathematical programing problems generated by our tool can be easily inputted to well-known optimizers. The results of this research can extend the usability of optimizers since our tool requires just simple rules of Petri nets but not deep mathematical knowledge.","subitem_description_type":"Other"},{"subitem_description":"論文","subitem_description_type":"Other"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_1522300295150":"en","subitem_1522300316516":"The Institute of Electronics, Information and Communication Engineers"},{"subitem_1522300295150":"ja","subitem_1522300316516":"一般社団法人　電子情報通信学会"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_1551255818386":"eng"}]},"item_1617186783814":{"attribute_name":"Identifier","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/20.500.12000/47487"}]},"item_1617186920753":{"attribute_name":"Source Identifier","attribute_value_mlt":[{"subitem_1522646500366":"ISSN","subitem_1522646572813":"1745-1337"}]},"item_1617186941041":{"attribute_name":"Source Title","attribute_value_mlt":[{"subitem_1522650068558":"en","subitem_1522650091861":"IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-02-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"372","bibliographicPageStart":"367","bibliographicVolumeNumber":"E101-A"}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_1522305645492":"VoR","subitem_1600292170262":"http://purl.org/coar/version/c_970fb48d4fbd8a85"}]},"item_1617353299429":{"attribute_name":"Relation","attribute_value_mlt":[{"subitem_1522306287251":{"subitem_1522306382014":"DOI","subitem_1522306436033":"https://doi.org/10.1587/transfun.E101.A.367"}},{"subitem_1522306287251":{"subitem_1522306382014":"DOI","subitem_1522306436033":"https://doi.org/10.1587/transfun.E101.A.367"}}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","filename":"e101-a_2_367.pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://u-ryukyu.repo.nii.ac.jp/record/2011305/files/e101-a_2_367.pdf"},"version_id":"0b61acb9-f95b-41a1-a152-f845ff181073"}]},"item_title":"Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets","item_type_id":"15","owner":"1","path":["1642838338003","1642838406845"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2020-12-15"},"publish_date":"2020-12-15","publish_status":"0","recid":"2011305","relation_version_is_last":true,"title":["Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-08-03T05:32:55.837061+00:00"}