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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

鉄と鋼 Vol. 97 (2011), No. 6

ISIJ International
belloff

Grid List Abstracts
オンライン版ISSN: 1883-2954
冊子版ISSN: 0021-1575
発行機関: The Iron and Steel Institute of Japan

Backnumber

  1. Vol. 110 (2024)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  2. Vol. 109 (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. 108 (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. 107 (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. 106 (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. 105 (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. 104 (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. 103 (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. 102 (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. 101 (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. 100 (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. 99 (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. 98 (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. 97 (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. 96 (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. 95 (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. 94 (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. 93 (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. 92 (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. 91 (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. 90 (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. 89 (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. 88 (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. 87 (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. 86 (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. 85 (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. 84 (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. 83 (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. 82 (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. 81 (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. 80 (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. 79 (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. 78 (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. 77 (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. 76 (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. 75 (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. 74 (1988)

    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

  38. Vol. 73 (1987)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  39. Vol. 72 (1986)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  40. Vol. 71 (1985)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  41. Vol. 70 (1984)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  42. Vol. 69 (1983)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  43. Vol. 68 (1982)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  44. Vol. 67 (1981)

    1. No.16
    2. No.15
    3. No.14
    4. No.13
    5. No.12
    6. No.11
    7. No.10
    8. No.9
    9. No.8
    10. No.7
    11. No.6
    12. No.5
    13. No.4
    14. No.3
    15. No.2
    16. No.1

  45. Vol. 66 (1980)

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

  46. Vol. 65 (1979)

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

  47. Vol. 64 (1978)

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

  48. Vol. 63 (1977)

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

  49. Vol. 62 (1976)

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

  50. Vol. 61 (1975)

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

  51. Vol. 60 (1974)

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

  52. Vol. 59 (1973)

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

  53. Vol. 58 (1972)

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

  54. Vol. 57 (1971)

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

  55. Vol. 56 (1970)

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

  56. Vol. 55 (1969)

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

  57. Vol. 54 (1968)

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

  58. Vol. 53 (1967)

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

  59. Vol. 52 (1966)

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

  60. Vol. 51 (1965)

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

  61. Vol. 50 (1964)

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

  62. Vol. 49 (1963)

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

  63. Vol. 48 (1962)

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

  64. Vol. 47 (1961)

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

  65. Vol. 46 (1960)

    1. No.14
    2. No.13
    3. No.12
    4. No.11
    5. No.10
    6. No.9
    7. No.8-supl
    8. No.7
    9. No.6
    10. No.5
    11. No.4
    12. No.3
    13. No.2
    14. No.1

  66. Vol. 45 (1959)

    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

  67. Vol. 44 (1958)

    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

  68. Vol. 43 (1957)

    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

  69. Vol. 42 (1956)

    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

  70. Vol. 41 (1955)

    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 Dec. (Last 30 Days)

鉄と鋼 Vol. 97 (2011), No. 6

特集号「製鉄所『現場力』の維持・発展のためのエージェント技術」の企画にあたって

玉置 久, 小林 敬和

pp. 315-315

DOI:

10.2355/tetsutohagane.97.315

他の人はこちらも検索

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

特集号「製鉄所『現場力』の維持・発展のためのエージェント技術」の企画にあたって

twitter
facebook
mendeley

Bibtex

Ris

鉄鋼業のスケジューリング業務における現場力

岩谷 敏治

pp. 316-319

DOI:

10.2355/tetsutohagane.97.316

抄録

In this report, the features of expert operators' skills in steelworks are discussed. Most of the skills cannot be substituted with a computer system and we name such skills ‘field forces’. Therefore, it can be said that Japanese steelworks have been supported by the field force. In domestic manufacturing plants, there still remain lots of operations which need field forces, for instance, machine control, fault diagnosis, plant maintenance and production scheduling operations. Here, we take a scheduling operation for an example. By describing the expert operator's tangible abilities which cannot be captured with a conventional scheduling system, we consider the essence of field forces. The outline of this report is as follows. After showing a brief introduction in Chap. 1, an example of a scheduling problem in a steel making process is presented in Chap. 2. The problem is used to describe the difference of the constraints and evaluation function between a human expert and a computer scheduler. In Chap. 3, several specific capabilities of scheduling experts are illustrated. When they deal with a scheduling problem, they always consider various viewpoints such as chronological change of plants. Moreover, some experts are able to even convert the problem drastically when a serious plant trouble happens in an upper process. In Chap. 4, we discuss the necessary system requirements for scheduling software to attain the human expert capabilities shown above and finish this report with a conclusion in Chap. 5.

他の人はこちらも検索

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

鉄鋼業のスケジューリング業務における現場力

twitter
facebook
mendeley

Bibtex

Ris

エージェント技術による現場力向上イメージの明確化のためのシナリオ

小林 敬和, 北條 成人, 岩村 健, 伊藤 邦春

pp. 320-325

DOI:

10.2355/tetsutohagane.97.320

抄録

Systematization and automation have been promoted and achieved big results for iron and steel industries in Japan. On the other hand, enough result is not achieved for the duties experienced personnel are in charge. Under such situation, a large amount of the retirement of experienced personnel is worried about. So it is one of the most pressing issues how to maintain and also to enlarge the technical predominance. As an approach to resolve this issue, agent technology-based approaches which can deal with knowledge of experienced personnel are expected.
In this work, a scenario has been written to enhance the image of agent technologies, and we discuss the functions which are needed for agent technologies.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

エージェント技術による現場力向上イメージの明確化のためのシナリオ

twitter
facebook
mendeley

Bibtex

Ris

熱延操業支援エージェント構築のための操業診断と圧延操作方法

小西 正躬, 中野 孝一, 今井 純

pp. 326-333

DOI:

10.2355/tetsutohagane.97.326

抄録

In the last two decades, it becomes possible to automate operations of various steel plants especially in rolling mills. As the results, stabilization of productivity and improvement of product quality have been attained. On the while, in these years, many skilled engineers and operators who actively promoted economical growth of steel industries will retire due to their age limits. Thus, the inheritance of the high level technology and know-how has becomes a serious problem. To overcome the problem, it is necessary to extract knowledge of the skilled persons and make technical textbook reducing tacit knowledge. In this paper, rules are extracted from the operation data of hot strip rolling applicable to the operation diagnosis and intervention during operation. To attain the object, agent based simulator of hot strip rolling has been developed to prepare various rolling data for extraction of diagnosis and intervention rules in rolling operations. As for the selection of normal and abnormal data, SVM algorithm is tested before rules extraction. Rules are written in Fuzzy logic forms and its parameters are optimized by GA algorithm. These technologies are involved in the operation support agent system of hot strip rolling mills together with RNN for automatic gain tuning of mill controller.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

熱延操業支援エージェント構築のための操業診断と圧延操作方法

twitter
facebook
mendeley

Bibtex

Ris

学習分類子システムを用いたプラントオペレーション知識の獲得

寺野 隆雄, ハスナット　E. M. アブ, エムハデ　イルファン

pp. 334-340

DOI:

10.2355/tetsutohagane.97.334

抄録

We are conducting a research and development project on agent technologies to enrich “Field Forces” in steel industries under the support of the Iron and Steel Institute of Japan. The objective of the project is to explore the applicability of recent software agent technologies to practical task domains performed by both human experts and plant systems. Under the support, this paper proposes a new method to extract plant operation knowledge from time varying plant data. The method is characterized by the use of Learning Classifier Systems (LCSs), which is one of machine learning methods with rule generation, modification by evolutionary algorithms. We have equipped plural learning components, each of which consists of XCS (eXtended Classifier System), a recent advanced version of LCSs. We have designed each XCS as a software agent with communication capabilities among the other agents and the operation environments. This paper describes the basic principles and implementation of the method, then explains how the proposed method can be applied to plant operation tasks for hot strip mills of a steel plant. In our methodological frame work, we do not use any plant specific knowledge but only rely on the plant operation data virtually generated by the simulator of hot strip mills operations developed by Konishi et al. The objective of the proposed method is, therefore, to explore the feasibility of the data oriented method with XCS agents. The proposed method is combined with the simulator of hot strip mills operation and shows the effectiveness.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

学習分類子システムを用いたプラントオペレーション知識の獲得

twitter
facebook
mendeley

Bibtex

Ris

数理計画モデルによる熟練者エージェントへの接近

玉置 久, 杉川 智

pp. 341-346

DOI:

10.2355/tetsutohagane.97.341

抄録

Due to a large amount of the retirement of experienced personnel, it is one of the most serious issues how the technical predominance of manufacturing industries, such as iron and steel industries in Japan, can be maintained. Here, from the viewpoint of problem-solving by experienced personnel, the acquisition and the utilization of some additional and essential information might be crucial. According to this observation, in the paper, a kind of scheduling problems, i.e., a scheduling problem of the flexible flow shop type with uncertainty in set-up operations, is taken as an example of the problem-solving in manufacturing industries. Then, a mathematical programming-based approach is investigated, where two kinds of optimization models are formulated: One is the model of the solution by unskillful personnel in which only the normal (or common) data is used, whereas the other is the solution model by experienced personnel in which some additional information is available. Furthermore, through some computational examples for the simplified scheduling problem of the flexible flow shop type, the potential of the experienced personnel model, i.e., the robustness of the obtained schedule for uncertain situations, has been confirmed.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

数理計画モデルによる熟練者エージェントへの接近

twitter
facebook
mendeley

Bibtex

Ris

鉄鋼生産計画業務学習支援を目的とした熟練者エージェントの機械学習によるモデリング

鳩野 逸生, 横田 勝俊, 福永 詩文

pp. 347-351

DOI:

10.2355/tetsutohagane.97.347

抄録

This paper deals with machine learning based modelling of skilled worker agents for production planing learning support systems in steel production. In this paper, a try-and-error process in generating a schedule is assumed to consist of three steps: (1) select appropriate priority rules and evaluation items, (2) generate a schedule by using the priority rules, (3) evaluate of the generated schedule and revise the priority rules based on the evacuation. The scheduling generation processis modelledby using Stochastic Learning Automata, whichisakindof reinforcement learning method, to obtain thee.ective ‘know-how’ fora production planning learning support system. Asimulation experiment has been carried out in order to evaluate the model. The simulation results suggested that the know-hows obtained in the simulation experiments may be able to apply them into a production planning learning support system.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

鉄鋼生産計画業務学習支援を目的とした熟練者エージェントの機械学習によるモデリング

twitter
facebook
mendeley

Bibtex

Ris

意思決定者の選好を考慮したTZBMによるフローショップスケジューリング問題の解法

椹木 哲夫, 徐 鶴, 田 雅杰, 堀口 由貴男, 任 継東

pp. 352-359

DOI:

10.2355/tetsutohagane.97.352

抄録

Nowadays steel manufacturing pays a critical attention to on-time delivery and inventory reduction. In our study, we propose a heuristic algorithm to solve the hybrid flow shop scheduling problem (HFSP) considering reducing total tardiness and inventory time. In order to achieve a feasible solution in limited computational time, the algorithm is based on Three-zone Buffer Management (TZBM) approach. TZBM approach combines the Drum Buffer Rope (DBR) method proposed in theory of constraints (TOC), with a contract net protocol in multi-agent system (MAS). The effectiveness of the proposed algorithm is shown by simulation results comparing with the results obtained by a Tabu search (TS) algorithm. In the production field, a shipment buffer is set between the due date and the shipping time in order to avoid possible late shipment. The size of shipment buffer is always decided according to the experience of a system operator who has responsibility to draw up a production schedule. Wherein, an operator needs to take a decision considering trade-off between on-time delivery and inventory reduction. Therefore, a new interactive decision support system is proposed which is based on the two-stage TZBM approach. The operator needs to make his/her judgment whether an optimal solution shown by the system is preferable or not, then to change the trade-off between the two conflicting objectives. The system needs to compute another optimal solution according to judgment given by the operator. Under the result of numerical experiments, to integrate the experience of operators with the computational intelligence of systems proves to be an effective scheduling method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

意思決定者の選好を考慮したTZBMによるフローショップスケジューリング問題の解法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

21 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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