Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Journal of the Operations Research Society of Japan
Found
541 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Waiting time analysis of MX/G/1 queues with/without vacations under random order of service discipline
2000,
Takagi Hideaki
We study (batch arrival) M X /G/1 queues with/without vacations under random order of...
A regenerative cycle approach to an M/G/1 queue with exceptional service
2000,
Miyazawa Masakiyo
We are concerned with an M/G/ 1 queue in which service time distributions in each busy...
Practical efficiency of the linear-time algorithm for the single source shortest path problem
2000,
Imai Hiroshi
Thorup's linear-time algorithm for the Single Source Shortest Path problem consists of...
A new stochastic learning algorithm for neural networks
2000,
Okano Hiroyuki
A new stochastic learning algorithm using Gaussian white noise sequence, referred to...
A compound dependability measure arising from semi-Markov reliability model
2000,
Masuda Yasushi
A compound dependability measure is proposed and analyzed under the Markovian...
Improvement on the 2-shift nurse scheduling algorithm
2000,
Atsuko Ikegami
This paper proposes an improvement of the algorithm by Ikegami and Niwa for 2-shift...
A generalized optimum requirement spanning tree problem with a Monge-like property
2000,
Anazawa Tsutomu
We consider a generalized optimum requirement spanning tree problem (GORST problem)...
L-shaped decomposition method for multi-stage stochastic concentrator location problem
2000,
Shiina Takayuki
A stochastic version of a concentrator location problem is dealt with in which traffic...
Second moments of the waiting time in symmetric polling systems
2000,
Takagi Hideaki
Multiple queue, cyclic service systems (called polling systems) have often been used...
Genetic algorithm in uncertain environments for solving stochastic programming problem
2000,
Yoshitomi Yasunari
Many real problems with uncertainties may often be formulated as Stochastic...
Efficiency – measuring a data envelopment analysis model for production system with k independent subsystems
2000,
Yang Yinsheng
Data Envelopment Analysis (DEA) is a mathematical programming approach to assess...
On a competitive inventory model with a customer's choice probability
2000,
Teraoka Yoshinobu
In this paper we consider a model in which a customer chooses one of two retailers...
An integrated analytical/simulation approach for economic design of an automated guided vehicle system
2000,
Ohno Katsuhisa
This paper proposes an integrated analytical/simulation approach for designing an...
Integer programming model and exact solution for concentrator location problem
2000,
Shiina Takayuki
Topological design of centralized computer networks is an important problem that has...
Multi-facility location problem with nonincreasing piecewise linear demand on a tree
2000,
Nishino Hisakazu
This paper deals with a multi-facility location problem on a tree. Given the number of...
Newton's method for zero points of a matrix function and its applications to queueing models
2000,
Nishimura Shoichi
Let R(z) be a matrix function. We propose modified Newton's method to calculate zero...
Farsighted stability in prisoner's dilemma
2000,
Muto Shigeo
We study players' behavior in the prisoner's dilemma by using two stability notions:...
Ordering of convex fuzzy sets – a brief survey and new results
2000,
Yasuda Masami
Concerning with the topics of a fuzzy max order, a brief survey on ordering of fuzzy...
A survey of algorithms for calculating power indices of weighted majority games
2000,
Matsui Tomomi
For measuring an individual's voting power of a voting game, some power indices are...
A two-person zero-sum game with fractional loss function
2000,
Tanaka Kensuke
In this paper, we investigate a two-person zero-sum game with fractional loss...
On network simplex method using the primal–dual symmetric pivoting rule
2000,
Muramatsu Masakazu
We consider a network simplex method using the primal–dual symmetric pivoting...
Smoothing methods for complementarity problems and their applications: A survey
2000,
Chen Xiaojun
We present an introduction to a class of smoothing methods for complementarity...
On a generalization of the secretary problem with uncertain selection
2000,
Mitsushi Tamaki
The secretary problem with uncertain selection, considered by Smith, is generalized to...
A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs
2000,
Tamura Akihisa
The generalized stable set problem is an extension of the maximum weight stable set...
First Page
9
10
11
12
13
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers