{"_buckets": {"deposit": "24feb429-4fbc-462e-ab6f-6c8ef95e859f"}, "_deposit": {"id": "12575", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "12575"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00012575"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2010", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "862", "bibliographicPageStart": "857", "bibliographic_titles": [{"bibliographic_title": "8th IEEE International Conference on Industrial Informatics (INDIN)"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "In this paper, we discuss a lexicographic bi-criteria combinatorial optimization problem arising in automated food packing systems known as so-called automatic combination weighers. A typical food packing system possesses n weighing hoppers. Some amount of foods is thrown into each hopper, and it is called an item. We deal with a duplex packing operation such that the food packing system chooses two disjoint subsets I\u0027 and I\" from the set I of the current n items to produce two packages of foods. After choosing two subsets I\u0027 and I\", the resulting empty hoppers are supplied with next new items, and the set I is updated. By repeating the duplex packing operation, a large number of packages are produced two by two. The primary objective of lexicographic bi-criteria duplex food packing problem is to minimize the total weight of chosen items for two packages, making the total weight of each package no less than a specified target weight T. The second objective is to maximize the total priority of chosen items for two packages so that items with longer durations in hoppers are preferably chosen. The priority of an item is given as its duration in hopper. In this paper, we prove that the lexicographic bi-criteria duplex food packing problem can be solved in O(nT2) time by dynamic programming if all input data are integral.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/14459"}, {"subitem_identifier_type": "DOI", "subitem_identifier_uri": "http://dx.doi.org/10.1109/INDIN.2010.5549629"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "IEEE"}]}, "item_10_relation_8": {"attribute_name": "ISBN", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "978-1-4244-7298-7", "subitem_relation_type_select": "ISBN"}}]}, "item_10_rights_12": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "\u00a9 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works."}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Imahori, Shinji"}], "nameIdentifiers": [{"nameIdentifier": "39553", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Karuno, Yoshiyuki"}], "nameIdentifiers": [{"nameIdentifier": "39554", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yoshimoto, Yui"}], "nameIdentifiers": [{"nameIdentifier": "39555", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "1004.pdf", "filesize": [{"value": "166.2 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 166200.0, "url": {"label": "1004.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/12575/files/1004.pdf"}, "version_id": "12a59322-7f18-45aa-ba2b-24b02810833e"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Dynamic Programming Algorithms for Duplex Food Packing Problems", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Dynamic Programming Algorithms for Duplex Food Packing Problems"}]}, "item_type_id": "10", "owner": "1", "path": ["320/321/322"], "permalink_uri": "http://hdl.handle.net/2237/14459", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2011-02-10"}, "publish_date": "2011-02-10", "publish_status": "0", "recid": "12575", "relation": {}, "relation_version_is_last": true, "title": ["Dynamic Programming Algorithms for Duplex Food Packing Problems"], "weko_shared_id": null}