default search action
Katsuhisa Ohno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j19]Katsuhisa Ohno, Toshitaka Boh, Koichi Nakade, Takayoshi Tamura:
New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system. Eur. J. Oper. Res. 249(1): 22-31 (2016) - 2013
- [c3]Xin-Chang Hao, Lin Lin, Mitsuo Gen, Katsuhisa Ohno:
Effective Estimation of Distribution Algorithm for Stochastic Job Shop Scheduling Problem. Complex Adaptive Systems 2013: 102-107 - 2012
- [c2]Lin Lin, Mitsuo Gen, Yan Liang, Katsuhisa Ohno:
A Hybrid EA for Reactive Flexible Job-shop Scheduling. Complex Adaptive Systems 2012: 110-115 - 2011
- [j18]Katsuhisa Ohno:
The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems. Eur. J. Oper. Res. 213(1): 124-133 (2011) - [j17]Masaharu Iwase, Katsuhisa Ohno:
The performance evaluation of a multi-stage JIT production system with stochastic demand and production capacities. Eur. J. Oper. Res. 214(2): 216-222 (2011)
2000 – 2009
- 2004
- [j16]Zhihong Jin
, Katsuhisa Ohno, Jiali Du:
An Efficient Approach for the Three-Dimensional Container Packing Problem with Practical Constraints. Asia Pac. J. Oper. Res. 21(3): 279-296 (2004) - 2003
- [j15]Koichi Nakade, Katsuhisa Ohno:
Separate and carousel type allocations of workers in a U-shaped production line. Eur. J. Oper. Res. 145(2): 403-424 (2003) - 2001
- [j14]Katsuhisa Ohno, Tomonori Ishigaki:
A multi-item continuous review inventory system with compound Poisson demands. Math. Methods Oper. Res. 53(1): 147-165 (2001) - 2000
- [j13]Xiaobo Zhao, Katsuhisa Ohno:
Properties of a sequencing problem for a mixed model assembly line with conveyor stoppages. Eur. J. Oper. Res. 124(3): 560-570 (2000)
1990 – 1999
- 1997
- [j12]Xiaobo Zhao, Katsuhisa Ohno, Koichi Nakade:
Modelling for flexible manufacturing systems and structural properties of optimal work routing policy. J. Intell. Manuf. 8(6): 497-503 (1997) - [j11]Koichi Nakade, Katsuhisa Ohno, J. George Shanthikumar:
Bounds and approximations for cycle times of a U-shaped production line. Oper. Res. Lett. 21(4): 191-200 (1997) - 1996
- [c1]Mitsutoshi Kojima, Katsuhisa Ohno, Kenichi Nakashima:
Performance evaluation of a JIT production system. APMS 1996: 315-326 - 1995
- [j10]Koichi Nakade, Katsuhisa Ohno:
Reversibility and dependence in a U-shaped production line. Queueing Syst. Theory Appl. 21(1-2): 183-197 (1995) - 1994
- [j9]Katsuhisa Ohno, Tomonori Ishigaki, Toshiaki Yoshii:
A new algorithm for a multi-item periodic review inventory system. Math. Methods Oper. Res. 39(3): 349-364 (1994) - 1992
- [j8]Qiu-Sheng Liu, Katsuhisa Ohno, Ushio Sumita:
Structural properties of optimal tool replacement policy in a machining center. Oper. Res. Lett. 11(3): 179-185 (1992) - [j7]Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno:
On the average optimality of circular assignment policy. Queueing Syst. Theory Appl. 11(3): 241-254 (1992) - 1991
- [j6]Paul J. Schweitzer, Ushio Sumita, Katsuhisa Ohno:
Replacement process decomposition for discounted Markov renewal programming. Ann. Oper. Res. 29(1): 631-645 (1991)
1980 – 1989
- 1988
- [j5]Katsuhisa Ohno:
A value iteration method for undiscounted multichain Markov decision processes. ZOR Methods Model. Oper. Res. 32(2): 71-93 (1988) - 1987
- [j4]Katsuhisa Ohno, Kuniyoshi Ichiki:
Computing Optimal Policies for Controlled Tandem Queueing Systems. Oper. Res. 35(1): 121-126 (1987) - 1984
- [j3]Hisashi Mine, Katsuhisa Ohno, Tadayoshi Shioyama:
Delay Analysis of Packet Switching System with a Satellite Having Processing Capability. IEEE Trans. Commun. 32(5): 642-644 (1984)
1970 – 1979
- 1976
- [j2]Hisashi Mine, Katsuhisa Ohno, Takatsugu Koizumi:
Technical Note - A Single-Server Queue with Service Times Depending on the Order of Services. Oper. Res. 24(1): 188-190 (1976) - 1971
- [j1]Hisashi Mine, Katsuhisa Ohno:
An Optimal Rejection Time for an M/G/1 Queuing System. Oper. Res. 19(1): 194-207 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: