Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Search
Advanced search
OR
Browse
Search
Volume 24, Issue 3
Displaying 1-11 of 11 articles from this issue
Show all abstracts
    • |<
    • <
    • 1
    • >
    • >|
  • [title in Japanese]
    Article type: Cover
    1981 Volume 24 Issue 3 Pages Cover7-
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.Cover7
    JOURNAL FREE ACCESS
    Download PDF (155K)
  • [title in Japanese]
    Article type: Appendix
    1981 Volume 24 Issue 3 Pages App5-
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.App5
    JOURNAL FREE ACCESS
    Download PDF (120K)
  • ADAPTIVE SEARCH AND STOP WITH UNCERTAIN SENSOR CAPABILITY
    Takashi Kishi, Kuniaki Tatsuno
    Article type: Article
    1981 Volume 24 Issue 3 Pages 189-201
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.189
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    A search and stop problem is studied where the detection capability of the search sensor as well as existence of the object in the given area is assumed uncertain. Two stopping rules based on the posterior probability of the object being in the area are examined. Our particular concern is to evaluate the effectiveness of utilizing "dummies" to obtain extra information which is expected to give us better estimate of the posterior distribution of the sensor capability. The efficiency of two rules are compared numerically, and some interesting results are obtained.
    View full abstract
    Download PDF (642K)
  • A SEQUENTIAL ALLOCATION PROBLEM WITH PERISHABLE GOODS
    Tsuneyuki Namekata, Yoshio Tabata, Toshio Nishida
    Article type: Article
    1981 Volume 24 Issue 3 Pages 202-212
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.202
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    A decision maker will allocate his goods to appearing customers during the given periods. There are finite types of customers. Each type of customer appears with a given probability at the beginning of each period. When the customer appears, the decision maker sells some of his goods to acquire the expected reward which depends on the number of goods sold and the type of appearing customer. Unsold goods at the end of each period perish at the beginning of next period with some probability. The objective is to find a sequence of optimal number of goods to be sold which maximizes the total expected reward. Some properties of an optimal policy are investigated and some simple examples are presented.
    View full abstract
    Download PDF (554K)
  • A SUMMARY OF PERIODIC REPLACEMENT WITH MINIMAL REPAIR AT FAILURE
    Toshio Nakagawa
    Article type: Article
    1981 Volume 24 Issue 3 Pages 213-228
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.213
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    Several periodic replacement policies with minimal repair at failures are summarized: 1) A policy for a unit with random and wearout failures. 2) Two modified policies where if a failure occurs just before the replacement time, then (i) a unit remains failed, (ii) a unit is replaced by a new one. 3) Three imperfect preventive maintenance (pm) policies where (i) a unit after pm has the same failure rate as before pm with a certain probability, (ii) the age of a unit becomes x units of time younger at pm, (iii) the age of a unit after pm reduces to at at pm. Expected cost rates for each model are obtained and optimum policies are discussed. Some examples for the above models are presented.
    View full abstract
    Download PDF (753K)
  • THE INTERCHANGEABILITY OF THE SOJOURN AND DELAY TIMES IN A GI/M/1→/M/1 (O) QUEUE
    Genji Yamazaki
    Article type: Article
    1981 Volume 24 Issue 3 Pages 229-236
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.229
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This paper is concerned with a system of two queues in tandem where each queue has a single exponential server. The rates. of the servers may differ. The first queue has an infinite waiting room, whereas the second queue has no waiting room. Initially the system is empty. Customers enter the first queue according to a renewal input process, and then pass through the second queue. We are concerned with the sojourn time of a customer in the system. We show that the queues are interchange-able, in the sense that the order of queues does not affect the sojourn and delay distributions.
    View full abstract
    Download PDF (368K)
  • THE EFFICIENCY OF TWO-STAGE LINE
    Toshirou Iyama
    Article type: Article
    1981 Volume 24 Issue 3 Pages 237-257
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.237
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This paper considers a two-stage parallel line in which one of stages has a station with an arbitrary operation time but the other stage has S stations with exponential operation times. First, the procedure to estimate the production rate is studied and the relation between the dual models is discussed. Next, the effect of the number of stations is evaluated by the imaginary buffer capacity. Consequently it is represented that this imaginary capacity has a linear asymptote and that this asymptote is obtained by the simple procedure and is very useful to evaluate the effect of the number of stations.
    View full abstract
    Download PDF (882K)
  • AN EVALUATION METHOD FOR REGIONAL SALES POWER OF MASS-PRODUCED GOODS AND ITS APPLICATIONS
    Masataka KATSUMURA
    Article type: Article
    1981 Volume 24 Issue 3 Pages 258-276
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.258
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This paper presents a method to evaluate "legional sales power" of mass-produced goods, which is the basis for regional marketing planning in manufacturing companies. The regional sales power of a product is defined as the composite of the regional market share of the product of a company and the regional growth potential of the company's product, the latter being the change in the regional market share of the product between two points in time. Unlike the conventional methods of sales power estimation such as market research, the proposed method applies a simple but robust algorithm to data readily obtainable within the company, together with statistical data supplied by public agencies. The input data are mainly (i) regional sales of the company's product, and (ii) a market index to represent the market size of the product category in each sales region. Different procedures are constructed depending on the availability of estimates of the total market share of the company. The method is based on comparison of the regional market index with the regional sales data. This simple comparison is extended, via mathematical analysis, to estimate regional market share. Together with the evaluation of the regional growth potential based on the concept of time series, the estimation of regional market share facilitates quantitative analysis in marketing planning. The method has already been applied to a number of products and the procedures and results are easily understood by businessmen with non-mathematical backgrounds. The time and cost for the analysis are greatly reduced compared to conventional analytical methods.
    View full abstract
    Download PDF (1314K)
  • ROUTING A VEHICLE WITH THE LIMITATION OF FUEL
    Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida
    Article type: Article
    1981 Volume 24 Issue 3 Pages 277-281
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.277
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    The paper considers the problem of routing a vehicle with the limitation of fuel. The optimal route is a shortest path along which a vehicle can pass through a network, visiting some refueling vertices on the way for fear of running out of fuel. An efficient algorithm for it is presented whose computational complexity is 0 (pn^2) where n is the number of vertices in a network and p is that of refueling vertices.
    View full abstract
    Download PDF (271K)
  • [title in Japanese]
    Article type: Appendix
    1981 Volume 24 Issue 3 Pages App6-
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.App6
    JOURNAL FREE ACCESS
    Download PDF (167K)
  • [title in Japanese]
    Article type: Cover
    1981 Volume 24 Issue 3 Pages Cover8-
    Published: 1981
    Released on J-STAGE: June 27, 2017
    DOIhttps://doi.org/10.15807/jorsj.24.Cover8
    JOURNAL FREE ACCESS
    Download PDF (78K)
    • |<
    • <
    • 1
    • >
    • >|
feedback
 Top