Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
1986 Volume 29 Issue 2 Pages Cover4-
Published: 1986
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.29.Cover4

JOURNAL FREE ACCESS

Download PDF (130K)
[title in Japanese]

Article type: Appendix
1986 Volume 29 Issue 2 Pages App3-
Published: 1986
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.29.App3

JOURNAL FREE ACCESS

Download PDF (140K)
SOLVING SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS BY DAVIDENKO'S METHOD

Nobuko Sagara

Article type: Article
1986 Volume 29 Issue 2 Pages 99-112
Published: 1986
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Given the data (X_i,y_i), i=1 ,2,...,m, this paper discusses a method to find the values of the linear and nonlinear parameter a and b which minimize the nonlinear functional m Σ^m_i[ Σ^p_<j=1>f_j(b,x_i)a_j - y_i]^2 over aεR^p,bεR^q where m ≧ p + q . By introducing a real parameter, this problem is imbedded into a one-parameter family of problems. Then, a method is presented for solving it by following its solution path using Davidenko's continuation methods. In the course of iterations, the original problem containing p + q + 1 variables is transformed into a problem with q + 1 nonlinear variables by taking the separable structure of the problem into account. By doing so, the new method reduces to solving a series of equations of smaller size and a considerable saving in the storage is obtained. Results of numerical experiments are reported to demonstrate the effectiveness of the proposed method.

View full abstract

Download PDF (752K)
A SEQUENTIAL EVASION-SEARCH GAME WITH A GOAL

Teruhisa Nakai

Article type: Article
1986 Volume 29 Issue 2 Pages 113-122
Published: 1986
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Infinite boxes 0, 1 , 2, ...... chooses at each period one of three decisions: to stay in the current box and to move to the nearest box either to the right or to the left. A searcher looks in any one box except box 0 which is a safe region (goal) for the evader because it is unsearchable. Two types of conditional detection probability are given, that is, one is used in the case that the evader stays and another is used in the case that he moves. It is assumed that the searcher is informed of' the evader's position at the end of each period. The evader maximizes the probability that he is not detected for given periods and the searcher minimizes it. This two-person zero-sum sequential game is solved recursively. The evader's optimal strategy indicates to run into the goal as soon as possible if his position is near the goal, to go ahead or stay if he is somewhat away from the goal, and to go back with a positive probability if he is far away from the goal.

View full abstract

Download PDF (541K)
TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

Hiroaki Ishii, Toshio Nishida

Article type: Article
1986 Volume 29 Issue 2 Pages 123-132
Published: 1986
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing of each job can be started on either machine. Of course each machine processes at most one job and each job is processed on at most one machine, simultaneously. Further it is assumed that speeds of machines A, B are controllable. In the situation, the total sum of costs associated with the maximum completion time and machine speeds is to be minimized. The problem is a generalization of two machine open shop problem in a sense that machine speeds are not fixed but variables. This paper proposes an O(n log n) algorithm which finds an optimal speed of each machine and optimal schedule.

View full abstract

Download PDF (445K)
EQUIPMENT REPLACEMENT UNDER TECHNOLOGICAL ADVANCES

Yasuo Kusaka

Article type: Article
1986 Volume 29 Issue 2 Pages 133-155
Published: 1986
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Suppose a problem of determining whether the replacement of old equipment is economical or not when new equipment with technological advances is expected to appear at each period of the equipment planning interval. Since equipment always keeps in danger of obsolescence under technological advances, the decision maker needs grasp the state of obsolescence constantly to reflect it adaptively in the present and future decisions. Especially the decision to replace now or not becomes urgent in most cases and he is much concerned with the present decision. At this time he must also consider the fact that the present decision depends on the subsequent future decisions. This paper derives a simple criterion by which it becomes easily possible in some circumstances to decide whether immediate replacement is economical or not without determining the subsequent sequence of replacement times for the planning interval. Some informations on next replacement time are presented by parametric analysis of the criterion and the upper bound number of replacement times is given for the interval. These will become a guideline for the decision maker to plan future equipment replacement. The proposed method is applied to a practical case and some characteristics are examined by sensitivity analysis. It is clarified that the method is relatively insensitive to changes of parameters at the present decision.

View full abstract

Download PDF (1203K)
A FLUID FLOW APPROXIMATION ANALYSER FOR BUFFER TYPE QUEUEING SYSTEMS

I. M. Premachandra, Hidenori Morimura

Article type: Article
1986 Volume 29 Issue 2 Pages 156-176
Published: 1986
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Queueing systems in which idle times of servers seldom occur are commonly seen in many practical areas such as manufacturing, transportation, etc. Here we call such a system buffer type queueing system. It is known that the fluid flow approximation technique is efficient in analysing such systems. This paper presents an algorithm based on this technique and a comprehensive computing tool (FFQA) which employs it. The applicability and the accuracy of FFQA are illustrated through some examples.

View full abstract

Download PDF (1016K)
[title in Japanese]

Article type: Appendix
1986 Volume 29 Issue 2 Pages App4-
Published: 1986
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.29.App4

JOURNAL FREE ACCESS

Download PDF (174K)
[title in Japanese]

Article type: Cover
1986 Volume 29 Issue 2 Pages Cover5-
Published: 1986
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.29.Cover5

JOURNAL FREE ACCESS

Download PDF (68K)
[title in Japanese]

Article type: Cover
1986 Volume 29 Issue 2 Pages Cover6-
Published: 1986
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.29.Cover6

JOURNAL FREE ACCESS

Download PDF (68K)

Register with J-STAGE for free!