All issues
Volume 49 (2006)
- Issue 4 Pages 279-
- Issue 3 Pages 151-
- Issue 2 Pages 83-
- Issue 1 Pages 1-
Volume 49, Issue 2
Displaying 1-10 of 10 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
2006 Volume 49 Issue 2 Pages Cover4-
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (27K) -
Article type: Appendix
2006 Volume 49 Issue 2 Pages App2-
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (67K) -
Shoichi Nishimura, Hiroyuki Tominaga, Takemi ShigetaArticle type: Article
2006 Volume 49 Issue 2 Pages 83-97
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSFor calculations of the boundary vector arising in a BMAP/G/1 queue, we consider a spectral method based on eigenvalues and eigenvectors without assuming a structure of a BMAP. We define a nonlinear function of the determinant of a matrix function. It is proved that there are M zeros of the nonlinear function on a disk in the complex plane, where M is the size of rate matrices of a BMAP. And for the calculation of all the zeros, we propose a modification of the Durand-Kerner method which is known as an iterative method for calculating all zeros of a polynomial simultaneously. Spectral methods for calculating the stationary probabilities just after service completion epochs and at arbitrary time are given.View full abstractDownload PDF (1005K) -
Yasuhito Kishi, Issei KinoArticle type: Article
2006 Volume 49 Issue 2 Pages 98-116
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper a new approach of Jordan canonical formulation for analysis of a PH-subgenerator is proposed. Based on the new method, this paper shows that if all eigenvalues of a PH-subgenerator are real then the closed form of the PH-distribution is a linear combination of Erlang distributions, while if the subgenerator has complex eigenvalues then the closed form of the PH-distribution is no longer such a simple form but more complex form that includes trigonometric functions in addition to a linear combination of Erlang distributions. This paper also shows that the dominant parameter for degree of a PH-distribution is not the size but the degree of minimal polynomial of the PH-subgenerator.View full abstractDownload PDF (1075K) -
Robert Huang-Jing Lin, Peter ChuArticle type: Article
2006 Volume 49 Issue 2 Pages 117-129
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis note examines the inventory model with service level constraint in which the lead time, the reordered point and order quantity are treated as decision variables. The previous researchers believed that the objective function is concave in the lead time such that the minimum must occur on the boundary points of each sub-domain. In this note, we will show that their belief contains questionable results. In a recent paper in Journal of the Operations Research Society of Japan, Ouyang and Chuang studied this problem. However, their algorithm might not find the optimal solution due to flaws in their solution procedure. We developed some lemmas to reveal the parameter effects and then presented the complete procedures for finding the optimal solution for the inventory model in which the lead time demand is unknown and for solving by the Gallego's minimax distribution free procedure. The savings are illustrated by solving the same examples from Ouyang and Chuang's paper to demonstrate a 30% improvement by our revised algorithm.View full abstractDownload PDF (922K) -
Toru Komiya, Koji Iida, Ryusuke HohzakiArticle type: Article
2006 Volume 49 Issue 2 Pages 130-143
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWe consider an optimal search plan for a movable target. A searcher conducts a two-stage search consisting of a broad search and an investigating search. In the broad search phase, the searcher seeks for many uncertain signals featuring target. They are called contacts. There are three possible entities of the origin of a contact. They are a true target, false object or noise. When a contact is gained, the searcher executes the investigating search in the following step. He gives a judgment on the contact after it. At the moment, the searcher could make the errors of the first and the second kind. We model the search procedure taking account of these three possible entities and the two kinds of human errors and derive conditions of the optimal investigating time so as to maximize the detection probability of a target. By numerical examples, we show some optimal investigating plans and explain the properties of these optimal plans.View full abstractDownload PDF (1066K) -
Akiyoshi Shioura, Ning Sun, Zaifu YangArticle type: Article
2006 Volume 49 Issue 2 Pages 144-150
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSWe study a fair division problem with indivisible objects like jobs, houses, and one divisible good like money. Each individual is to be assigned with one object and a certain amount of money. The preferences of individuals over the objects are private information but individuals are assumed to have quasi-linear utilities in money. It is shown that there exist efficient algorithms for eliciting honest preferences and assigning the objects with money to individuals efficiently and fairly.View full abstractDownload PDF (518K) -
Article type: Appendix
2006 Volume 49 Issue 2 Pages App3-
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (101K) -
Article type: Cover
2006 Volume 49 Issue 2 Pages Cover5-
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (28K) -
Article type: Cover
2006 Volume 49 Issue 2 Pages Cover6-
Published: 2006
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (28K)
- |<
- <
- 1
- >
- >|