#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1981

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

- Hiroaki Ishii, Toshio Nishida
- Networks
- 1983

- Hiroshi Oiwa, Yoshihiro Ikemoto, Koichi Mandai, Kei Koide, Toshio Nishida, Yasuji Tabe
- Modern rheumatology
- 2005

A 50-year-old man was admitted to hospital for dysphagia. The upper gastrointestinal series revealed esophageal stricture, pyloric stenosis, and hypomotile small intestine. He was diagnosed with systemic sclerosis sine scleroderma with gastrointestinal involvement. After subtotal gastrectomy with Billroth 2 anastomosis, he had recurrent intestinal… (More)

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

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

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

- Tsuneyuki Narnekata, Yoshio Tabata, Toshio Nishida
- 2009

A whaler has some harpoons available for catching whales and finite number of periods to go. The whales are of two kinds, type 1 and type 2; type 1 needs to be hit by the given number of harpoons in order to be caught by the whaler, whereas type 2 needs to be hit by one harpoon. Each type appears with a known probability at each period and produces its… (More)

- Masashi Nakao, Kenji Sato, Toshio Nishida, Toshiaki Tamamura
- IEEE Journal on Selected Areas in Communications
- 1990

The present paper deals with a continuous-time sequential allocation problem in the following context. Consider an m-unit parallel system in which each unit stochastically deteriorates with age. When the system breaks down, all or some failed units are replaced with new units or the failed system is left as it is until the end of planning horizon. As a… (More)