-
Article type: Cover
1992 Volume 43 Issue 5 Pages
Cover1-
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Cover
1992 Volume 43 Issue 5 Pages
Cover2-
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Index
1992 Volume 43 Issue 5 Pages
Toc1-
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1992 Volume 43 Issue 5 Pages
i-6
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Hideaki KOBAYASHI, Hisashi ONARI, Yoshinao ARAI, Shino TAKAHASHI
Article type: Article
1992 Volume 43 Issue 5 Pages
315-320
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
This paper deals with an operation sequencing problem for assembly of Printed Circuit Boards which contain sequence precedence relations. A heuristic whose objective is to minimize operation time is proposed. The efficiency of this heuristic is tested, and it is shown to be nearly optimum while requiring only limited computational time. (1) Sequencing among groups of parts is solved by a branch and bound method. (2) Sequencing within a group of parts is solved by a nearest neighbour method.
View full abstract
-
Masatsugu SHIIHARA, Sennosuke KURIYAMA, Toyokazu NOSE
Article type: Article
1992 Volume 43 Issue 5 Pages
321-327
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
This paper proposes an optimal decision procedure of process order and lotsizing for multi-stage purchasing/ production systems. The procedure can minimize the total cost which is consisted of ordering, production, inventory and set-up costs. The algorithm developed is based on a DP algorithm. As a result, some numerical examples show that the optimal process order is affected by purchasing/production lotsizes, and also the effectiveness of the algorithm in CPU time characteristics.
View full abstract
-
Yoichi SEKI, Haruo MIYAZAKI
Article type: Article
1992 Volume 43 Issue 5 Pages
328-333
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
This paper is concerned with a multidimensional scaling method for data measured with rating items which have ordered categorical choices. A method which gives maximum likelihood estimation of configuration of rated objects and rating items in a latent rating space was proposed. This method has a problem concerned with computational complexity. In order to improve the problem, a probabilistic assumption is introduced to the model of the method. The assumption is that distribution of dissimilarity's error between the points in the rating space is double exponential distribution which is type I extreme value distribution. Monte Carlo experiments have revealed that the method gives considerably good fit to theoretical configuration in the rating space.
View full abstract
-
Akio YAMAMOTO, Ikuo ARIZONO, Hiroshi OHTA
Article type: Article
1992 Volume 43 Issue 5 Pages
334-340
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
In the previous paper, we attempted to solve the scheduling problem for minimizing the total actual flow time by using a stochastic neural network model, and confirmed applicability of the neural network model for this problem. In this paper we propose a method for using the neural network model for a sampling scheme. Furthermore, we apply this method to solve the scheduling problem for minimizing the total actual flow time with direct and indirect preceding relations.
View full abstract
-
Takenori TAKAHASHI, Noriaki KANO
Article type: Article
1992 Volume 43 Issue 5 Pages
341-348
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
The (T_U, T_L) simultaneous control chart is proposed by Takahashi et al., which enables us to make a multiple decision on parameters μ and σ of original normal distribution, when it is observed as attributed data (N_U, N_L) on both-sided specification limits. This cotrol chart is designed based on two assumptions in the same way of the two-way control chart as follows; (1) π_UC≒π_LC, (2) A change in a process is small. In this paper new control limits are proposed, which don't request such assumptions. The probability of the first kind of error and the power of a multiple decision based on these limits are obtained by the Monte-Carlo method and it is ascertained that new limits are more pracical compared with line limits in the previous papers.
View full abstract
-
Terushige HON-IDEN, Noriyuki NISHIYAMA
Article type: Article
1992 Volume 43 Issue 5 Pages
349-354
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
The aim of this study is to investigate the performance of a multi-item dynamic lot'-sizing method when it is applied under rolling schedule environment over 300 planning periods. A heuristic lot-sizing method using DP equation has been proposed for a problem in which a common and an individual setup costs are given. In this study, a revised lot-sizing method which reduces a calculation time is proposed. As a result of a simulation, we find that the average cost per period with the revised method under rolling schedule environment may be less than the average cost of lot-sizing for the whole demands of 300 periods.
View full abstract
-
Shusaku HIRAKI
Article type: Article
1992 Volume 43 Issue 5 Pages
355-362
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
In the knockdown production systems (KDPS), much longer transportation lead time is required to procure component parts, because they are generally supplied by marine transportation. This paper aims to investigate the effects of fluctuation of transportation lead time on a KDPS. Formulating a pull type ordering model, variances of arrival and transported inventory quantities are theoretically analyzed under stochastic demand and transportation lead time, The relationship between the system parameters and the probability of stockout is clarified by numerical analysis. Finally, we show some alternatives of buffer capacities which can assure the system's reliability to a pre-determined target level.
View full abstract
-
Yanwen DONG, Masatoshi KITAOKA
Article type: Article
1992 Volume 43 Issue 5 Pages
363-370
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
This paper deals with the scheduling problems which minimize the total production time for two stage flow shop with parallel machines. Two algorithms are proposed. The one is based on the branch and bound method for determining optimal schedules, the other is a heuristic procedure which can generate near optimal solutions to small problems and perform better than FCFS rule on large problems. Computational results are given which indicate the effectiveness of this algorithms.
View full abstract
-
Article type: Appendix
1992 Volume 43 Issue 5 Pages
371-384
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1992 Volume 43 Issue 5 Pages
385-389
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1992 Volume 43 Issue 5 Pages
390-
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1992 Volume 43 Issue 5 Pages
App1-
Published: December 15, 1992
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS