#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1981

2009

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Hiroaki Ishii, Shogo Shiode, Toshio Nishida, Yoshikazu Namasuya
- Discrete Applied Mathematics
- 1981

- Hiroaki Ishii, Toshio Nishida
- Networks
- 1983

- Teruo Masuda, Hiroaki Ishii, Toshio Nishida
- Discrete Applied Mathematics
- 1985

- Hiroaki Ishii, Teruo Masuda, Toshio Nishida
- Discrete Applied Mathematics
- 1987

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)

- Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida
- Math. Program.
- 1982

- Hiroaki Ishii, Charles Martel, Teruo Masuda, Toshio Nishida
- Operations Research
- 1985

- 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)

- Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida
- Discrete Applied Mathematics
- 1983

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)

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)