ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "c898ebbc-2275-47d0-9568-6501463952da"}, "_deposit": {"id": "13091", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13091"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013091", "sets": ["322"]}, "author_link": ["41196", "41197", "41198", "41199"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1998-04-20", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "4", "bibliographicPageEnd": "625", "bibliographicPageStart": "615", "bibliographicVolumeNumber": "E81-A", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In scheduling problem for automatic assembly, planning of task sequence is closely related with resource allocation. However, they have been separately carried out with little interaction in previous work. In assembly planning problem, there are many feasible sequences for one mechanical product. In order to find the best assembly sequence, we have to decide the cost function for each task a priori and make decision based on summation of costs in sequence. But the cost of each task depends on the machine which executes the allocated task and it becomes difficult to estimate an exact cost of each task at planning stage. Moreover, no concurrent operation is taken into account at planning stage. Therefore, we must consider the sequence planning and the machine allocation simultaneously. In this paper, we propose a new scheduling method in which sequence planning and machine allocation are considered simultaneously. First of all, we propose a modeling method for an assembly sequence including a manufacturing environment. Secondly, we show a guideline in order to determine the estimate function in A* algorithm for assembly scheduling. Thirdly, a new search method based on combination of A* algorithm and supervisor is proposed. Fourthly, we propose a new technique which can take into consider the repetitive process in manufacturing system so as to improve the calculation time. Finally, numerical experiments of proposed scheduling algorithm are shown and effectiveness of proposed algorithm is verified.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/14986"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 1998 IEICE", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8508", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "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": "INABA, Akio", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41196", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "FUJIWARA, Fumiharu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41197", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SUZUKI, Tatsuya", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41198", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "OKUMA, Shigeru", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41199", "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": "417.pdf", "filesize": [{"value": "852.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 852000.0, "url": {"label": "417.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/13091/files/417.pdf"}, "version_id": "01e90a37-8f48-4f0a-9b54-768dd68f0656"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "scheduling", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Timed Petri Net", "subitem_subject_scheme": "Other"}, {"subitem_subject": "assembly", "subitem_subject_scheme": "Other"}]}, "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": "Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["322"], "permalink_uri": "http://hdl.handle.net/2237/14986", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-06-29"}, "publish_date": "2011-06-29", "publish_status": "0", "recid": "13091", "relation": {}, "relation_version_is_last": true, "title": ["Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling"], "weko_shared_id": -1}
  1. B200 工学部/工学研究科
  2. B200a 雑誌掲載論文
  3. 学術雑誌

Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling

http://hdl.handle.net/2237/14986
http://hdl.handle.net/2237/14986
605f168c-c5de-475d-9827-fc7dcaecd588
名前 / ファイル ライセンス アクション
417.pdf 417.pdf (852.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2011-06-29
タイトル
タイトル Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling
言語 en
著者 INABA, Akio

× INABA, Akio

WEKO 41196

en INABA, Akio

Search repository
FUJIWARA, Fumiharu

× FUJIWARA, Fumiharu

WEKO 41197

en FUJIWARA, Fumiharu

Search repository
SUZUKI, Tatsuya

× SUZUKI, Tatsuya

WEKO 41198

en SUZUKI, Tatsuya

Search repository
OKUMA, Shigeru

× OKUMA, Shigeru

WEKO 41199

en OKUMA, Shigeru

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 Copyright (C) 1998 IEICE
キーワード
主題Scheme Other
主題 scheduling
キーワード
主題Scheme Other
主題 Timed Petri Net
キーワード
主題Scheme Other
主題 assembly
抄録
内容記述 In scheduling problem for automatic assembly, planning of task sequence is closely related with resource allocation. However, they have been separately carried out with little interaction in previous work. In assembly planning problem, there are many feasible sequences for one mechanical product. In order to find the best assembly sequence, we have to decide the cost function for each task a priori and make decision based on summation of costs in sequence. But the cost of each task depends on the machine which executes the allocated task and it becomes difficult to estimate an exact cost of each task at planning stage. Moreover, no concurrent operation is taken into account at planning stage. Therefore, we must consider the sequence planning and the machine allocation simultaneously. In this paper, we propose a new scheduling method in which sequence planning and machine allocation are considered simultaneously. First of all, we propose a modeling method for an assembly sequence including a manufacturing environment. Secondly, we show a guideline in order to determine the estimate function in A* algorithm for assembly scheduling. Thirdly, a new search method based on combination of A* algorithm and supervisor is proposed. Fourthly, we propose a new technique which can take into consider the repetitive process in manufacturing system so as to improve the calculation time. Finally, numerical experiments of proposed scheduling algorithm are shown and effectiveness of proposed algorithm is verified.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 Institute of Electronics, Information and Communication Engineers
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/index.html
ISSN
収録物識別子タイプ PISSN
収録物識別子 0916-8508
書誌情報 en : IEICE transactions on fundamentals of electronics, communications and computer sciences

巻 E81-A, 号 4, p. 615-625, 発行日 1998-04-20
著者版フラグ
値 publisher
URI
識別子 http://www.ieice.org/jpn/trans_online/index.html
識別子タイプ URI
URI
識別子 http://hdl.handle.net/2237/14986
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 18:39:17.762972
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