All issues
Volume 27 (1984)
- Issue 4 Pages 275-
- Issue 3 Pages 191-
- Issue 2 Pages 97-
- Issue 1 Pages 1-
Volume 27, Issue 4
Displaying 1-10 of 10 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1984 Volume 27 Issue 4 Pages Cover10-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (130K) -
Article type: Appendix
1984 Volume 27 Issue 4 Pages App7-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (109K) -
Kiyoshi KUGA, Hiroaki NAGATANIArticle type: Article
1984 Volume 27 Issue 4 Pages 275-305
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSU.S. has undergone innovations in financial instruments such as money market fund, money market certificate, cash management account, etc. The same sort of forces for change, though less turbulent in nature, has began to pervade the financial system of Japan. An important key to the innovation is provided by the "Sogo Account" for personal use which was adapted by Japanese banks in 1972. The "Sogo Account" is a combination of a time deposit account,, an ordinary account, and an overdraft contract. Prearranged automatic payments (e.g., utility charges) are automatically debited to the customer's ordinary account. Overdrafts are permitted up to 90 percent of the amount in the customer's time deposit which serves as collateral (see [2, p.45]). The "Sogo Account" is available in most of the financial institutions of Japan, such as city banks, local banks, trust banks, mutual loan and savings banks, credit associations, postal offices, agricultural cooperatives, credit co-operatives, and labor credit associations. In the case of banks, an optimum management on the part of the customer of the "Sogo Account" is shown to take a typical form of the concave programming problem. The optimum management in the case of postal savings is shown to reduce to a non-convex piecewise-linear programming problem. Optimality conditions and algorithms are provided. The algorithm for the non-convex problem is constructed with recourse to a recursive formula for searching a set of conceivable linear segments. Some optimum rule of thumb for daily use is also provided.View full abstractDownload PDF (2105K) -
Takao Ohya, Masao Iri, Kazuo MurotaArticle type: Article
1984 Volume 27 Issue 4 Pages 306-337
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSA fast algorithm for the Voronoi diagram is proposed along with the performance evaluation by extensive computational experiments. It is shown that the proposed algorithm runs in linear time on the average. The algorithm is of incremental type, which modifies the diagram step by step by adding points (generators) one by one. What is new is a special preprocessing procedure for determining the order in which the generators are to be added, where we make use of a quaternary tree combined with an elaborate technique of "bucketing".View full abstractDownload PDF (1491K) -
Genji YamazakiArticle type: Article
1984 Volume 27 Issue 4 Pages 338-347
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper is concerned with the GI/G/1 queueing system under the assumption of last-come-fin;t-served queue discipline where each customer enters the service immediately upon his arrival. If a customer service is interrupted because of the arrival of another customer, his remaining service requirement remains unchanged until the server can attend to him again. Let (p_n) and (r_n), n=0,1,2, ....., be the equilibrium distributions of the number of customers in the system, when the system is considered 'at any time' and when it is considered at epochs immediately before successive arrivals respectively. It is shown that a relation between the sequences (p_n) and (r_n) is the same as that of the GI/M/1 queueing system with first-come-first-served queue discipline. Also it is shown that the remaining service requirement of the customer being served at any time is independent of the state of the system and it has the distribution function of the 'residual' service requirement. Furthermore a simple expression of the distribution function of the nearest time after any time is given.View full abstractDownload PDF (524K) -
Ichiro Nabeshima, Shigeko MaruyamaArticle type: Article
1984 Volume 27 Issue 4 Pages 348-367
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper considers two- and three-machine flow-shop makespan scheduling problems with additional times separated from processing times. For two-machine case we investigate the optimality of the passing of jobs and give an optimal algorithm in permutation case with five independent times, that is, setup and removal times, start and stop lags and transportation times. It generalizes known algorithms. And for a three-machine case with independent setup times alone, we present several sufficient optimality conditions for a specified sequence ω_1 and clarify not only their mutual relation but also the superiority of ω_1 as an approximate sequence. Those results generalize the results in usual three-machine flow-shop case.View full abstractDownload PDF (931K) -
Article type: Index
1984 Volume 27 Issue 4 Pages 368-369
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (65K) -
Article type: Appendix
1984 Volume 27 Issue 4 Pages App8-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (145K) -
Article type: Cover
1984 Volume 27 Issue 4 Pages Cover11-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (66K) -
Article type: Cover
1984 Volume 27 Issue 4 Pages Cover12-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (66K)
- |<
- <
- 1
- >
- >|