#### Filter Results:

#### Publication Year

1982

2009

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two… (More)

- Hiroaki Ishii, Toshio Nishida, Yasunori Nanbu
- 2009

This paper considers a generalized chance constraint programming problem having a controllable probability level Cl. with which the chance constraint should be satisfied. Several properties of this problem are derived and, based on these properties, an algorithm is also proposed. 1. I ntroduct; on Many types of chance constrained programming problem have… (More)

- Fumio Ohi, Toshio Nishida
- 2009

In the reliability theory th,e joint life distribution of units is usually derived under the assumption of stochastic independence for the behavior of units. But it is seen in the practical situation that the stochastic dependence arises by the cause of putting the units in a same environment and so on. A shock model is used to formulate the joint life… (More)

The object of this paper is to investigate the impact of uncertainty in a dynamic j ob search model where the states of the economy follow a Markov chain and the cost of search does not only depend on the state but on the period. Especially, we explore whether or not increasing the uncertainty about the states of the economy, the wage distribution, the… (More)

- Noboru Yanagawa, Toshio Nishida
- 2009

The pivotal decomposition theorem of the reliability function is applied to the stochastic nNwork. A graphical observation of the theorem always yields more effective result than that of algebraic aspects, that is, the well· selected pivot arc enables the resulting network to contain modules. Our theorem 1 assures that, and our algorithms will be helpful to… (More)

Consider the problem of sequencing n jobs with general precedence constraints on a single machine to minimize total weighted completion time, which is NP-complete. However some class of problems can be solved in polynomial time, i.e .. the problems whose precedence constraints are trees or series parallel. This paper proposes an O(n4) algorithm for… (More)

We give a procedure of solving the weighted minimax flow problem in a polynomial time. The procedure utilizes the capacity modification technique and the binary search method. 1. I NTRODUCTI ON We have considered variants of the maximum flow problems [5,6]. [5] discusses a minimax flo1N, i.e., the flow which minimizes the maximum arc-flow value among all… (More)