Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Volume 22, Issue 1
Displaying 1-10 of 10 articles from this issue
  • Article type: Cover
    1979 Volume 22 Issue 1 Pages Cover1-
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (66K)
  • Article type: Appendix
    1979 Volume 22 Issue 1 Pages App1-
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (104K)
  • Tadashi Kurisu
    Article type: Article
    1979 Volume 22 Issue 1 Pages 1-15
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This paper deals with the problem of sequencing n jobs on a single machine. Associated with each job is its processing time and its deferral rate. In addition, a general precedence relation exists among jobs. The problem is to find the job sequence which is consistent with the precedence relation so as to minimize the sum of the deferral cost. This problem has been considered by Sidney, and he has presented a decomposition aigorithm. In this paper, it is shown that Sidney's algorithm is not effective for some cases. A new algorithm is presented and it is proved that the algorithm produces an optimal sequence. An illustrative example is shown in the final section.
    Download PDF (643K)
  • Tsuneyuki Namekata, Yoshio Tabata, Toshio Nishida
    Article type: Article
    1979 Volume 22 Issue 1 Pages 16-28
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    A whaler has some harpoons available for catching whales and finite number of periods to go. The whales are of two kinds, type I and type 2; type I needs to be hit by the given number of harpoons in order to be caught by the whaler, whereas type 2 needs to be hit by one harpoon. Each type appears with a known probability at each period and produces its reward. When meeting the whale, he can expend, simultaneously, some harpoons of his to obtain the reward. The probability of hit is known to the whaler. The objective is to find the sequence of optimal number of harpoons which maximizes the total expected reward. We investigate the structure of optimal policy.
    Download PDF (728K)
  • Junichi Nakagami
    Article type: Article
    1979 Volume 22 Issue 1 Pages 29-40
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This note considers the dynamic inventory problem in which the perishable product is to be stored in two types of warehouses. The problem is that how much amount of the product is ordered and preserved subject to the future demands. Hence the optimal ordering and preserving policies are obtained recursively with structural properties of the solution. Also the infinite horizon case is derived.
    Download PDF (567K)
  • Toshikazu Kimura, Katsuhisa Ohno, Hisashi Mine
    Article type: Article
    1979 Volume 22 Issue 1 Pages 41-68
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    A GI/G/1 queueing system with finite capacity is studied. The first overflow time, which means the time when the number of customers first exceeds the capacity, is analyzed by diffusion approximation. Approximate expressions for the distribution and moments of the first overflow time are derived explicitly. These results are modified so as to be more accurate for an M/G/1 system or a system with small capacity. Further these results are applied to the analysis of the maximum number of customers up to time t in a GI/G/1 system with infinite capacity. Finally, the accuracy of the diffusion approximations is examined numerically by using the analytical results for a GI/M/1 system.
    Download PDF (1308K)
  • Kazuyuki Suzuki
    Article type: Article
    1979 Volume 22 Issue 1 Pages 69-83
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    A monitored system consists of a core system and its monitor. A core system follows a general life time distribution, but its state, good or not good, cannot be observed directly. In order to infer the state of the core system, we use the information from the monitor whose states are stochastically related to the states of the core system. Using its information, we make the maintenance policy for the core system so as to minimize the total expected cost incurred by a sequence of actions. This paper shows the conditions under which an optimal maintenance policy for the above model has the form of a control limit policy. Also, a numerical example where the life time of the system follows a Weibull distubution is presented.
    Download PDF (716K)
  • Article type: Appendix
    1979 Volume 22 Issue 1 Pages App2-
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (165K)
  • Article type: Cover
    1979 Volume 22 Issue 1 Pages Cover2-
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (51K)
  • Article type: Cover
    1979 Volume 22 Issue 1 Pages Cover3-
    Published: 1979
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (51K)
feedback
Top