Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
1980 Volume 23 Issue 4 Pages Cover10-
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.Cover10

JOURNAL FREE ACCESS

Download PDF (82K)
[title in Japanese]

Article type: Appendix
1980 Volume 23 Issue 4 Pages App7-
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.App7

JOURNAL FREE ACCESS

Download PDF (115K)
A GRAPHICAL APPROACH TO THE PROBLEM OF LOCATING THE ORIGIN OF THE SYSTEM FAILURE

Masao Iri, Katsuaki Aoki, Eiji Oshima, Hisayoshi Matsuyama

Article type: Article
1980 Volume 23 Issue 4 Pages 295-312
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.295

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper presents a way of formulating the problem of locating the origin of a system failure. A signed digraph is used for a mathematical model representing the influences among elements of the system, and the concept of a pattern on the signed digraph is introduced for representing a state of the system. The representations are quite rough and qualitative. The origin of a failure of the system can be located in terms of these concepts. It is further pointed out that, even when the pattern can be observed partially, the assumption of a single origin of the failure enables us to restrict the possible range of the origin to some extent.

View full abstract

Download PDF (991K)
A TWO-UNIT PARALLELED SYSTEM WITH GENERAL DISTRIBUTION

Mamoru Ohashi, Toshio Nishida

Article type: Article
1980 Volume 23 Issue 4 Pages 313-325
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.313

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper considers a two-unit paralleled system with general failure time and repair time distributions. The equations governing the behaviour of the system, without using regenerative (or cyclic) nature, have been derived by employing the method of supplementary variable. Then the problems of calculating the Laplace transform of the reliability of the system and the mean time to the first system failure are reduced to that of solved a well-known Fredholm integral equation, depending on the pdf's of the failure and repair time of units. In addition, the probability that repairman is idle at time t, the expected total idle time of repairman during the interval (O,t] , and the expected number of repair until the system failure occurs are shown.

View full abstract

Download PDF (574K)
ON A THREE-PERSON SILENT MARKSMANSHIP CONTEST

Tadashi Kurisu

Article type: Article
1980 Volume 23 Issue 4 Pages 326-340
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.326

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we consider a three-person silent marksmanship contest. Each of three players 1 , 2 and 3 has a gun with exactly one bullet which may be fired at any time on [0, 1] aiming at his own target. The accuracy function A_i(x) for player i is strictly increasing and differentiable with A_i(0) = 0 and A_i(1) = 1 . The first player hitting his target gets payoff +1 and other two players get payoff zero. For the game, we get a Nash equilibrium point and equilibrium payoff for each player. The form of the Nash equilibrium point differs whether A _1(x)/A_2(x)A_3(x), A_2(x)/A_1(x)A_3 (x) and A_3(x)/A _1(x)A_2(x) decrease or one of these increases. Some examples are given to illustrate the results.

View full abstract

Download PDF (628K)
ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE

Jeyaveerasingam George Shanthikumar

Article type: Article
1980 Volume 23 Issue 4 Pages 341-352
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.341

JOURNAL FREE ACCESS

Show abstractHide abstract

We analyze two models of controlled M/G/1 queues with shortest processing time service discipline and removable server. The control policies considered here are the server vacation policy of Levy and Yechiali and the N-controle policy of Heyman. The Laplace-Stieltjes transform of the waiting time distributions, the mean cost rates and the optimal control policies are derived for these two models. Properties of level crossings of regenerative processes and delayed busy cycles are used in our analysis.

View full abstract

Download PDF (645K)
A SEQUENTIAL UNIT ALLOCATION FOR PARALLEL REDUNDANT SYSTEM

Tsuneynki Namekata, Yoshio Tabata, Toshio Nishida

Article type: Article
1980 Volume 23 Issue 4 Pages 353-367
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.353

JOURNAL FREE ACCESS

Show abstractHide abstract

The present paper deals with a continuous-time sequential allocation problem in the following context. Consider an m-unit parallel system in which each unit stochastically deteriorates with age. When the system breaks down, all or some failed units are replaced with new units or the failed system is left as it is until the and of planning horizon. As a result of this action, an idle time occurs and the cost is incurred during the idle time. We investigate a sequential unit allocation procedure that minimized the total expected cost under the conditions that the planning horizon is given and a finite number of units are available for replacement. Some important properties of optimal policy are obtained for m=2, and a simple example is presented to illustrate our model.

View full abstract

Download PDF (677K)
DIFFUSION APPROXIMATION METHOD FOR MULTI-SERVER QUEUEING SYSTEM WITH BALKING

Shyamal Kanti Biswas, Teruo Sunaga

Article type: Article
1980 Volume 23 Issue 4 Pages 368-386
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.368

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper deals with the diffusion approximation technique for solving multi-server queueing problems with balking having Erlangian inter-arrival time and Erlangian service time distributions. Probability of joining of a new customer to the system is assumed to vary as e^<-γy> where γ is a positive parameter and y is the queue length. The approximation technique is based on the theory of diffusion, considering only means and variances of arrival and departure processes. Approximate formulas for P (n), probability of finding n customers in the system, and L, mean number of customers in the system, at steady state, are given. Finally, comparisons of approximate and exact or simulated values of mean number L of customers in the system are made for some E_l/E_k/s (∞) systems with balking to show the effectiveness of the approximation technique and graphs of approximate values of L for several systems are drawn which can be used in practice.

View full abstract

Download PDF (876K)
[title in Japanese]

Article type: Index
1980 Volume 23 Issue 4 Pages 387-388
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.387

JOURNAL FREE ACCESS

Download PDF (66K)
[title in Japanese]

Article type: Appendix
1980 Volume 23 Issue 4 Pages App8-
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.App8

JOURNAL FREE ACCESS

Download PDF (177K)
[title in Japanese]

Article type: Cover
1980 Volume 23 Issue 4 Pages Cover11-
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.Cover11

JOURNAL FREE ACCESS

Download PDF (69K)
[title in Japanese]

Article type: Cover
1980 Volume 23 Issue 4 Pages Cover12-
Published: 1980
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.23.Cover12

JOURNAL FREE ACCESS

Download PDF (69K)

Register with J-STAGE for free!