Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Volume 28, Issue 4
Displaying 1-13 of 13 articles from this issue
  • Article type: Cover
    1985 Volume 28 Issue 4 Pages Cover10-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (131K)
  • Article type: Appendix
    1985 Volume 28 Issue 4 Pages App7-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (125K)
  • Tetsuo Ichimori
    Article type: Article
    1985 Volume 28 Issue 4 Pages 269-284
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric' shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0(n max(m log m, n^3)) where n and m denote the numbers of the new and existing facilities in the plane, respectively. For a special case the time bound is further reducible to 0(n max(m, n^2)).
    Download PDF (687K)
  • Akihiko Ishikawa
    Article type: Article
    1985 Volume 28 Issue 4 Pages 285-301
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    In this paper, the eigenvalues of the transition rate matrices in a GI/E_k/m queueing system are analytically obtained for any k and m. First, it is supposed that each channel is distinguishable from others, as a semi-homogeneous queueing system. Here, a transition rate matrix S_m(θ) and the eigenvalues of it are easily found by the mathematical induction on m, for any fixed k, where 6 is a complex parameter. It can be shown that the matrix. S_m(θ) is similar to a diagonal matrix, and that an eigenvalue of S_m(θ) takes the form of a m-sum of d(j)'s, where d(j) is the eigenvalue of S_l(θ). On the other hand, the transition rate matrix T_m(θ) in a homogeneous queueing system is different from S_m(θ) in appearance. But T_m(θ) can be made from S_m(θ) by using an equivalence relation. Then it can be shown that the matrix T_m(θ) is similar to a diagonal matrix, and the matrices T_m(θ) and. S_m(θ) have the same eigenvalues except the multiplicity. Finally, to clarify the description, an example (k = 3 and m = 3) is shown.
    Download PDF (729K)
  • Masao Fukushima, Eiki Yamakawa, Hisashi Mine
    Article type: Article
    1985 Volume 28 Issue 4 Pages 302-317
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    This paper is concerned with a differentiable exact penalty function derived by modifying the Wolfe dual of an equality constrained problem. It may be considered that this penalty function belongs to a class of general augmented Lagrangians on which other differentiable exact penalty functions are based. It is shown that this penalty function possesses an attractive property which may be enable us to use Newton like method effectively. Some numerical results are also reported.
    Download PDF (768K)
  • Yoshitsugu Ohmae, Eiyu Iwase
    Article type: Article
    1985 Volume 28 Issue 4 Pages 318-330
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Quite often, there are tandem queue systems which the service facilities are serially linked. For example, such computer systems as consisting of two stages; the first is input-output device and the second is CPU, such banking systems as consisting of two stages; the first is cash dispenser terminal and the second is CPU, and so on. As the customer-oriented measure of the system evaluation, the response time in a computer system is important. The response time is defined as the time interval between the instant when the input to the system is completed and the instant when its processing by the system is completed. In the general cases, the total time spent in system corresponds to the response time. So far the evaluation of the system by the mean time is familiar. However, the customers feel a great interest rather upper deviation of the time than the mean value as a service grade. One of the evaluation measures for such deviation is a percentile. That is, p percentile is adapted as the upper limit of service time distribution. P percent of customers are included within this limits. It enables to design a service system so that the customer service time is kept below the customer's tolerated percentile. This study gives the computation method and the table to find p percentile corresponding to given p percent. Furthermore, the properties of percentile of tandem queue are studied from a point of view of system design.
    Download PDF (616K)
  • Takeo Yamada, Teruhisa Kitahara
    Article type: Article
    1985 Volume 28 Issue 4 Pages 331-344
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Systems of linear constraints are examined from a qualitative point of view. A property is said to be qualitative if it holds for all possible parameter values of certain prefixed sign patterns. In economics, such an approach has been traditionally taken within the perspective of comparative static analysis. However, the results obtained in this area appear somewhat limited in practical applicability. This paper extends qualitative approach to the system of linear constraints in general, and presents necessary and sufficient conditions for qualitative feasibility/infeasibility, qualitative boundedness/unboundedness of feasible regions, and qualitative boundedness/unboundedness of objective functions. Duality theorem for linear programming problems is reconsidered from the qualitative point of view. Possible application areas of such an approach are also discussed.
    Download PDF (699K)
  • Chang Sup Sung
    Article type: Article
    1985 Volume 28 Issue 4 Pages 345-358
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    A production planning model for multi-product facilities is analyzed, in which known demands must be satisfied. In the model, in every production period each facility produces a certain number of items each taking a fixed part of the production amount. Concave production costs dependent upon the production in different facilities and piecewise concave inventory costs are considered. Both the nonbacklog and backlog permitted cases are considered. The structure of an optimal solution is characterized and then used, illustratively in a simple dynamic programming algorithm for nonbacklog single-facility problems.
    Download PDF (718K)
  • Article type: Appendix
    1985 Volume 28 Issue 4 Pages 359-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (49K)
  • Article type: Index
    1985 Volume 28 Issue 4 Pages 361-362
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (68K)
  • Article type: Appendix
    1985 Volume 28 Issue 4 Pages App8-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (166K)
  • Article type: Cover
    1985 Volume 28 Issue 4 Pages Cover11-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (66K)
  • Article type: Cover
    1985 Volume 28 Issue 4 Pages Cover12-
    Published: 1985
    Released on J-STAGE: June 27, 2017
    JOURNAL FREE ACCESS
    Download PDF (66K)
feedback
Top