Journal of Japan Industrial Management Association
Online ISSN : 2187-9079
Print ISSN : 1342-2618
ISSN-L : 1342-2618
Volume 47 , Issue 6
Showing 1-21 articles out of 21 articles from the selected issue
  • Type: Cover
    1997 Volume 47 Issue 6 Pages Cover7-
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (50K)
  • Type: Cover
    1997 Volume 47 Issue 6 Pages Cover8-
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (50K)
  • Type: Index
    1997 Volume 47 Issue 6 Pages Toc4-
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (61K)
  • Shuji NISHI, Takao OHKUBO
    Type: Article
    1997 Volume 47 Issue 6 Pages 327-334
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Pilots get most of their flight information by visual scanning. The right arm is used for the control stick. The effects of individual differences on flight performance, visual scanning and electromyogram (EMG) during basic flight maneuvers are described. As the result of this study, individual differences did not influence the results of flight performance except standard deviation of pitch angle and mean pitch rate, but did effect the EMG and visual scanning. It was revealed that information acquisition and muscle control during flight were clearly influenced by individual differences even if the similar performance levels were shown.
    Download PDF (1196K)
  • Makoto ASANO, Hiroshi. OHTA
    Type: Article
    1997 Volume 47 Issue 6 Pages 335-343
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper considers a single machine scheduling problem with ready and due times constraints on jobs, shutdown constraints on the machine and sequence dependent setup times. Shutdown is a disruptive event such as holiday or machine maintenance, and has a prespecified period when the machine will be interrupted. Shutdown must be a constraint for scheduling if no preemption is allowed for the jobs. An optimization algorithm based on the branch-and-bound method is developed to minimize the maximum tardiness for the problem. In practice, suitable actions such as instructions of holiday work and deferment of machine maintenance will be taken to meet due times as possible. Another scheduling algorithm deferring shutdowns on keeping shutdown times is also developed to decrease the obtained min-max tardiness. The algorithm can be performed many times further to decrease the min-max tardiness and will enable production managers effectively to determine the objective schedule to meet due times as possible.
    Download PDF (969K)
  • Taichi KAJI
    Type: Article
    1997 Volume 47 Issue 6 Pages 344-350
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    We think about the problem to assign the elements to an ordered sequence of stations such that the precedence relationships are satisfied. This problem can be shown as a problem for sequential partitions of the nodes of a directed acyclic graph into subsets. We describe an efficient exact algorithm that can be used to reduce computational requirements and, possibly storage. And, we presents approximation algorithm using the tabu search approach with effective neighbourhood structure, that is effective in obtaining near-optimal solutions to this problem. The running time of the procedure is proportional to the number of nodes in the graph.
    Download PDF (810K)
  • Masatake SAITO, Yasuo KUSAKA, Masashige TSUJI
    Type: Article
    1997 Volume 47 Issue 6 Pages 351-358
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    A market-corresponding and quick product's development is required for a company because of a reduction of product's life cycle. Therefore, they have accepted a concurrent product's development where the first-half process (planning & design) is developed considering all the necessary items in the second-half process(manufacture of sale), in order to avoid missing oppotunities. Systematical methods and System-support are expected at present. The purpose of this study is to develop a system to support the design of a product's concept and specification. More concretely, we propose the AHP method with cost constraint, the method for product's concept abstraction and the method for reducing the GAP of senses of value between members.
    Download PDF (1171K)
  • Masahiko SUZUKI, Hitoshi TSUBONE, Masaaki OHBA, Toshifumi. UETAKE
    Type: Article
    1997 Volume 47 Issue 6 Pages 359-366
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper deals with a production scheduling problem in a two-stage hybrid flow shop. The first stage comprises one machine and the second stage comprises a number J of machines. Individual products can be assigned to only one machine at the second stage because the machines are not interchangeable. The setup is required when switching one product to another at the first stage. When the upper planning level gives the quantities of products and an available time for processing. If the quantities of products and available time for processing are given, this paper first analyzes the necessary conditions that all products can be processed within an available processing time. Second it formulates machine utility at the first stage, an initial inventory level of final products which can prevent from shortage for market demands, and the relationship between inventory levels of final products and work-in-process level. Finally we clarify that number of setup and sequencing rules will affect the manufacturing performance
    Download PDF (851K)
  • Ikuo ARIZONO, Shigeru KATSUYAMA, Hiroshi OHTA
    Type: Article
    1997 Volume 47 Issue 6 Pages 367-372
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper deals with the null hypothesis test for homogeneity of two normal populations. The likelihood ratio test is a usual method for such a test. It is well-known that the distribution of the log-likelihood ratio statistics as the test statistics in likelihood ratio test is asymptotically explained based on the chi-square distribution with 2 degrees of freedom under the null hypothesis as sample size tends to infinity. Therefore, the null hypothesis test for homogeneity of two normal populations is generally designed based on the asymptotic chi-square distribution. However, when sample size is not sufficiently large, the accuracy of the approximation based on the asymptotic chi-square distribution is not necessarily assured. In this paper, the stochastic properties of the log-likelihood ratio statistics for homogeneity of two normal populations are investigated. Furthermore, we consider the null hypothesis test for homogeneity of two normal populations with high accuracy in the case that sample size is not sufficiently large, that is, small.
    Download PDF (582K)
  • Takao HADA, Hisatoshi SUZUKI
    Type: Article
    1997 Volume 47 Issue 6 Pages 373-383
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The problem to divide many objects into k(k≧2) groups according to the similarity among objects is called the homogeneous clustering problem. In this study, the above problem with side resource constraints is called a resource constrained grouping problem (G) and discussed. First, the problem is formulated as a 0-1 integer programming problem and its several applications are mentioned. After presenting a simple solution method of its Lagrangean relaxation problem to determine a lower bound, effectiveness of the branch and bound method with the above lower bound is verified through some computational experiments. Finally, a strong lower bound of (G) using valid inequality is explained.
    Download PDF (1051K)
  • Takashi OHTANI, Hidetomo ICHIHASHI, Kazunori NAGASAKA, Tetsuya MIYOSHI
    Type: Article
    1997 Volume 47 Issue 6 Pages 384-392
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    An adaptive learning network has been proposed, in which the Radial Basis Functions networks were applied to the partial descriptions of network type GMDH. In this paper, we derive a leaning rule by formulating on optimization problem, and report on results of simulation studies about its ability to approximate nonlinear mappings. The first two examples use synthetic data generated by nonlinear functions and chaotic time series from the Mackey-Glass differential delay equation respectively. The results are compared with those of the multi-layered neural network (MNN) and the tree structured adaptive learning network (A-Tree). Furthermore a benchmark test for classification performance is implemented with R.Fisher's Iris data.
    Download PDF (1008K)
  • Katsuhiko KOSHIISHI, Hiromitsu NOMURA
    Type: Article
    1997 Volume 47 Issue 6 Pages 393-401
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    FMS (Flexible Manufacturing Systems) have been modelled mostly as closed queueing networks. Most of these models have been assumed FCFS (First Come First Served) or static priority service discipline at station. In static priority service discipline, the priority of job is a fixed quantity independent of waiting time and denotes the priority of the particular class to which the job belongs. Sometimes, in such case low priority classes of job are not selected for service. In this paper, a nonpreemptive dynamic priority service discipline in which the priority increases with actual waiting time in the queue is used by the station. This service discipline will control system performance by altering parameters of function that define the priority of job. We present an approximate solution method by recursive calculation to give mean waiting time in the queue of each job class, and show that its solution is valid.
    Download PDF (855K)
  • Katsuhiko TAKAHASHI, Nobuto NAKAMURA
    Type: Article
    1997 Volume 47 Issue 6 Pages 402-411
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The number of Kanbans has much influence upon the performance of the Kanban systems, and the performance must be estimated via simulation except for the limited conditions of demand and production. Therefore in this paper, a simulation-based algorithm for determining the number of Kanbans is proposed. In order to minimize the mean work-in-process inventories by satisfying the requirement for the mean waiting time of demand, the proposed algorithm utilizes the secant method and the beam search method. The performance of the Kanban system under the appropriate number of Kanbans is analyzed with the proposed algorithm.
    Download PDF (1114K)
  • Toshio UENO, Takahiro SATO, Yousuke SANBAYASHI
    Type: Article
    1997 Volume 47 Issue 6 Pages 412-417
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In this study, we consider the advantage of the synthesized inventory of a product and the components based on a fixed order quantity and period system, and present the criterion of the synthesized inventory which is more economically profitable than the product-only inventory. Based on some simulations, we reveal that the synthesized inventory is more economically profitable than the product-only inventory in the following points : (1) when demand fluctuations become large, (2) when the components inventory cost is smaller than the product inventory cost and (3) when the components manufacturing lead time is longer than the product assembling lead time. Furthermore it is shown that the synthesized inventory on a fixed order quantity in more advantageous than on a fixed order period basis.
    Download PDF (632K)
  • Nozomi SATO, Yasufumi KUME
    Type: Article
    1997 Volume 47 Issue 6 Pages 418-423
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper describes the differences of awareness of occupational stressor and strain between non management track work (Ippanshoku) and management track work (Sogoushoku) in Jananese female workers. A questionnaire survey was made on 90 female workers in private corporations. The scale of general stressor consists of role conflict, role ambiguity and overwork. Additionally, gender related stressors such as differences in occupational treatment and expected gender role are measured. The effects of these stressors on the estimation of future prospect for advancement in career, job satisfaction and mental health are examined. Results suggest that the high general and gender related stressors reduce mental health and/or job satisfaction. The score of general stressor resulting from the role conflict and overwork is higher in Sogoshoku than Ippanshoku. Sogoshoku also shows the high scores on the estimation of future prospect for advancement in career, suggesting the aggressive career oriented motives. In conclusion, employers should understand the existence of these stressors for and the differences of awareness of occupational stressor and strain between Ippanshoku and Sogoushoku, as well as pay attention to mental health of female workers.
    Download PDF (671K)
  • Shigetoshi NORITAKE, Hiroshi NAKANO
    Type: Article
    1997 Volume 47 Issue 6 Pages 424-433
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Recently, simulators are often utilized to regulate design factors in manufacturing systems. But, in modern complex systems, it is hard for designers to decide them with trial and errors, so optimization algorithms are required. This paper compares eight optimization algorithms such as simulated annealing, tabu search, and genetic algorithms, to design a real tandem production line. Moreover, we propose an algorithm which mixes the simple genetic algorithm and evolution strategies. This paper illustrates computational results on comparing the above algorithms.
    Download PDF (997K)
  • Junichi IMAI
    Type: Article
    1997 Volume 47 Issue 6 Pages 434-442
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper proposes a framework for calculating both upper and lower bounds of an American option with proportional transaction costs by using binomial and trinomial lattice process. Both bounds are derived by applying no arbitrage condition. The problem to calculate the upper bound of an American option can be formulated as a convex problem. On the other hand, since the problem to calculate the lower bound could be formulated as a nonconvex problem, two heuristics are proposed to solve the lower bound practically. Using these heuristics, we investigate the effects of the transaction costs on valuation of an option by numerical examples.
    Download PDF (869K)
  • Il-Hwan HWANG
    Type: Article
    1997 Volume 47 Issue 6 Pages 443-450
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The concept of the trade-offs model was once the accepted paradigm to explain the relationships among competitive manufacturing capabilities in manufacturing strategy. Recently, however, the focus of the process theory of manufacturing strategy has moved from the trade-offs model to the cumulative model. The hypotheses obtained by the latter model provide a theoretical ground for the investment optimization in the implementation of manufacturing strategy. The objective of this article is to analyze the relationships among competitive manufacturing capabilities through a causal analysis based on the cumulative model.
    Download PDF (929K)
  • Type: Index
    1997 Volume 47 Issue 6 Pages 451-452
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (173K)
  • Type: Index
    1997 Volume 47 Issue 6 Pages 453-455
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (192K)
  • Type: Appendix
    1997 Volume 47 Issue 6 Pages App4-
    Published: February 15, 1997
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (49K)
feedback
Top