WEKO3
アイテム
Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling
http://hdl.handle.net/2237/14986
http://hdl.handle.net/2237/14986605f168c-c5de-475d-9827-fc7dcaecd588
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
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× FUJIWARA, Fumiharu× SUZUKI, Tatsuya× OKUMA, Shigeru |
|||||
| アクセス権 | ||||||
| アクセス権 | 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 | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | 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 | |||||
| 出版者 | ||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | 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 | |||||
