著者
三宮 信夫
出版者
公益財団法人 集団力学研究所
雑誌
集団力学 (ISSN:21872872)
巻号頁・発行日
vol.32, pp.3-58, 2015-12-28 (Released:2015-04-04)

大学組織は、教員、学生および事務職員で構成され、特に教員と学生は、基本的には、個人の価値観に基づいて自由に行動することが認められている。しかし現代では、大学を取り巻く種々の環境からの評価や決定が、大学の活動に影響を与える状況になっている。 大学は、高等教育機関であり、研究活動によって真理を探究し、教育活動によって学生を通じてそれを社会に広めることが、組織の目的である。このことは、大学内外の共通の認識であるが、具体的な問題に対応すると、自由なるが故のばらばらの要求が発生する。すなわち、教員や学生は個人の価値観に基づいた活動を望み、環境は大学の機関としての目的達成度上昇を要求する。法人化された大学では、その間の要求の調整が、学長の重要な任務となる。 筆者は、長年国立大学教員として、教育および研究活動に従事した後、9年間地方公立大学学長を務めた。その間大学環境は大きく変化し、それに対応する大学改革を、学長のリーダーシップで実践することになった。本論文は、実践期間中に学長メッセージとして教員に示した私見をまとめたもので、グループ・ダイナミックスのリーダーシップによる制御の一実施例を提供するものである。
著者
傅 貴 趙 勇 三宮 信夫
出版者
一般社団法人 システム制御情報学会
雑誌
システム制御情報学会論文誌 (ISSN:13425668)
巻号頁・発行日
vol.16, no.5, pp.234-241, 2003
被引用文献数
2

A genetic algorithm (GA) is proposed to solve no-buffer jobshop scheduling problems. In the case of applying the standard GA to these problems, no-buffer constraint leads to a deadlock state in the meaning that an operation cannot be processed on the next machine in a pre-defined machine sequence. Because it causes many infeasible solutions, the standard GA cannot perform an efficient search. In this paper, we propose a new semi-active decoding method which avoids the deadlock to generate a feasible solution. Computer experiments on some modified benchmark problems show that the proposed GA performs efficient search and obtains equivalent or better schedules than other algorithms proposed previously.
著者
福井 敦彦 飯間 等 三宮 信夫
出版者
一般社団法人 システム制御情報学会
雑誌
システム制御情報学会論文誌 (ISSN:13425668)
巻号頁・発行日
vol.10, no.3, pp.107-115, 1997-03-15 (Released:2011-10-13)
参考文献数
8
被引用文献数
1 3

This paper deals with assigning N operations on parallel H machines. The earliest start time, the latest finish time and the processing time are defined for each operation. The problem is to minimize the deviation of each processing time from the desirable time interval. We propose two autonomous decentralized scheduling algorithms to solve this problem. In these algorithms, an operation is transferred from one machine to another machine on the basis of information exchanges and cooperation among subsystems. By examining numerical results, a comparison is made between two algorithms from the viewpoints of accuracy and computation time. Consequently, abetter algorithm is found to be the one based on negotiations of one subsystem with the others.
著者
三宮 信夫 島田 亮 中峯 浩
出版者
The Society of Instrument and Control Engineers
雑誌
計測自動制御学会論文集 (ISSN:04534654)
巻号頁・発行日
vol.29, no.2, pp.211-219, 1993-02-28 (Released:2009-03-27)
参考文献数
10
被引用文献数
13 9

The autonomous decentralized system is a system whose functional order is generated only by cooperative interactions among its subsystems. In other words, the system does not have any supervisor for the entire system. Instead, each subsystem has the autonomy to control each part of the system. But, that system has not been realized yet as an artificial. Fortunately, there are many examples of the autonomous decentralized system in the biological and ecological world. In this paper, we consider a fish school as an autonomous decentralized system. The schooling mechanism of a fish behavior is studied by using modeling and simulation techniques.A water tank experiment was carried out to obtain an observation data for fish behavior and to know a special feature of a school. The unknown parameters included in the model were estimated by using a water tank experiment data. The relationship between the information obtained by each individual and the state of school was investigated.
著者
梁 振林 松田 皎 三宮 信夫
出版者
日本水産學會
雑誌
日本水産学会誌 (ISSN:00215392)
巻号頁・発行日
vol.58, no.5, pp.853-860, 1992
被引用文献数
5 2

Matuda-Sannomiya's fish behavior model has been improved mainly on the basis of the experiment for rose bitterling <i>Rhodeus ocellatus ocellatus</i>. The model was reexamined for the behavior of Japanese dace <i>Tribolodon hakonensis</i> in a water tank experiment. The behavior of Japanese dace in a 1.7m equilateral octagonal water tank was recorded on video using 4 TV cameras which covered the whole area of the tank. On the basis of these time series data, the parameters included in the model were determined by the method of the least squares algo-rithm. However, some physical contradictions were observed in the parameters. This paper presents a modified model for describing the behavior of Japanese dace. In the new model, the interactive force between the fish and the attractive force of the wall were modified. The parameters in this model were suited, and the whiteness test of the residual was passed. The simulation by the modified model showed close agreement with the swimming behavior of Japanese dace.
著者
飯間 等 三宮 信夫
出版者
一般社団法人 電気学会
雑誌
電気学会論文誌. C (ISSN:03854221)
巻号頁・発行日
vol.122, no.3, pp.409-416, 2002
被引用文献数
1

This paper deals with modified scheduling problems in manufacturing systems. Recently optimization is required for not only basic scheduling problems but also scheduling problems modified in such a way that some constraints are added or are removed. Genetic algorithm (GA) is considered to be a promising method for solving the modified scheduling problems, because change of the procedure is small for the modification. In GA the problems can be solved only by adding (removing) the modules related to the added (removed) constraints. In this paper, a module type GA (MTGA) is proposed based on this idea, and the MTGA is designed for solving a mixed problem of machine scheduling and worker allocation. In a factory, both skillful workers and untrained workers work together, and the efficiency of operations depends on the allocation of workers to machines. The effectiveness of the proposed algorithm is investigated through a numerical result for a job-shop scheduling problem.