Journal of the Operations Research Society of Japan

[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (122K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (119K)
BILL OF MATERIALS PROCESSOR BY LINEAR PROGRAMMING

Toshinori WATANABE, Youichi SETO, Koji SASAKI

Article type: Article
1982 Volume 25 Issue 4 Pages 323-333
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

To cope with demand diversification and shortening of demand lead time, parts oriented production systems in which common parts are assembled to meet final products demand have come to be emphasized. To realize parts oriented production systems, the mechanism to calculate parts requirement from the production plan of final products must be established. For this purpose, BMP (Bill of Materials Processor) is used. Conventional BMP is the tree form representation of the connections between final products and it's parts or materials. By specifying. g the volume of final products, parts or materials required are exploded. But under conventional BMP, analysis of the uncertainty of parts requirement under uncertain final products volume cannot be realized. Further the inverse problem of final product product-ion planning under supply limit on parts cannot be realized. To reduce these difficulties of the conventional BMP, a new method is proposed in this paper. In this method, relations between final product and it's parts are described by a set of linear equations, and by using linear programming, parts requirement are analized. By introducing the variational RHS (Right Hand Side) to represent the final products uncertainty and using parametric approach, parts explosion under uncertainty can be realized. Conversely, the inverse problem of final product production planning can also be realized by solving a linear programming problem which optimizes the final products production plan under supply limit on parts or materials.

View full abstract

Download PDF (812K)
MULTI-VARIATE STOPPING PROBLEMS WITH A MONOTONE RULE

Masami Yasuda, Junichi Nakagami, Masami Kurano

Article type: Article
1982 Volume 25 Issue 4 Pages 334-350
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

A monotone rule is introduced to sum up individual declarations in a multi-variate stopping problem. The rule is defined by a monotone logical function and is equivalent to the winning class of Kadane. This paper generalizes the previous works on a majority rule. The existence of an equilibrium stopping strategy and the associated gain are discussed for the finite and infinite horizon cases.

View full abstract

Download PDF (840K)
SEMI-MARKOV DECISION PROCESSES WITH INCOMPLETE STATE OBSERVATION : DISCOUNTED COST CRITERION

Kazuyoshi Wakuta

Article type: Article
1982 Volume 25 Issue 4 Pages 351-362
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we study semi-Markov decision processes with the incomplete state observation under the discounted cost criterion. We show that this model can be transformed to ordinary semi-Markov decision processes. Furthermore, we show that if the action space is countable, the optimal value function is Borel measurable and satisfies the optimality equation and that if the action space is finite, there exists an optimal stationary I-policy.

View full abstract

Download PDF (548K)
ILA STOPPING RULES FOR A SEARCH WITH UNCERTAIN SENSOR CAPABILITY

Kuniaki Tatsuno, Takasi Kisi

Article type: Article
1982 Volume 25 Issue 4 Pages 363-375
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Infinitesimal look-ahead stopping rules are discussed when the detection capability of a search sensor as well as the existence of an object in a given area for search is not known with certainty. We attempt to utilize "dummies" to obtain extra information which is expected to give us better estimate of the detection capability of the sensor. Stopping rules are investigated for two different criteria; that is, maximizing the expected net return and minimizing the expected search time subject to the condition that the preassigned detection probability of the object is ensured. We first show a sufficient condition under which an infinitesimal look-ahead stopping rule is optimal in the case of the expected net-value criterion. Second, we show that under the above condition, an optimal stopping rule for the expected search-time criterion has the same structure as the expected net-value case. Finally, we discuss the efficiency of utilizing "dummies" by numerical examples.

View full abstract

Download PDF (647K)
BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK

Azuma Taguchi

Article type: Article
1982 Volume 25 Issue 4 Pages 376-389
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

The sensitivity of a OD travel cost to changes in a flow through a new branch in the user optimizing assignment problem for a single commodity two-terminal transportation network is studied. The assignment problem and its dual are formulated as convex programming problems. Using these formulations, an intuitive characterization is derived for such paradoxical phenomenon that the creation of a new branch has the effect of increasing the OD travel cost.

View full abstract

Download PDF (650K)
A PLANNING HORIZON THEOREM AND OPTIMAL ORDERING POLICIES IN THE CASE WHERE DEMAND RATE VARIES ONCE OVER A FINITE PLANNING HORIZON

Zentaro NAKAMURA, Akira NIWA, Ichiei WATANABE

Article type: Article
1982 Volume 25 Issue 4 Pages 390-406
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper deals with the continous review lot sizing problem in the case where demand rate varies once over a finite planning horizon. In the case of demand rate varing once over a finite planning horizon, relationship between demand rate prior to the demand turning point and the after affects the selection of the optimal ordering policies. This paper shows that information concerning the location of the demand turning point and optimal number of deliveries in the periods prior to and after the demand turning point can effectively be used to determine optimal ordering policies. It presents a planning horizon theorem which assures the condition under which the planning period can be separated into two independent subperiods at the demand turning point.

View full abstract

Download PDF (852K)
[title in Japanese]

Article type: Index
1982 Volume 25 Issue 4 Pages 407-408
Published: 1982
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Download PDF (90K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (154K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (75K)
[title in Japanese]

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

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

JOURNAL FREE ACCESS

Download PDF (75K)

Register with J-STAGE for free!