-
Article type: Cover
1989 Volume 40 Issue 4 Pages
Cover1-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Cover
1989 Volume 40 Issue 4 Pages
Cover2-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Index
1989 Volume 40 Issue 4 Pages
Toc1-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
i-ii
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Sennosuke KURIYAMA
Article type: Article
1989 Volume 40 Issue 4 Pages
209-210
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Masao AKIBA
Article type: Article
1989 Volume 40 Issue 4 Pages
210-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Yasuhiro MONDEN
Article type: Article
1989 Volume 40 Issue 4 Pages
211-217
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
Applying the"Moriarity's Allocation Method" to joint-profit allocations among divisions may make each division dissatisfied with its allocated profit if they can from some subcoalitions under certain constraints.Thus, this paper will improve his method and propose a new allocation scheme called "Cumulative Opportunity Cost Scheme."This research will prove in general form that the new scheme will satisfy the conditions of "φstability"of game theory, and thereby each division can be willing to accept the imputation by this method.
View full abstract
-
Hiroaki FUJIWARA, Masayuki MATSUI
Article type: Article
1989 Volume 40 Issue 4 Pages
218-224
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
Consider a job-shop production system where orders arrive in accordance with a Poisson process. Each order involves an amount of work which is known upon arrival, is sampled from an exponential distribution, and is independent of the reward of orders. For controlling the backlog, a manager selects the orders arriving beyond a criterion of the reward, and uses available two constant service rates. This paper treats the simple policies of maximizing the long-run average return, and discusses a class of the 2-level control problem.Finally, a numerical example is given.
View full abstract
-
Hiroyuki KASAMATSU, Masaharu OTA, Katsundo HITOMI
Article type: Article
1989 Volume 40 Issue 4 Pages
225-236
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
In case that the production sites are located in different contries, as observed in multinational corporations, the managerial actions are influenced by the policies established in these countries with regard to the trade balance, the rate of parts procurement, etc. Therefore, the multinational corporation should take account of not only the profit maximization but also various criteria, in order to make the reasonable managerial decisions. In this paper, the various objectives to be considered in planning the production-distribution problems for the multinational corporations are enumerated and classified. Then, a production-distribution planning model of Goal-Programming type is constructed, and the solution algorithm is developed, based upon the Ignizio's method.A numerical example is given to verify the effectiveness of the model and to demonstrate the planning process.
View full abstract
-
Naoto KATAYAMA, Hiroshi KASUGAI
Article type: Article
1989 Volume 40 Issue 4 Pages
237-245
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
This paper addresses a problem of determining links to be expanded in an urban road network so that traffic congestion there is minimized. We propose a new lower bound of a branch and bound method for a nonlinear mixed integer programming model. This new lower bound is calculated through a feasible direction method and a Lagrangean relaxation. We prove that this Lagrangean relaxation problem can be solved easily by a transformation of the objective function, and this lower bound is stronger than LeBlanc's lower bound. We also present a procedure to find a good Lagrangean multiplier which is incorporated into our branch and bound algorithm and heuristic algorithm. Simple numerical examples are given to illustrate our lower bound and branch and bound algorithm.
View full abstract
-
Yasuo KUSAKA, Masao MORI
Article type: Article
1989 Volume 40 Issue 4 Pages
246-252
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
In this paper, a Markovian replacement policy is proposed taking the volume of production into account.The decision an each period, consisted of the three actions of stopping, operating and replacing equipment, is made based on the states of the equipment deterioration and the remaining needed volume of production so as to minimize the expected discounted total cost. It is shown that the optimal policy is characterized by some control limit policies through theoretical and numerical analyses.
View full abstract
-
Naoki HIRABAYASHI, Hiroyuki NAGASAWA, Noriyuki NISHIYAMA
Article type: Article
1989 Volume 40 Issue 4 Pages
253-258
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
Previous papers have proposed "decomposition scheduling methods" for resolving the problem that the optimal schedule to minimize the makespan requires a too large amount of buffer capacity to operate the real FMS in either a 2-machine or a flowshop type FMS.This method is applied to a 3-machine jobshop type FMS with the above problem.It was clarified through some simulation experiments that if each set of jobs with the same process routes consists of an equal number of jobs, and if the processing times are uniformly distributed, the decomposition method with 20 jobs in each decomposed group yields the schedule with a high degree of approximation in the utilization of FMS, i.e., 1.02,and with a small amount of required buffer capacity, i.e., 6 units per machine.
View full abstract
-
Yasuhiro KAJIHARA, Hirokazu OSAKI
Article type: Article
1989 Volume 40 Issue 4 Pages
259-265
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
An expert system is developed to support an automated job shop type assembly line design, in which preconditions and rules are expressed in logical formulas. This system has the following characteristics. (1) Forward or backward scheduling can be selected. (2) The criterion of the input order of products, the dispatching process at each assembly station, and the moving of products from a buffer to its corresponding assembly station can be selected from several priority criteria. (3) A rule to avoid blockings is included. (4) Layout, number and velocity of AGV, and capacity for each buffer can be changed.
View full abstract
-
Kiyoshi HORIE
Article type: Article
1989 Volume 40 Issue 4 Pages
266-273
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
In the second paper it was concluded on the basis of Tsuda's theory that the condition of Japanese leadership was that leader should have godhood.In this paper Tsuda's theory is revised and the above conclusion on Japanese leadership is confirmed again. Moreover it is concluded that this condition of Japanese leadership is caused by the psychological trait of the feeling of togetherness peculiar to Japanese.
View full abstract
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
274-284
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
285-286
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
287-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
288-289
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
1989 Volume 40 Issue 4 Pages
App1-
Published: October 15, 1989
Released on J-STAGE: December 17, 2018
JOURNAL
FREE ACCESS