ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_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", "sets": ["322"]}, "author_link": ["39553", "39554", "39555"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2010", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "862", "bibliographicPageStart": "857", "bibliographic_titles": [{"bibliographic_title": "8th IEEE International Conference on Industrial Informatics (INDIN)", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "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_language": "en", "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": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1109/INDIN.2010.5549629", "subitem_relation_type_select": "DOI"}}]}, "item_10_relation_8": {"attribute_name": "ISBN", "attribute_value_mlt": [{"subitem_relation_type": "isPartOf", "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": "権利", "attribute_value_mlt": [{"subitem_rights": "© 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.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Imahori, Shinji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39553", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Karuno, Yoshiyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39554", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yoshimoto, Yui", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39555", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "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_note", "mimetype": "application/pdf", "size": 166200.0, "url": {"label": "1004.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/12575/files/1004.pdf"}, "version_id": "12a59322-7f18-45aa-ba2b-24b02810833e"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "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": "タイトル", "attribute_value_mlt": [{"subitem_title": "Dynamic Programming Algorithms for Duplex Food Packing Problems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/14459", "pubdate": {"attribute_name": "PubDate", "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": -1}
  1. B200 工学部/工学研究科
  2. B200a 雑誌掲載論文
  3. 学術雑誌

Dynamic Programming Algorithms for Duplex Food Packing Problems

http://hdl.handle.net/2237/14459
http://hdl.handle.net/2237/14459
7bdc3b8d-f430-45d1-8ca0-99f41d7ad674
名前 / ファイル ライセンス アクション
1004.pdf 1004.pdf (166.2 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2011-02-10
タイトル
タイトル Dynamic Programming Algorithms for Duplex Food Packing Problems
言語 en
著者 Imahori, Shinji

× Imahori, Shinji

WEKO 39553

en Imahori, Shinji

Search repository
Karuno, Yoshiyuki

× Karuno, Yoshiyuki

WEKO 39554

en Karuno, Yoshiyuki

Search repository
Yoshimoto, Yui

× Yoshimoto, Yui

WEKO 39555

en Yoshimoto, Yui

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 © 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.
抄録
内容記述 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' and I" from the set I of the current n items to produce two packages of foods. After choosing two subsets I' 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.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 IEEE
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ AM
出版タイプResource http://purl.org/coar/version/c_ab4af688f83e57aa
DOI
関連タイプ isVersionOf
識別子タイプ DOI
関連識別子 https://doi.org/10.1109/INDIN.2010.5549629
ISBN
関連タイプ isPartOf
識別子タイプ ISBN
関連識別子 978-1-4244-7298-7
書誌情報 en : 8th IEEE International Conference on Industrial Informatics (INDIN)

p. 857-862, 発行日 2010
著者版フラグ
値 author
URI
識別子 http://hdl.handle.net/2237/14459
識別子タイプ HDL
URI
識別子 http://dx.doi.org/10.1109/INDIN.2010.5549629
識別子タイプ DOI
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 18:50:24.368181
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3