Journal of the Operations Research Society of Japan

[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (169K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (173K)
A SEARCH GAME WITH TRAVELING COST

Kensaku Kikuta

Article type: Article
1991 Volume 34 Issue 4 Pages 365-382
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

There are n neighboring cells in a straight line. A man selects a cell, hides in it and Stays there. The searcher examines each cell until he finds the hider. Associated with the examination are a traveling cost dependent on the distance from the last cell examined and an examination cost which varies from cell to cell. The searcher wishes to minimize the expectation of cost of finding the hider, whereas the hider wishes to maximize it. The problem is formulated as a two-person zero-sum game and it is solved.

View full abstract

Download PDF (938K)
AN OPTIMAL N-JOB BACKUP POLICY MAXIMIZING AVAILABILITY FOR A HARD COMPUTER DISK

Hiroaki Sandoh, Hajime Kawai

Article type: Article
1991 Volume 34 Issue 4 Pages 383-390
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Personal computers and engineering work stations are generally used with hard computer disks which preserve a variety of files for reference. Some or all of these files are sometimes lost because of human errors and failures of the computer system or the hard disk. Making a backup copy of files on floppy disks or magnetic tapes protects a user from such serious losses. The present study discusses an optimal backup policy for a hard computer disk where a backup copy of files in the hard disk is made when N jobs of updating or creating files are finished. The availability of the proposed backup policy is formulated and the existence of the optimal integer N* which maximizes the availability is examined. It is shown that there always exists an optimal integer N* equal to or greater than 1. A numerical example is presented to illustrate the theoretical model for determining the optimal backup policy using gamma distributions to describe t,he setup time, the job processing time and the backup time for a system subject to exponential failures.

View full abstract

Download PDF (448K)
REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING

Kaoru Tone

Article type: Article
1991 Volume 34 Issue 4 Pages 391-403
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

We will point out some relations between potential and barrier function methods for linear programming. Then, based on the relations, we will show that the classical logarithmic barrier function method for linear programming can be adjusted so that it generates the optimal solution in O(√<n>L) iterations, where n is the number of variables and L is the data length. The method can be seen as a barrier function version of Ye's "An O(n^3L) potential reduction algorithm for linear programming".

View full abstract

Download PDF (651K)
COMPUTATIONAL ASPECTS OF BULK-SERVICE QUEUEING SYSTEM WITH VARIABLE CAPACITY AND FINITE WAITING SPACE: M/G_Y/1/N+B

M.L. Chaudhry, U.C. Gupta, B.R. Madill

Article type: Article
1991 Volume 34 Issue 4 Pages 404-421
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, a comparative analysis of the computational aspects of a bulk-service queueing system with variable capacity and finite waiting space is carried out using the Jacobi method of iteration and the rootfinding method. Steady-state probabilities and moments of the number of customers in system at post-departure epochs have been obtained. In the special case when service is performed in batches of fixed size B, a set of relations among post-departure, random and pre-arrival epochs probabilities has also been obtained. For this special case, we present various performance measures such as moments of number in system at random epoch, probability of blocking, probability that server is busy, etcetera. A variety of numerical results have been obtained for several service-time distributions: Erlang, deterministic and hyperexponential. It was finally observed that the Jacobi method is less cumbersome than the rootfinding method.

View full abstract

Download PDF (1018K)
ON THE JOINT DISTRIBUTION OF THE DEPARTURE INTERVALS IN AN M/G/1/N QUEUE

Akihiko Ishikawa

Article type: Article
1991 Volume 34 Issue 4 Pages 422-435
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper discusses a stationary departure process from the M/G/1/N queue. Using a Markov renewal process, we examine the joint density function f_k of the k-successive departure intervals. In Section 2, we discuss the covariance of departure intervals. The departure intervals are statistically independent in case of N = O or N = 1, but not in case of N = 2 or N = 3. In Section 3, f_k in the M/M/1/N is shown to be a symmetric function of arrival and service rates, and we find that cov(d_1, d_k) is not dependent on lag k, for k ≦ N + 1. Further, we prove that the covariance of departure intervals in the dual (reversed) system is equal to one in the original system, for any lag k.

View full abstract

Download PDF (650K)
AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST

Kensaku Kikuta

Article type: Article
1991 Volume 34 Issue 4 Pages 436-448
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

There are n neighboring cells in a straight line. An object is in one of all cells. It is required to determine a strategy that will minimize the expected cost of finding the object. A probability of overlooking the object is equal to zero, when the right cell is searched. Associated with the examination are a traveling cost dependent on the distance from the last cell examined and a fixed examination cost. A procedure for finding an exactly optimal strategy is given.

View full abstract

Download PDF (702K)
THEORY AND ALGORITHMS OF THE LAGUERRE TRANSFORM, PART II: ALGORITHM

Ushio Sumita, Masaaki Kijima

Article type: Article
1991 Volume 34 Issue 4 Pages 449-477
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

The Laguerre transform developed by Keilson, Nunn and Sumita ( 1979, 1981, 1981) provides an algorithmic framework for the computer evaluation of repeated combinations of various continuum operations such as multiple convolutions, integration, differentiation, and multiplication by polynomials. In the previous survey paper (1988), we summarize theoretical results on the Laguerre transform obtained up to date. Following the theoretical summary, the aim of this paper is to discuss the operational characters of the Laguerre transform when actually using it in applications. The two summary papers will enable the reader to use the Laguerre transform with ease.

View full abstract

Download PDF (1702K)
[title in Japanese]

Article type: Appendix
1991 Volume 34 Issue 4 Pages 478-480
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Download PDF (172K)
[title in Japanese]

Article type: Appendix
1991 Volume 34 Issue 4 Pages 481-
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Download PDF (35K)
[title in Japanese]

Article type: Index
1991 Volume 34 Issue 4 Pages 482-
Published: 1991
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Download PDF (48K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (207K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (134K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (134K)

Register with J-STAGE for free!