Journal: Journal of the Operations Research Society of Japan

Found 541 papers in total
On a dominance test for the single machine scheduling problem with release dates to minimize total flow time
On a dominance test for the single machine scheduling problem with release dates to minimize total flow time
2004,
The dominance test is a bounding operation in branch-and-bound algorithms, where each...
A DEA-compromise programming model for comprehensive ranking
A DEA-compromise programming model for comprehensive ranking
2004,
This paper addresses comprehensive ranking systems determining an ordering of entities...
An O(n2log2n) algorithm for input-or-output test in disjunctive scheduling
An O(n2log2n) algorithm for input-or-output test in disjunctive scheduling
2004,
This paper is concerned with the input-or-output test that is a kind of interval...
Remarks on the concurrent convergence method for a typical mutual evaluation system
Remarks on the concurrent convergence method for a typical mutual evaluation system
2004,
A mutual evaluation system deals with a decision making problem including the feedback...
Linear time approximation algorithm for multicoloring lattic graphs with diagonals
Linear time approximation algorithm for multicoloring lattic graphs with diagonals
2004,
Let P be a subset of 2-dimensional integer lattice points P =...
Comparison of cyclic and delayed maintenances for a phased array radar
Comparison of cyclic and delayed maintenances for a phased array radar
2004,
An antenna of phased array radar (PAR) consists of a large number of individual...
Evaluating all Bertrand-Nash equilibria in a discrete spatial duopoly model
Evaluating all Bertrand-Nash equilibria in a discrete spatial duopoly model
2004,
This paper studies a spatial duopoly model where customers are located at nodes and...
A polynomial-time algorithm for the generalized independent-flow problem
A polynomial-time algorithm for the generalized independent-flow problem
2004,
We consider a compound problem of the generalized minimum-cost flow problem and the...
A new characterization of M#-convex set functions by substitutability
A new characterization of M#-convex set functions by substitutability
2004,
The concepts of M-convex functions and M-convex functions play central roles in the...
Performance evaluation of secure group communication
Performance evaluation of secure group communication
2004,
There are demands for secure group communication on the internet, such as pay-per-view...
Special classes of quiet accumulation games
Special classes of quiet accumulation games
2003,
In an accumulation game, a hider places objects at locations, and a seeker examines...
Impossibility theorems on mutual evaluation
Impossibility theorems on mutual evaluation
2003,
Arrow's impossibility theorem, which is a classical result in social choice theory,...
Extracting feature subspace for kernel based linear programming support vector machines
Extracting feature subspace for kernel based linear programming support vector machines
2003,
We propose linear programming formulations of support vector machines (SVM). Unlike...
Regenerative cycle method in M/G/1 with many vacation rules
Regenerative cycle method in M/G/1 with many vacation rules
2003,
This paper gives a new method to derive the time average distribution of queue length...
The centralized sequential investment problem with regional characteristics effect by using genetic algorithms
The centralized sequential investment problem with regional characteristics effect by using genetic algorithms
2003,
This research aims to find a non-recurring directed path that will enable all...
On the hub-and-spoke model with arc capacity constraints
On the hub-and-spoke model with arc capacity constraints
2003,
In this paper, we present a new formulation of one-stop capacitated hub-and-spoke...
2-cyclic design in Analytic Hierarchy Process
2-cyclic design in Analytic Hierarchy Process
2003,
The simple method called “2-cyclic design” is proposed to select pairs to...
Dual analysis on hedging Value at Risk of bond portfolio using options
Dual analysis on hedging Value at Risk of bond portfolio using options
2003,
In this paper, I propose the optimal hedging of bond portfolio VaR using bond options...
Stationary queue length in a first-in-first-out single server queue with service interruptions and multiple batch Markovian arrival streams
Stationary queue length in a first-in-first-out single server queue with service interruptions and multiple batch Markovian arrival streams
2003,
This paper considers a FIFO single-server queue with service interruptions and...
New maximum flow algorithms by maximum adjacency orderings and scaling
New maximum flow algorithms by maximum adjacency orderings and scaling
2003,
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
An improvement method for the workflow management systems based on the reallocation of flows using the genetic programming and its applications
An improvement method for the workflow management systems based on the reallocation of flows using the genetic programming and its applications
2003,
This paper deals with an improvement method for the Workflow Management Systems (WMSs)...
An approximation for a continuous datum search game with energy constraint
An approximation for a continuous datum search game with energy constraint
2003,
This paper deals with a datum search game, where a target reveals his position (datum...
An efficient heuristic for traffic grooming and light-path routing in wavelength division multiplexing ring networks with hop-count constraint
An efficient heuristic for traffic grooming and light-path routing in wavelength division multiplexing ring networks with hop-count constraint
2003,
This paper deals with a traffic grooming and light-path routing problem in WDM-ring...
Economic feasibility of bandwidth-sharing service with quality of service guarantees
Economic feasibility of bandwidth-sharing service with quality of service guarantees
2003,
Recent progress in quality-of-service (QoS) differentiating technology in...
Papers per page: