All issues
Volume 27 (1984)
- Issue 4 Pages 275-
- Issue 3 Pages 191-
- Issue 2 Pages 97-
- Issue 1 Pages 1-
Volume 27, Issue 3
Displaying 1-10 of 10 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1984 Volume 27 Issue 3 Pages Cover7-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (139K) -
Article type: Appendix
1984 Volume 27 Issue 3 Pages App5-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (116K) -
Dieter Konig, VoIker SchmidtArticle type: Article
1984 Volume 27 Issue 3 Pages 191-204
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper employs the methods recently developed for queues with non-independent interarrival and service times in order to investigate tandem queues attended by a single server, where the primary focus is upon relationships between time-stationary and customer-stationary queue length characteristics. Examples are given how these relationships can be applied.View full abstractDownload PDF (749K) -
Ryuichi Hirabayashi, Hisatoshi Suzuki, Noboru TsuchiyaArticle type: Article
1984 Volume 27 Issue 3 Pages 205-229
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn order to enhance factory automation and unmanned production, numerical controlled (NC) machine tools are widely used in many mechanical processing factories. Whenever one machining part is changed to another, the operation of an NC machine tool has to be stopped in order to change some of the cutting tools on the turret tool holder. In this paper, a new concept of 'tool module' is used and the problem of reducing the number of tool changing operations for NC machine tools is discussed. The problem is formulated as a 0-1 integer programming (0-1 ILP) problem on a bipartite graph and a branch and bound algorithm is proposed to select an optimal tool module. Since the LP relaxation problem obtained by dropping the integrality condition for the 0-1 ILP problem has a special network structure like the well-known transportation problem, this LP is solved by certain network flow algorithm with utilizing its special structure Some numerical experiments are reported, and indicate that the algorithm is reasonably efficient. Furthermore, possible extensions of this method are discussed.View full abstractDownload PDF (1230K) -
Takashi KobayashiArticle type: Article
1984 Volume 27 Issue 3 Pages 230-249
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper proposes an algorithm for solving the minimum cost project scheduling problerm with an additional linear constraint whose right hand side is a parameter. Instead of putting the additional constraint, we add it to the objective function, where it is multiplied by a parameter. First, we get an optimal solution when a parameter is zero, and next, increase it to infinity. To do so, we iterate to find two dimensional flow on the given arrow diagram. The bounds for each arrow flow are determined by the current solution. The first elements are related to the costs, and the second to the coefficients in the additional constraint. A lexico-bounded flow is defined as the flow such that each arrow flow is within the bounds in the lexicographical ordering. When a lexico-bounded flow exists, the parameter is increased. Otherwise, the function of the additional constraint is increased. Our algorithm is almost dual to the lexico-shortest route algorithm for the minimum cost flow problem with an additional linear constraint. For example, a loop is replaced by a cutset. Our algorithm is also applicable to a project scheduling problem with two objectives by combining them with a parameter.View full abstractDownload PDF (704K) -
Shigeo MutoArticle type: Article
1984 Volume 27 Issue 3 Pages 250-259
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper, stable sets for simple games with ordinal preferences are studied in the case where the number of alternatives is finite. It is shown that the condition for the existence of a nonempty core for any possible combination of players' preferences is also a necessary and sufficient condition for the existence of a unique stable set. Moreover, a necessary and sufficient condition that proper simple games have at least one stable set is presented.View full abstractDownload PDF (596K) -
Yutaka BabaArticle type: Article
1984 Volume 27 Issue 3 Pages 260-273
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThe M^X/G/1 queue with finite waiting room is studied for both the partially rejected model and the totally rejected model. We start by studying the joint distribution of the number of customers at time t and the remaining service time of customer in service. This gives the asymptotic distribution of the number of customers at an arbitrary moment and immediately after a departure. Also the waiting time distribution is easily obtained.View full abstractDownload PDF (657K) -
Article type: Appendix
1984 Volume 27 Issue 3 Pages App6-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (152K) -
Article type: Cover
1984 Volume 27 Issue 3 Pages Cover8-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (61K) -
Article type: Cover
1984 Volume 27 Issue 3 Pages Cover9-
Published: 1984
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (61K)
- |<
- <
- 1
- >
- >|