Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
1979 Volume 22 Issue 3 Pages Cover7-
Published: 1979
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.22.Cover7

JOURNAL FREE ACCESS

Download PDF (66K)
[title in Japanese]

Article type: Appendix
1979 Volume 22 Issue 3 Pages App5-
Published: 1979
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.22.App5

JOURNAL FREE ACCESS

Download PDF (103K)
A NOTE ON IDLE TIME POLICY WITH REPAIR

Yoshio Tabata

Article type: Article
1979 Volume 22 Issue 3 Pages 169-184
Published: 1979
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

The present paper considers a system in which components stochastically deteriorate with age. When the component fails, it is repaired with a specified repair time distribution or left as it is until the next planned replacement opportunity. As a result of this action, an idle time occurs and the cost is incurred during the idle time. The optimal policy which minimizes the total expected cost is derived and the critical point in time to distinguish the above two actions is found by the method of dynamic programming. Some simple examples are discussed to illustrate our model.

View full abstract

Download PDF (696K)
OPTIMAL INSTALLATION OF SEVERAL RELATED EQUIPMENT WITH CONVERSION POSSIBILITY

Chan Onn Fong

Article type: Article
1979 Volume 22 Issue 3 Pages 185-204
Published: 1979
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

The problem in which a firm has to meet the demand for the services of several distinct but related equipment over a planning horizon is considered. An equipment of one type can be converted into an equipment of the other type at some costs. Hence demands may be met by direct capacity installation (expansion) or by conversion from another type of equipment. Capacity installation and conversion costs are assumed to be concave reflecting possible economies of scale in these activities. The objective is to find a policy of capacity installations and conversions between the types of equipment such that the present value of the total installation and conversion costs is minimized. The problem is formulated and given a network representation. A dynamic programming algorithm, an extension and refinement to that developed in [2] , is then developed which can be used to solve the problem efficiently when the number of distinct equipment is not too large.

View full abstract

Download PDF (1087K)
PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES

Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine

Article type: Article
1979 Volume 22 Issue 3 Pages 205-224
Published: 1979
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Six approximation algorithms for the one-machine scheduling problem with ready and due times to minimize the maximum lateness are analyzed. The performance is measured by the relative deviation of approximate values to optimal ones. Best possible upper bounds on the worst case performance of all six algorithms are derived. The average performance is also examined by solving randomly generated problems; one of the six algorithms outperforms others and keeps the average relative deviation within 2%.

View full abstract

Download PDF (1082K)
ON THE EXISTENCE OF THE CORE OF A CHARACTERISTIC FUNCTION GAME WITH ORDINAL PREFERENCES

Shin Ishikawa, Kenjiro Nakamura

Article type: Article
1979 Volume 22 Issue 3 Pages 225-232
Published: 1979
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Nakamura establishes a theorem which gives necessary conditions for a simple game with ordinal preferences to have a nonempty core. The conditions are also sufficient, if the set of alternative outcomes is finite. In the present paper, we will show that Nakamura's method of the proof of this theorem makes it possible to generalize the theorem to an arbitrary characteristic function game with ordinal preferences.

View full abstract

Download PDF (436K)
AN ALGORITHM FOR A PARTIALLY CHANCE-CONSTRAINED E-MODEL

Hiroaki Ishii, Shogo Shiode, Toshio Nishida, Katsurou Iguchi

Article type: Article
1979 Volume 22 Issue 3 Pages 233-256
Published: 1979
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper considers an E-model having a random linear inequality constraint and provides an algorithm for solving it. An original problem P is first transformed into deterministric equivalent problem P'. For solving P', a subsidiary problem P (μ) with a parameter p is defined. The dual-like relation between P and P (μ) is clarified. Then an algorithm for solving P (μ) is proposed. This algorithm is based on the parametric quadratic programming technique. Next fully utilizing this algorithm for P (μ), main algorithm is constructed. Finally, applicability of the above dual-like relation to other nonlinear problems is suggested.

View full abstract

Download PDF (898K)
[title in Japanese]

Article type: Appendix
1979 Volume 22 Issue 3 Pages App6-
Published: 1979
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.22.App6

JOURNAL FREE ACCESS

Download PDF (138K)
[title in Japanese]

Article type: Cover
1979 Volume 22 Issue 3 Pages Cover8-
Published: 1979
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.22.Cover8

JOURNAL FREE ACCESS

Download PDF (56K)
[title in Japanese]

Article type: Cover
1979 Volume 22 Issue 3 Pages Cover9-
Published: 1979
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.22.Cover9

JOURNAL FREE ACCESS

Download PDF (56K)

Register with J-STAGE for free!