Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
2004 Volume 47 Issue 2 Pages Cover4-
Published: 2004
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.47.Cover4

JOURNAL FREE ACCESS

Download PDF (16K)
[title in Japanese]

Article type: Appendix
2004 Volume 47 Issue 2 Pages App3-
Published: 2004
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.47.App3

JOURNAL FREE ACCESS

Download PDF (58K)
[title in Japanese]

Article type: Appendix
2004 Volume 47 Issue 2 Pages App4-
Published: 2004
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.47.App4

JOURNAL FREE ACCESS

Download PDF (58K)
GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD

Sun Qingying, Liu Xinhai

Article type: Article
2004 Volume 47 Issue 2 Pages 63-72
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, a new class of three-term memory gradient methods with Armijo-like step size rule for unconstrained optimization is presented. Global convergence properties of the new methods are discussed without assuming that the sequence {X_k} of iterates is bounded. Moreover, it is shown that, when f(x) is pseudo-convex (quasi-convex) function, this new method has strong convergence results. Combining FR, PR, HS methods with our new method, FR, PR, HS methods are modified to have global convergence property. Numerical results show that the new algorithms are efficient.

View full abstract

Download PDF (577K)
A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING

Akihiro Hashimoto, De-An Wu

Article type: Article
2004 Volume 47 Issue 2 Pages 73-81
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper addresses comprehensive ranking systems determining an ordering of entities by aggregating quantitative data for multiple attributes. We propose a DEA-CP (Data Envelopment Analysis - Compromise Programming) model for the comprehensive ranking, including preference voting (ranked voting) to rank candidates in terms of aggregate vote by rank for each candidate. Although the DEA-CP model once employs the flexible DEA weighting system that can vary by entity, it finally aims at regressing to the common weights across the entities. Therefore, the model can totally rank the entities by specifying nothing arbitrary, and can avoid to use the diverse DEA weights.

View full abstract

Download PDF (619K)
REMARKS ON THE CONCURRENT CONVERGENCE METHOD FOR A TYPICAL MUTUAL EVALUATION SYSTEM

Kazuyuki Sekitani, Hiromitsu Ueta

Article type: Article
2004 Volume 47 Issue 2 Pages 82-95
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

A mutual evaluation system deals with a decision making problem including the feedback structure between alternatives and criteria. By incorporating decision makers' intuitive judgments from alternatives to criteria into overall evaluations for alternatives, the mutual evaluation system may be effective to make a consensus among the decision makers of the problem. An analyzing tool of the mutual evaluation system, Concurrent Convergent Method (CCM) by Kinoshita and Nakanishi, has practical advantage. This paper introduces an overall weight vector for criteria into CCM. By using the overall weight vector not for alternatives but for criteria, we demonstrate irrationality of CCM under the Pareto principle.

View full abstract

Download PDF (900K)
ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME

Shuzo Yanai, Tetsuya Fujie

Article type: Article
2004 Volume 47 Issue 2 Pages 96-111
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

The dominance test is a bounding operation in branch-and-bound algorithms, where each subproblem is examined whether it can be terminated or not by comparing, implicitly or explicitly, with another subproblem. For a single machine scheduling problem with release dates to minimize total flow time, Chu [5] proposed a branch-and-bound algorithm with a dominance test based on already known and new dominance properties and reported that the dominance test works successfully to solve problem instances exactly with up to 100 jobs. On the other hand, a naive combination of these dominance properties may delete all of the optimal solutions. The purpose of this paper is to point out such a pitfall and then propose a way to avoid it. Furthermore, new dominance properties based on the property developed by Chu [5] are proposed. Computational experiments are performed to see how often the branch-and-bound algorithm with a naive dominance test fails and to show an effectiveness of our branch-and-bound algorithm.

View full abstract

Download PDF (1257K)
AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING

Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo

Article type: Article
2004 Volume 47 Issue 2 Pages 112-122
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper is concerned with the input-or-output test that is a kind of interval capacity consistency tests. And an O(n^2 log^2 n) algorithm dealing with the test is proposed, where n denotes the number of jobs. In literature, an O(n^4) algorithm has been known. The tests can be effectively used to reduce the search space of time- and resource-constrained scheduling problems. Computational results show that our new algorithm is about 3 times faster for instances of 30 jobs than the existing algorithm.

View full abstract

Download PDF (675K)
LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS

Yuichiro Miyamoto, Tomomi Matsui

Article type: Article
2004 Volume 47 Issue 2 Pages 123-128
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Show abstractHide abstract

Let P be a subset of 2-dimensional integer lattice points P={1, 2, ..., m}×{1, 2, ..., n}⊆Z^2. We consider the graph G_P with vertex set P satisfying that two vertices in P are adjacent if and only if Euclidean distance between the pair is less than or equal to √<2>. Given a non-negative vertex weight vector ω∈Z^P_+, a multicoloring of (G_P, ω) is an assignment of colors to P such that each vertex υ∈P admits ω(υ) colors and every adjacent pair of two vertices does not share a common color. We show the NP-completeness of the problem to determine the existence of a multicoloring of (G_P, ω) with strictly less than (4/3)ω colors where ω denotes the weight of a maximum weight clique. We also propose an O(mn) time approximation algorithm for multicoloring (G_P, ω). Our algorithm finds a multicoloring with at most (4/3)ω+4 colors Our algorithm based on the property that when n=3, we can find a multicoloring of (G_P, ω) with ω colors easily, since an undirected graph associated with (G_P, ω) becomes a perfect graph.

View full abstract

Download PDF (441K)
[title in Japanese]

Article type: Appendix
2004 Volume 47 Issue 2 Pages App5-
Published: 2004
Released on J-STAGE: June 27, 2017

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

JOURNAL FREE ACCESS

Download PDF (101K)
[title in Japanese]

Article type: Cover
2004 Volume 47 Issue 2 Pages Cover5-
Published: 2004
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.47.Cover5

JOURNAL FREE ACCESS

Download PDF (30K)
[title in Japanese]

Article type: Cover
2004 Volume 47 Issue 2 Pages Cover6-
Published: 2004
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.47.Cover6

JOURNAL FREE ACCESS

Download PDF (30K)

Register with J-STAGE for free!