logo
言語
ブックマーク
ログアウト

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 10 (1997), No. 4

ISIJ International
belloff
オンライン版ISSN: 2185-811X
冊子版ISSN: 1342-5668
発行機関: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

    1. No.9
    2. No.8
    3. No.7
    4. No.6
    5. No.5
    6. No.4
    7. No.3
    8. No.2
    9. No.1

  2. Vol. 36 (2023)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  3. Vol. 35 (2022)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  4. Vol. 34 (2021)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  5. Vol. 33 (2020)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  6. Vol. 32 (2019)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  7. Vol. 31 (2018)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  8. Vol. 30 (2017)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  9. Vol. 29 (2016)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  10. Vol. 28 (2015)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  11. Vol. 27 (2014)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  12. Vol. 26 (2013)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  13. Vol. 25 (2012)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  14. Vol. 24 (2011)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  15. Vol. 23 (2010)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  16. Vol. 22 (2009)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  17. Vol. 21 (2008)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  18. Vol. 20 (2007)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  19. Vol. 19 (2006)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  20. Vol. 18 (2005)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  21. Vol. 17 (2004)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  22. Vol. 16 (2003)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  23. Vol. 15 (2002)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  24. Vol. 14 (2001)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  25. Vol. 13 (2000)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  26. Vol. 12 (1999)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  27. Vol. 11 (1998)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  28. Vol. 10 (1997)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  29. Vol. 9 (1996)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  30. Vol. 8 (1995)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  31. Vol. 7 (1994)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  32. Vol. 6 (1993)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  33. Vol. 5 (1992)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  34. Vol. 4 (1991)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  35. Vol. 3 (1990)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  36. Vol. 2 (1989)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  37. Vol. 1 (1988)

    1. No.7
    2. No.6
    3. No.5
    4. No.4
    5. No.3
    6. No.2
    7. No.1

キーワードランキング

22 Dec. (Last 30 Days)

システム/制御/情報 Vol. 10 (1997), No. 4

シミュレーティッド・アニーリング法を活用したアルミ板製造プロセスにおける見込み手配の最適化

松田 浩一, 大塚 喜久, 北村 章, 奥村 隆広, 富士 洋, 加藤 宏

pp. 153-164

DOI:

10.5687/iscie.10.153

抄録

This paper describes a optimal scheduling method for stock production. We have constructed an optimizing method to decide variety of the half-finished products applying the simulated annealing method and an optimizing method to decide quantity and production timing of half-finished products applying inventory simulation method. The simulated annealing method is used for deciding what kind of half-finished products should be produced to prepare predicted final orders considering the productivity of half-finished products, the production waste of final products and generality of the half-finished products. The inventory simulation is applied to calculate the quantity and production timing of the half-finished products which satisfy a minimum inventory. It is revealed that higher productivity of half-finished products and lower inventory could be achieved by comparing with real production schedule.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

シミュレーティッド・アニーリング法を活用したアルミ板製造プロセスにおける見込み手配の最適化

twitter
facebook
mendeley

Bibtex

Ris

半製品の姿勢変化を考慮した組立作業計画

稲葉 昭夫, 濱田 慶一, 鈴木 達也, 大熊 繁

pp. 165-172

DOI:

10.5687/iscie.10.165

抄録

An automatic generation of assembly or disassembly sequences is a significant problem for assemblies using robot manipulators. We need to judge feasibility of assembly/disassembly tasks based on geometric information of products. In previous research, only translational motion of subassembly has been considered. However, there are many cases in which a subassembly can be separated from another subassembly using rotational motion.
In this paper, we propose a new algorithm with which we can search a posture of a subassembly to avoid collision with another subassembly. The algorithm is based on the Genetic Algorithm. The proposed method makes it possible to search a posture of a subassembly to realize assembly/disassembly tasks in a very short time.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

半製品の姿勢変化を考慮した組立作業計画

twitter
facebook
mendeley

Bibtex

Ris

製鉄所における酸洗工程の最適製品投入順序問題に対する遺伝アルゴリズムの個体表現法

若杉 誠, 飯間 等, 三宮 信夫, 賀好 栄治, 小林 靖宜

pp. 173-181

DOI:

10.5687/iscie.10.173

抄録

