{"created":"2023-05-15T10:27:02.969487+00:00","id":22344,"links":{},"metadata":{"_buckets":{"deposit":"6a9da88c-5cd9-407c-924e-07be7f506b58"},"_deposit":{"created_by":1,"id":"22344","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"22344"},"status":"published"},"_oai":{"id":"oai:u-fukui.repo.nii.ac.jp:00022344","sets":["2403:2404"]},"author_link":["64473","64474","64472","64471"],"item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2010","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"1190","bibliographicPageStart":"1185","bibliographic_titles":[{"bibliographic_title":"Systems Man and Cybernetics (SMC),2010 IEEE International Conference on"}]}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"An optimal resource allocation algorithm, Hungarian algorithm, is not directly applicable to manufacturing scheduling problems, because solutions of resource allocation problems may violate precedence constraints among processes that constitute individual manufacturing jobs. To apply Hungarian algorithm to scheduling problems, in this paper, several strategies for assigning prices to time slots of individual machines, which are allocated to processes, are proposed. Preliminary experimentation results showed that these strategies can generate near optimal schedules, i.e. when lengths of scheduling horizons were larger than 3 times of the maximum lengths of jobs, generated schedules could complete given jobs while maintaining the deterioration of the efficiency less than 5% from optimal schedules.","subitem_description_type":"Abstract"}]},"item_10001_relation_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"TD00006791","subitem_relation_type_select":"NCID"}}]},"item_10001_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1062922X","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TAMURA, Shinsuke"}],"nameIdentifiers":[{"nameIdentifier":"64471","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"KODERA, Yuki"}],"nameIdentifiers":[{"nameIdentifier":"64472","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"TANIGUCHI, Shuji"}],"nameIdentifiers":[{"nameIdentifier":"64473","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"YANASE, Tatsuro"}],"nameIdentifiers":[{"nameIdentifier":"64474","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2020-08-04"}],"displaytype":"detail","filename":"SMC2010-1185-1190.pdf","filesize":[{"value":"180.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"SMC2010-1185-1190.pdf","url":"https://u-fukui.repo.nii.ac.jp/record/22344/files/SMC2010-1185-1190.pdf"},"version_id":"330014e2-75a2-4bfd-8055-80a3a8917803"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"scheduling","subitem_subject_scheme":"Other"},{"subitem_subject":"hungarian algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"near-optimal schedules","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"other","resourceuri":"http://purl.org/coar/resource_type/c_1843"}]},"item_title":"Feasibility of Hungarian Algorithm based Scheduling","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Feasibility of Hungarian Algorithm based Scheduling"}]},"item_type_id":"10001","owner":"1","path":["2404"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-22"},"publish_date":"2011-02-22","publish_status":"0","recid":"22344","relation_version_is_last":true,"title":["Feasibility of Hungarian Algorithm based Scheduling"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-05-15T13:02:44.435762+00:00"}