Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
1992 Volume 35 Issue 3 Pages Cover7-
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.Cover7

JOURNAL FREE ACCESS

Download PDF (182K)
[title in Japanese]

Article type: Appendix
1992 Volume 35 Issue 3 Pages App5-
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.App5

JOURNAL FREE ACCESS

Download PDF (151K)
ON THE M/G/1 QUEUE WITH MULTIPLE VACATIONS AND GATED SERVICE DISCIPLINE

Tetsuya Takine, Toshiharu Hasegawa

Article type: Article
1992 Volume 35 Issue 3 Pages 217-235
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.217

JOURNAL FREE ACCESS

Show abstractHide abstract

The M/G/1 queue with multiple vacations and gated service discipline is considered. We first provide an alternative approach to derive the Laplace-Stieltjes transform of the limiting waiting time distribution, which reveals the stochastic structure of the gated vacation system. Next we discuss the regenerative cycle of the gated vacation system. Based on these considerations, we carry our a time-dependent analysis, from which various formulas are derived.

View full abstract

Download PDF (1054K)
ANALYSIS OF A TWO-CLASS PRIORITY QUEUE WITH BERNOULLI SCHEDULES

Tsuyoshi Katayama, Yoshitaka Takahashi

Article type: Article
1992 Volume 35 Issue 3 Pages 236-249
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.236

JOURNAL FREE ACCESS

Show abstractHide abstract

Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(1 ≤ i ≤ N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability p_i, and the highest class message present in the system is served with probability 1 -p_i, where 0 ≤ p_i ≤ 1. This paper presents an analysis of a two-class priority queue (M/G/1 type queue) with Bernoulli schedules of parameter (p_1 = 1,0 ≤ p_2 ≤ 1) and class-dependent set-up times. The generating functions of joint queue-length distributions and the Laplace-Stieltjes transforms of waiting time distributions are determined. A closed-form expression with infinite summations is obtained for the mean waiting times.

View full abstract

Download PDF (934K)
ON THE CORE OF THE NETWORK DESIGN GAME

Mikio Kubo, Hiroshi Kasugai

Article type: Article
1992 Volume 35 Issue 3 Pages 250-255
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.250

JOURNAL FREE ACCESS

Show abstractHide abstract

We consider a cooperative game on a communication network system whose objective is to find a fair allocation of the total cost for constructing the network among customers. Since an NP-hard combinatorial optimization problem must be solved for calculating the exact network design cost, we consider a game in which lower bounds obtained by Lagrangean relaxation are used instead of the exact costs. We derive a fair cost allocation for the game and show that the derived allocation vectors belong to the core.

View full abstract

Download PDF (487K)
THE PROBABILISTIC NETWORK DESIGN PROBLEM

Mikio Kubo, Hiroshi Kasugai

Article type: Article
1992 Volume 35 Issue 3 Pages 256-272
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.256

JOURNAL FREE ACCESS

Show abstractHide abstract

We analyze the probabilistic variation of the multicommodity discrete network design problem named the probabilistic network design problem in which the commodities are generated probabilistically and the objective is to calculate the expected value of all possible network design instances. We extend the a priori strategy which has been successfully applied to the probabilistic variations of the traveling salesman and minimum spanning tree problems. We use the a priori network strategy which can be seen as an extension of the a priori strategy, to calculated the upper bounds of the expectations of the network design costs, and analyze several heuristic methods for constructing the a priori network both in the worse case model and in the probabilistic model. We also derive the lower bounding procedure using the probabilistic extensions of valid inequalities which, by combining the linear programming technique and the cutting plane procedure, induce the lower bounds of the expected network design costs.

View full abstract

Download PDF (1183K)
OPTIMAL SECOND REPLENISHMENT POLICY IN TWO-PHASED PUSH CONTROL SYSTEM

De-Bi Tsao, Takao Enkawa

Article type: Article
1992 Volume 35 Issue 3 Pages 273-289
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.273

JOURNAL FREE ACCESS

Show abstractHide abstract

A two-echelon push control system with one central warehouse and m branch warehouses is considered. The system is replenished once every cycle from an outside supplier and each cycle is divided into two different phases. While retaining the safety stock at the central warehouse, the bulk of inventories is directly shipped to the branch warehouses at the beginning of the first phase, and at the beginning of the second phase, a second replenishment is coordinated by the central warehouse through monitoring all the inventory levels in the branch warehouses. We call this kind of system a two-phased push control system. The objective of the system is to minimize the expected number of system backorders. Based on an extended model from Jonsson and Silver, an optimal allocation policy is developed for the non-transshipments condition, and the existence of an optimal second replenishment period which minimizes the expected number of system backorders is also shown. The relationship between the optimal second replenishment period and system conditions is examined through numerical examples.

View full abstract

Download PDF (991K)
A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT

Takahito Kuno, Hiroshi Konno, Yoshitsugu Yamamoto

Article type: Article
1992 Volume 35 Issue 3 Pages 290-299
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.290

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some. constant. It is shown that this nonconvex problem can be solved by solving a sequence of convex programming problems. The basic idea of this algorithm is to embed the original problem into a problem in a higher dimensional space and to apply a parametric programming technique. A branch-and-bound algorithm is proposed for obtaining an ε-optimal solution in finitely many iterations. Computational results indicate that this algorithm is efficient for linear programs with an additional linear multiplicative constraint.

View full abstract

Download PDF (574K)
ANALYSIS OF AN M/G/1//N QUEUE WITH MULTIPLE SERVER VACATIONS, AND ITS APPLICATION TO A POLLING MODEL

Hideaki Takagi

Article type: Article
1992 Volume 35 Issue 3 Pages 300-315
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.300

JOURNAL FREE ACCESS

Show abstractHide abstract

Queues with a finite population of customers and the server's occasional unavailable periods (called vacations) are studied in detail. We first consider M/G/1//N queueing system where the server takes repeated vacations until it finds a customer in the queue after emptying the queue. For the steady state, we obtain the performance measures such as the system throughput and mean waiting time from the known analysis of a regenerative cycle of the busy and vacation periods. We also obtain the Laplace-Stieltjes transform of the distribution function for the waiting time of a customer by applying the method of supplementary variables to the joint distribution of the queue size and the elapsed service or vacation times at an arbitrary point in time. These resuts are then applied to the steady-state analysis of a multiple-queue, cyclic-service (polling) model with a finite population of customers, which can represent a token ring network for several computers each with a finite number of interactive users. Some numerical results for symmetric systems are shown.

View full abstract

Download PDF (1039K)
[title in Japanese]

Article type: Appendix
1992 Volume 35 Issue 3 Pages 316-318
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.316

JOURNAL FREE ACCESS

Download PDF (194K)
[title in Japanese]

Article type: Appendix
1992 Volume 35 Issue 3 Pages App6-
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.App6

JOURNAL FREE ACCESS

Download PDF (189K)
[title in Japanese]

Article type: Cover
1992 Volume 35 Issue 3 Pages Cover8-
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.Cover8

JOURNAL FREE ACCESS

Download PDF (121K)
[title in Japanese]

Article type: Cover
1992 Volume 35 Issue 3 Pages Cover9-
Published: 1992
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.35.Cover9

JOURNAL FREE ACCESS

Download PDF (121K)

Register with J-STAGE for free!