This paper deals with an optimal production ordering problem for an acid rinsing process of a steelmaking plant. The problem is to determine the order of welding hot strip coils in an optimal way subject to complicated constraints. The strip coils are classified into several groups on the basis of their specifications, and the coils belonging to a same group must be arranged successively. Other constraints are precedence relationships between two adjoining coils. The genetic algorithm is applied for obtaining a suboptimal arrangement of strip coils. In our earlier paper we proposed a method for this problem. In this paper another method is proposed for individual description. A part of constraints is always satisfied in the new individual description. Numerical results are compared between the two methods.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

製鉄所における酸洗工程の最適製品投入順序問題に対する遺伝アルゴリズムの個体表現法

twitter
facebook
mendeley

Bibtex

Ris

コンテナターミナルにおけるシフト計画

川合 信行, 阿瀬 始, 茨木 俊秀, 柳浦 睦憲

pp. 182-190

DOI:

10.5687/iscie.10.182

抄録

In a new system of container terminal, its yard is divided into buffer area and stack area in order to separate ship loading/unloading and yard operations. Such a system then necessitates the shift operations between buffer areas and stack areas; import containers are moved from buffer area to stack area and export containers are moved from stack area to buffer area by two RMGs which travel on the same rails. As a result of analyzing the movements of two RMGs, which may interfere each other, we have reduced the scheduling problem of shift operations into two graph theoretical problems, paring problem and sequencing problem, where the paring problem is the maximum weight matching problem with degree constraints and the sequencing problem is a problem of seeking a shortest path that visits a given number of nodes, both of which have been studied in operations research. Furthermore, to deal with multilayer stacks of containers, the scheduling period is decomposed into overlapping subperiods, to which the above scheduling algorithm is applied. The resulting algorithm shows good performance in both quality of solutions and computational speed, and will be in operation in a real system of container terminal from April 1996.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

コンテナターミナルにおけるシフト計画

twitter
facebook
mendeley

Bibtex

Ris

力学モデルスケジューリング手法の高速化

原嶋 勝美, 田嶋 宏規, 平川 裕介, 福永 邦雄

pp. 191-203

DOI:

10.5687/iscie.10.191

抄録

Force-Directed Scheduling, which is one of effective scheduling methods in high-level synthesis of VLSI design automation, takes the long computational time, though it can optimize hardware cost. Therefore it can not be applied to large scale hardware descriptions. This paper describes an efficient approach for Force-Directed Scheduling. The proposed approach reduces the time for estimating hardware cost by neglecting hardly probable assignments instead of considering all possible assignments as was done in the previous approach. The proposed approach, consequently, can optimize hardware cost for large scale circuits with much less running time.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

力学モデルスケジューリング手法の高速化

twitter
facebook
mendeley

Bibtex

Ris

汎用的アプローチを用いた製鋼工程操業スケジューリングシステム

今井 太一, 淺田 克暢, 中川 義之, 熊本 和浩, 野平 正樹

pp. 204-210

DOI:

10.5687/iscie.10.204

抄録

A new scheduling system has been developed for the steel-making process with complex material handling system and lead-time constraints. To devise its scheduling algorithm, our general approach to the multi-stage production scheduling was applied. The algorithm, which can satisfy various objectives and constraints by a combination of backward and forward scheduling, was installed in the new scheduling system using discrete-event simulation with crane assignment rules and pick up timing rules. This system, which can create a refined and reasonable schedule in short time, has contributed to improvement of efficiency in steel-making process.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

汎用的アプローチを用いた製鋼工程操業スケジューリングシステム

twitter
facebook
mendeley

Bibtex

Ris

分散型のAGVシステムにおける情報受信範囲の理論的解析

佐々木 淳, 増山 繁, 山川 栄樹

pp. 211-222

DOI:

10.5687/iscie.10.211

抄録

Recently, some attempts have been made to decentralize vehicle movement control for AGV systems. However, some communication problem may deteriorate the efficiency of the vehicle movement under the protocol similar to the centralized control. Thus, we impose some restriction on the information received area of each vehicle. In this paper, we theoretically analyze the information received area which is necessary and sufficient for each vehicle to reach its destination in finite time. We also clarify necessary and sufficient conditions for the vehicle with the highest priority to continue onward movement.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

分散型のAGVシステムにおける情報受信範囲の理論的解析

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

22 Dec. (Last 30 Days)

この機能はログイン後に利用できます。
下のボタンをクリックしてください。

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

出版日を西暦で入力してください（4桁の数字）。

検索したいキーワードを入力して下さい