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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 13 (2000), 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.2
    2. 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

キーワードランキング

16 May. (Last 30 Days)

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

多様な効用下における流通システムの運用法に関する研究

貝原 俊也

pp. 159-167

DOI:

10.5687/iscie.13.4_159

抄録

Nowadays it is not enough to supply products based on customer's preference, and both manufactures and distributors must have excellent order fulfillment. Leading manufactures and distributors are closely managing their suppliers in order to improve the fulfillment. Market mechanism solves the product distribution problem by allocating the scheduled resources according to market prices. In this paper a new concept based on market-oriented programming with various utilities of agents is introduced so as to facilitate Pareto-optimal products allocation amongst various business units in distribution system. Simulation results indicate the effectiveness of the proposed algorithm and detect further research subjects.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

多様な効用下における流通システムの運用法に関する研究

twitter
facebook
mendeley

Bibtex

Ris

プロキシキャッシュサーバによる地域HTTP-IXPの構築とその評価実験

白石 善明, 白河 芳徳, 太田 能, 曽根 直人, 森井 昌克

pp. 168-178

DOI:

10.5687/iscie.13.4_168

抄録

In the Internet, the IXP (Internet Exchange Point) /s tend to be congested since all traffic must go through the IXP's if the ISP (Internet Service Provider) 's belong to the different upper ISP's. In particular, this problem is serious in Japan since we have only a few IXP's. To ease this problem, we focus on the HTTP traffic exchanged among the neighboring ISP's since the web browsing causes major traffic in the Internet. In this paper, we provide a structure of regional HTTP-IXP and its experimental results. Our HTTP-IXP system aims to reduce the backborn traffic with comparatively low cost by exchanging the regional HTTP traffic via HTTP cash server. Our experimental results show that the backborn traffic can be reduced without the degradation of any user QoS (Quality of Service).

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

プロキシキャッシュサーバによる地域HTTP-IXPの構築とその評価実験

twitter
facebook
mendeley

Bibtex

Ris

一般化包絡分析法と遺伝アルゴリズムによる多目的最適化の一手法

尹 禮分, 中山 弘隆, 谷野 哲三, 荒川 雅生

pp. 179-185

DOI:

10.5687/iscie.13.4_179

抄録

In this paper, a method using generalized data envelopment analysis and genetic algorithms is proposed for finding efficient frontiers in multi-objective optimization problems. The proposed method can yield desirable efficient frontiers even in nonconvex cases. It will be proved that the proposed method overcomes shortcomings of existing methods through several numerical examples.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

一般化包絡分析法と遺伝アルゴリズムによる多目的最適化の一手法

twitter
facebook
mendeley

Bibtex

Ris

航空管制のための複数機の可変速度軌道合成法

杉山 正治, 秋下 貞夫

pp. 186-193

DOI:

10.5687/iscie.13.4_186

抄録

This paper discusses Three Dimensional (3D; 2D in space and 1D in time) trajectories synthesis algorithms for future air traffic control automation. In order to prepare the computerized air traffic automation systems that assist human controller, highly complicated time optimal problem should be investigated in non-linear control systems. First, synthesis of the plural trajectories with constant speed is discussed aiming to substitute for human controller that plans simultaneously trajectories of eight aircraft at most. Second, synthesis of the plural trajectories with variable speed for eight aircraft is discussed.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

航空管制のための複数機の可変速度軌道合成法

twitter
facebook
mendeley

Bibtex

Ris

予測評価探索をともなう分枝限定法による出荷バースの操業スケジューリング

梅田 豊裕, 小西 正躬, 北村 章, 金村 真三, 高見 真司

pp. 194-203

DOI:

10.5687/iscie.13.4_194

抄録

In this paper, we describe a scheduling algorithm for berth assignment of shipment in iron and steel works. In the berth scheduling we discuss here, it is necessary to consider both minimization of the waiting-time of shipment for each ship and maximization of the efficiency of work in each berth. To determine the optimal combination between berths and ships, and the optimal order of shipment, we develop an algorithm based on branch and bound method. To improve the efficiency of optimal solution search in this algorithm, we introduce an estimation term of cost-increase for unallocated ships in the evaluation function structure, and use a heuristic search in determination of an initial solution. Moreover, to apply to a larger problem, we also use a practical solving method for divided search space. By using this algorithm, the scheduling system can provide a useful planning result of daily berth assignment within practicable time.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

予測評価探索をともなう分枝限定法による出荷バースの操業スケジューリング

twitter
facebook
mendeley

Bibtex

Ris

ジョブショップ・スケジューリングにおける定期スケジュール修正時期の最適化に関する研究

諏訪 晴彦, 淺田 克暢, 三道 弘明

pp. 204-211

DOI:

10.5687/iscie.13.4_204

抄録

This paper proposes a mathematical model of an optimal periodic schedule revision policy for jobshop scheduling where we detect delays of tasks and perform a periodic schedule revision at iT/M (i= 1, 2, …, M) for a schedule period T. We first overview the jobshop scheduling and then investigate the property of schedule delays. The long-run average cost per unit time of the schedule revision policy is, secondly, formulated under the assumption that the number N (t) of delayed tasks occurring over (0, t] follows a non-homogeneous Poisson process with mean value function H (t) . It is shown that there always exists a finite frequency M* minimizing the long-run average cost. Through computational experiments, finally, we discuss the characteristics of the proposed policy and its applicability to jobshop scheduling problems.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ジョブショップ・スケジューリングにおける定期スケジュール修正時期の最適化に関する研究

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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