All issues
Volume 20 (1977)
- Issue 4 Pages 259-
- Issue 3 Pages 139-
- Issue 2 Pages 77-
- Issue 1 Pages 1-
Volume 20, Issue 3
Displaying 1-13 of 13 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1977 Volume 20 Issue 3 Pages Cover7-
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (69K) -
Article type: Appendix
1977 Volume 20 Issue 3 Pages App5-
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (95K) -
KATSUTOSHI TAMURA, SHINJI MIURAArticle type: Article
1977 Volume 20 Issue 3 Pages 139-149
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper the solution sets of linear maximization problems with a vector criterion index are investigated. The properties of the solution sets are examined in terms of polar cones. A theorem is derived to show the necessary and sufficient conditions for the solution sets. An algorithm to find the solution sets is presented based on the theorem. An example is given to illustrate the theorem and the algorithm.View full abstractDownload PDF (441K) -
YUKIO TAKAHASHIArticle type: Article
1977 Volume 20 Issue 3 Pages 150-163
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSAn approximation formula for the mean waiting time of an M/G/c. queue is proposed. It estimates the mean waiting time from a moment of order α≦2, rather than the second moment, of the service distribution. Together with the Lee & Longton's formula [1] and the Page's formula [2] , it was numerically tested on a variety of cases, and the test shows that the new formula is generally better than the previous two formulas, especially for queues with mixtures of Erlang distributions as the service distribution. A similar approximation formula for the variance of the waiting time is also proposed.View full abstractDownload PDF (555K) -
YUKIO HATOYAMAArticle type: Article
1977 Volume 20 Issue 3 Pages 164-181
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDiscrete time Markov maintenance models are coupled with the theory of control of queues. Each system has an operating machine, spare machines and a repair facility. A decision maker has the option of opening or closing the repair shop when there are machines waiting for repair service, as well as the option of repairing or leaving an operating machine. A two-dimensional control limit policy is defined, and sufficient conditions for the optimality of a two-dimensional control limit policy are obtained for each model.View full abstractDownload PDF (927K) -
MINORU SAKAGUCHIArticle type: Article
1977 Volume 20 Issue 3 Pages 182-193
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe two-sided competitive situation where the players allocate ordnance, subject to resource constraints and limited mission time, to attack (or defense, for the opponent player) for the targets carrying some cargo of varying values is formulated as a two-sided time-sequential zero-sum game. A system of difference equations is derived which is in theory solvable recursively and determines the optimal strategies of the players. A special case of the game is completely solved. The continuous-time version of the problem is also discussed.View full abstractDownload PDF (529K) -
TOSHIO NISHIDA, TOSHIAKI HIRAMATSUArticle type: Article
1977 Volume 20 Issue 3 Pages 194-202
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper considers tandem queuing system in which the order of performing service at two serial service stations can be changed. Interarrival distribution and service distribution of each station are assumed to be exponential. For the above system, we derive the mean queue length and the mean availability per station for finite queue case. And some numerical results will be attached.View full abstractDownload PDF (373K) -
YUICHIRO ANZAIArticle type: Article
1977 Volume 20 Issue 3 Pages 203-230
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSPlanners of urban traffic or transportation systems treat with their own network models of urban road Abstract networks constructed based on their objectives. Usually, those models seem to be determined empirically, and it may not be clear if the planners' objectives are reflected on them or not. This paper presents (i) a formulation of a network modeling problem for urban road networks as a combinatorial optimization problem, (ii) its solution algorithm based on implicit enumeration, (iii) its extensions for some restricted conditions, (iv) some suboptimal techniques for large-scale networks, and (v) some practical examples from vehicle traffic network planning of Tokyo and Nagoya city areas. By the presented algorithm, the planners can obtain network models of appropriate size which are "optimal" in the sense that they reflect best the planners' objectives. From the results of examples, it is verified that the presented algorithm, its extensions and suboptimal techniques provide an effective procedure for network modeling problems, which is applicable for practical use.View full abstractDownload PDF (1242K) -
TADASHI KURISUArticle type: Article
1977 Volume 20 Issue 3 Pages 231-242
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper deals with a three-machine flow-shop problem in which some of the job sequences are infeasible. It is assumed that jobs are grouped into several disjoint subsets within which a job order is pre-determined. Once the first job in a group has started on a machine, then the entire group must be completed on the machine with-out starting a job which does not belong to the group. It is further assumed that a precedence relation between groups is given such that the processing of the jobs in a group must be completed on each machine before the jobs in another group begin on the machine. It is shown that it suffices to consider only permutation schedules for minimizing the total elapsed time and then some restricted cases are solved.View full abstractDownload PDF (529K) -
TAKESHI KAWASE, TADAAKI NEMOTOArticle type: Article
1977 Volume 20 Issue 3 Pages 243-258
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe personal characteristics of Japanese OR/MS leaders which are considered to affect the successful survival and promotion of OR/MS activities in the organization through their evolutionary phases were empirically examined. Forty two OR/MS leaders at twenty four Japanese industrial firms were interviewed and asked to rank personal characteristics which they considered to be important for managing OR/MS group activities at each of the three evolutionary phases viz, missionary, transitional and maturity phases, Under the life-time employement and seniority-dependent promotion system, distinctive OR/MS leader patterns are difficult to determine, hence the opinion of OR/MS leaders was studied. It was found, among others, that. OR/MS leaders should change as the OR/MS group progresses through their organizational evolution in such a way that the characteristics of technical orientation become less important while characteristics of organizational orientation become highly important as the group advances to the maturity phase.View full abstractDownload PDF (837K) -
Article type: Appendix
1977 Volume 20 Issue 3 Pages App6-
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (106K) -
Article type: Cover
1977 Volume 20 Issue 3 Pages Cover8-
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (70K) -
Article type: Cover
1977 Volume 20 Issue 3 Pages Cover9-
Published: 1977
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (70K)
- |<
- <
- 1
- >
- >|