Journal of Japan Industrial Management Association
Online ISSN : 2187-9079
Print ISSN : 1342-2618
ISSN-L : 1342-2618
Volume 51 , Issue 6
Showing 1-17 articles out of 17 articles from the selected issue
  • Type: Cover
    2001 Volume 51 Issue 6 Pages Cover11-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1138K)
  • Type: Cover
    2001 Volume 51 Issue 6 Pages Cover12-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1138K)
  • Type: Index
    2001 Volume 51 Issue 6 Pages Toc6-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (48K)
  • Type: Appendix
    2001 Volume 51 Issue 6 Pages 529-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (95K)
  • Type: Appendix
    2001 Volume 51 Issue 6 Pages 530-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (63K)
  • Kouji HISADA, Kyouko WATAKABE, Jun'ichi KOBAYASHI, Ikuo ARIZONO
    Type: Article
    2001 Volume 51 Issue 6 Pages 531-537
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The Weibull distribution indexed by scale and shape parameters is generally employed as the distribution of lifetime. In the existing reliability tests for assuring the mean time to failure (MTTF) in the Weibull distribution, it is assumed that the shape parameter of the acceptable distribution is known and corresponds with the shape parameter of the rejectable distribution. Then, it is no exaggeration say that the existing reliability tests for assuring MTTF is concerned with the scale parameter only. However, it may be considered that there is a difference between the shape parameter in acceptable distribution and that in rejectable distribution, and that the shape parameters are respectively specified as interval estimates. Therefore, the purpose of this article is to propose a new procedure for designing the reliability tests for assuring MTTF in the case that the shape parameters do not necessarily coincide with acceptable and rejectable distributions, and are specified as the interval.
    Download PDF (699K)
  • Tetsuo YAMADA, Masayuki MATSUI
    Type: Article
    2001 Volume 51 Issue 6 Pages 538-549
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Assembly factories often consist of multiple production stations connected by conveyors to transport and store materials. In assembly manufacturing, among systems using conveyors, there are two major types of array for unit stations : the line type and the flexible type, and they differ in material flows of processed and overflowed items. The former system is known as Assembly Line Systems (ALS), in which each station has the two cases with and without stoppers. This paper focuses on the case without stoppers, considers the design problem as a coordination problem between unit stations (Generalized CSPSs) by using the station-centered approach, and proposes a 2-Stage Design Method for integrating the line balancing and stochastic buffer design problems. In this method, the preliminary stage is to set an initial value for the cycle time given the number of stations, production planning quantity and production planning period. The first stage is to decide the economic cycle time for minimizing the total expected operating cost. The second stage is to decide the economic buffers for minimizing the total expected operating cost under the economic cycle time, and the first and second stages are repeated till the minimal cost is attained. First, we consider the station-centered vs. system-centered approach to the ALS without stoppers, and show the effectiveness of the former. Next, the 2-Stage Design Method by that approach is proposed, and the merits are shown by an optimal design example. In addition, generalizations about the given cycle time and finite working zone are numerically discussed.
    Download PDF (1216K)
  • De-bi TSAO
    Type: Article
    2001 Volume 51 Issue 6 Pages 550-557
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    We deal with an arborescent inventory system consisting of one central warehouse and m branch warehouse in this paper. The central warehouse places orders once every cycle with fixed cycle length CL, and the branch warehouse has two oppertunities to receive inventory replenishment from the central warehouse in each cycle. The central warehouse ships out most of its inventory at the begining of each cycle, while retaining total safety stocks at the central warehouse. Demands in each period in each branch warehouse are independent, and follow normal distribution. Due to the fact that deviation of demand in a longer period is larger than that in a shorter period, inventory imbalance in the longer period is more serious than that in the shorter period. To correct imbalance of inventories in branch warehouses, the central warehouse allocates the centralized safety stocks to proper branch warehouses at a proper instance in each cycle. Giving the allocation instance of the centralized safety stocks, we derive a calculation function of system ship-up-to-level and the centralized safety stocks. On the other hand, given the system ship-up-to-level and the centralized safety stocks, the optimal allocation instance of the centralized safety stocks is calculated. The proposed model is evaluated by comparing average inventory level with a traditional two-phase push control inventory system.
    Download PDF (793K)
  • Jun USUKI, Masatoshi KITAOKA
    Type: Article
    2001 Volume 51 Issue 6 Pages 558-565
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Cumulative curve is a method that is used for the analysis and improvement of production systems. The cumulative curve consists of accumulated input curve and output curve. Inventory is shown as a vertical interval between the input and output curve. And lead time is shown as a horizontal interval between the input and output curve. The number of research papers on mathematical analytic technique of the cumulative curve are very few. The mathematical analysis of the cumulative curve needs information about the start time to measure time series data. So, this paper proposes a method for classifying the expression of cumulative curves from information on inventory quantity and production quantity in measurement of the start time. Production conditions analyzed here are the case in which the production is newly started and the case in which the production is carried out under conditions that were continued as is. This classification is helpful to analyze cumulative curves mathematically using a gray theory. A Gray theory developed by Deng Ju Long in China and has been targeted for the field of automatic control. The theory uses a GM model with accumulated value of time series. The CM model is used to show and predict time series with parameters of a differential equation model. So, next is shown the method to accumulate time series for a gray theory by the classifications. And, an average lead time can be shown as an accumulated value of daily inventory divided by an accumulated value of daily output. Until now, mathematical proof of this theory has not been produced. So, finally, in this paper the mathematical proof is given by the classifications.
    Download PDF (777K)
  • Kenshi MORIKAWA, Kazuko MORIZAWA, Hiroyuki NAGASAWA
    Type: Article
    2001 Volume 51 Issue 6 Pages 566-573
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    A heuristic method in two-objective, parallel machine scheduling to minimize both the expected value and variance of total flow time is proposed for generating a set of nondominated schedules efficiently. A schedule to minimize the variance of total flow time does not always minimize the expected value of total flow time, as long as the coefficient of variance of processing time for any job is not the same. If a preference structure of the decision maker is strictly monotone in each objective function value, then a preferred schedule is included in the set of nondominated schedules. Therefore, finding the set of nondominated schedules is crucial for selecting the final preferred schedule. Jung et al. (1991) proposed an efficient heuristic method for generating a set of nondominated schedules for a single-machine, two-objective scheduling problem, and Nagasawa and Chue (1998) extended it to a parallel-machine, two-objective scheduling problem. However, in the latter case, a lot of job-assignments should be investigated and the existing method can not be applied to a large-sized problem with more than 20 jobs even in the two-machine case. The key technique used in the proposed method is an algorithm for finding the one promising job-assignment under which we can generate both a schedule to minimize the expected value of total flow time and a schedule to minimize the variance of total flow time. Using such a job assignment, we can derive an optimal schedule to minimize each objective function individually and a set of nondominated schedules very close to the true nondominated schedules efficiently. We implemented some numerical experiments to examine the performance of the proposed method by comparing it with an implicit enumeration method and a random sampling method of sampling 10000 job-assignments randomly, showing that the proposed method can generate a set of nondominated schedules for a large-sized problem with more than two parallel machines efficiently with high accuracy.
    Download PDF (867K)
  • Nobuyuki TAMURA, Masao MORI
    Type: Article
    2001 Volume 51 Issue 6 Pages 574-586
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In this paper we consider a Markovian deterioration system with geometrically decreasing lifetime and study a sequential inspection strategy. Our objective is to provide an iterative algorithm to derive an optimal inspection policy that minimizes the expected total long-run average cost per-unit time. We show that as the degree of the deterioration increases, the optimal time interval between two successive inspections becomes shorter and shorter and a control limit rule holds. Also we numerically investigate several properties related to the optimal policy when the number of repairs increases.
    Download PDF (1120K)
  • Hironori FUJITA, Sennosuke KURIYAMA, Toyokazu NOSE, Sadaya KUBO
    Type: Article
    2001 Volume 51 Issue 6 Pages 587-593
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The popularization of the Internet and the web page in a network society brought us the possibility of a new form of communication. Such web pages will be utilized not only for the personal communication, but also for the advertisements in enterprises. With this research, we discuss the effects of advertisement and analyse how to make better web pages on the basis of "Marketing in Hypermedia Computer-Mediated Environments (CMEs) : conceptual foundations" by Donna L.Hoffman, Thomas P.Novak, et al.. Furthermore the remarkable points which should be considered when we design a web page are made clear as follows : 1) As an evaluation of the web page, a model of the user's interest in the web page is formulated. 2) In order to discuss and obtain the degree of interest in web pages, we divided the interest factors into 2 kinds, namely a skill degree factor and a specialist degree factor, derived and further necessary factors to be considered in each field. 3) Moreover, the effectiveness of the proposed theory was proved by a questionnaire survey.
    Download PDF (687K)
  • Tetsuo YAMADA, Masayuki MATSUI
    Type: Article
    2001 Volume 51 Issue 6 Pages 594-602
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In assembly systems, there are two major types of array of unit stations : the line type (ALS) and the flexible type (FAS). Using a unified approach (Yamada and Matsui, 1997,1999), this paper discusses a stochastic design problem of the ALS with stoppers which prevent the overflow of items. First, the objective function for the station-centered approach is considered. A simple case of D/M/1 type by queueing approach and a typical case of D/E_k/1 type by simulation are introduced, and the 3-station case is considered by comparing the two cases of balking and blocking. Next, the 2-stage design procedure for the ALS with stoppers is presented, and the two cases of ALS with and without stoppers are unified. Finally, an optimal design example is shown by applying this procedure, and the two cases are compared numerically.
    Download PDF (737K)
  • Masahiro ARAKAWA, Masahiko FUYUKI, Hiroki NAKANISHI, Ichiro INOUE
    Type: Article
    2001 Volume 51 Issue 6 Pages 603-612
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    When tardy jobs are involved in a production schedule, an improved schedule is sought for to eliminate tardy jobs under the given available capacities. When the occurrence of a tardy job is judged to be inevitable, the reduction of tardy job is attempted by increasing resource capacities within the allowances granted by the upper-level planning department. However, it is generally difficult to decide the capacities when, to which machine and what amount, to add so as to minimize of the number of tardy jobs after suppressing the added amount of the capacity. In this paper, a systematic simulation-based method for capacity adjustments is proposed which applies the Parameter Space Search Improvement method to the determination of additional capacities. Two parameters are introduced to span the parameter space. One parameter is used to control the total amount of adding capacities, and another parameter to control the distribution of capacities among resources. The best capacity adjustment plan is sought for on the parameter space. In the proposed procedure, the resource utilization under the given (initial) planning condition is first investigated in order to setup the relationship between the parameters and the variables which decide the amount of capacity addition to each resource. As many production schedules as the possible combination of capacity adjustment plans are then generated by the simulation-based scheduling method, and incorporating the cutting off of redundant capacities, the capacity adjustment plan which gives the schedule with the minimum number of tardy jobs is selected as the best capacity adjustment plan. The practical usefulness of the proposed method is demonstrated by using scheduling condition data on a practical large-scale system.
    Download PDF (1310K)
  • Type: Index
    2001 Volume 51 Issue 6 Pages 613-614
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (202K)
  • Type: Index
    2001 Volume 51 Issue 6 Pages 615-619
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (296K)
  • Type: Appendix
    2001 Volume 51 Issue 6 Pages App6-
    Published: February 15, 2001
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (71K)
feedback
Top