All issues
Volume 22 (1979)
- Issue 4 Pages 257-
- Issue 3 Pages 169-
- Issue 2 Pages 85-
- Issue 1 Pages 1-
Volume 22, Issue 2
Displaying 1-10 of 10 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1979 Volume 22 Issue 2 Pages Cover4-
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (76K) -
Article type: Appendix
1979 Volume 22 Issue 2 Pages App3-
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (96K) -
Noboru Yanagawa, Toshio NishidaArticle type: Article
1979 Volume 22 Issue 2 Pages 85-94
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe pivotal decomposition theorem of the reliability function is applied to the stochastic network. A graphical observation of the theorem always yields more effective result than that of algebraic aspects, that is, the well-selected pivot arc enables the resulting network to contain modules. Our theorem I assures that, and our algorithms will be helpful to determine the optimal pivot of the decomposition.View full abstractDownload PDF (510K) -
Shoichi NishimuraArticle type: Article
1979 Volume 22 Issue 2 Pages 95-105
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSStochastic clearing systems can be applied to bulk-service queue and demand-responsive public-service systems. Customers (input) arrive at a service facility and form a queue waiting to be served. When a server arrive at a service facility, waiting customers are served all together. The problem is to obtain an optimal clearing random interval T which minimizes the long-run average cost. In this paper we derive an optimal clearing random interval T and sufficient conditions under where T is characterized by optimal clearing level q, at which clearing occurs, whenever the cumulative input exceeds a critical level.View full abstractDownload PDF (542K) -
Yukio HatoyamaArticle type: Article
1979 Volume 22 Issue 2 Pages 106-122
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper treats an extension of an optimal machine maintenance model with Markovian deterioration introduced by Derman. The system consists of an operating machine whose deterioration is Markovian, a finite number of identical spare machines, and several types of repair facilities where machines to be repaired are sent depending on the types of repair work required. At each period of time, a decision is made on an operating machine whether it is repaired or not, knowing its degree of deterioration, the type of repair work required if the repair decision is chosen, and the number of machines in each type of repair facility. Here, the repair time distributions, material costs, and labor cost all depend on the type of repair work required on the machine. Sufficient conditions which result in the optimality of control limit policies of some kind are obtained.View full abstractDownload PDF (979K) -
Shinji TOKUMASU, Naganori MOTOI, Motomi ODAMURAArticle type: Article
1979 Volume 22 Issue 2 Pages 123-137
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper deals with the following problem: Suppose there exist n point sets, N_1・ N_2,---,each pint p of which has two attribute values A(p) and F(p), where A(p) takes a binary value 'good' or 'bad' and F(p) takes a value of real number given according to some evaluation of p . Then, the problem is to find an interchanging rule so that by repeatedly interchanging attribute values A(p) and F(p) between p_1, p_2εN(N= U^n_<i=1> N_i), the value (1) should be minimized under the condition that the value (2) be maximal : (1) Max Max |F(p) - F'(p)| iεB pεN_i (2) Value of |B| where , (i) B = {i|A'(p) = 'good' ^∀pεN_i} (ii) A'(p) and F'(p) are attribute functions modified by interchanging . In this paper, the authors have developed a theory by which this problem could be handled as a matching problem for a bipartite graph and presented an efficient algorithm for it. A numerical example and a result of numerical experiment are also given.View full abstractDownload PDF (883K) -
Shogo SAKAKURAArticle type: Article
1979 Volume 22 Issue 2 Pages 138-167
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSSystem Dynamics is ,one of the most suitable methods to analyze Social Economic System problems which have many dynamic interacting factors. System Dynamics (S.D.) analyzes those systems through the dynamic analysis of information feedback loops of many interacting factors of those systems. Actually the examples of S .D. analysis in the field of urban problems, natural resource problems, medicare problems, transportation problems, etc. are increasing those days. But so far numbers of applications are limited, and rules and methods of application are not established yet. And also the applications of S.D. to the unsuitable field are increasing. Those are becoming the source of misunderstanding of S.D. I have been studying the application of S.D. to Social Economic System problems for the past two years and trying to find out suitable rules ,and methods of application. This is a report of this study. In the first place I will write about the most basic ideas of application of S.D. to Social Economic System problems, and then introduce a part of my study of the problems of improvement of medicare insurance system of: Japan, and finally show the important points of application of those ideas to those problems .View full abstractDownload PDF (1979K) -
Article type: Appendix
1979 Volume 22 Issue 2 Pages App4-
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (135K) -
Article type: Cover
1979 Volume 22 Issue 2 Pages Cover5-
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (53K) -
Article type: Cover
1979 Volume 22 Issue 2 Pages Cover6-
Published: 1979
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (53K)
- |<
- <
- 1
- >
- >|