default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Mizutani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Xufeng Zhao, Satoshi Mizutani, Mingchih Chen, Toshio Nakagawa:
Preventive replacement policies for parallel systems with deviation costs between replacement and failure. Ann. Oper. Res. 312(1): 533-551 (2022)- [j10]Xufeng Zhao
, Qiwang Zheng, Xujie Jia, Cunhua Qian, Satoshi Mizutani, Mingchih Chen:
Periodic and sequential inspection policies with mission failure probabilities. Qual. Reliab. Eng. Int. 38(4): 1539-1557 (2022) - [j9]Xufeng Zhao, Butong Li, Satoshi Mizutani, Toshio Nakagawa:
A Revisit of Age-Based Replacement Models With Exponential Failure Distributions. IEEE Trans. Reliab. 71(4): 1477-1487 (2022) - [c3]Ryohei Horiguchi, Satoshi Mizutani, Shinji Fukuma, Shin-Ichiro Mori:
An Implementation of Interactive Simulation on the Sensable Simulation System:Scube - Case Study I-. SNPD-Summer 2022: 95-100 - 2021
- [j8]Satoshi Mizutani, Xufeng Zhao, Toshio Nakagawa:
Age and periodic replacement policies with two failure modes in general replacement models. Reliab. Eng. Syst. Saf. 214: 107754 (2021) - 2020
- [j7]Satoshi Mizutani, Xufeng Zhao, Toshio Nakagawa:
Which Replacement Is Better at Working Cycles or Number of Failures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(2): 523-532 (2020) - [j6]Kodo Ito, Satoshi Mizutani, Toshio Nakagawa:
Optimal inspection models with minimal repair. Reliab. Eng. Syst. Saf. 201: 106946 (2020)
2010 – 2019
- 2015
- [j5]Xufeng Zhao, Satoshi Mizutani, Toshio Nakagawa:
Which is better for replacement policies with continuous or discrete scheduled times? Eur. J. Oper. Res. 242(2): 477-486 (2015) - [j4]Satoshi Mizutani, Xufeng Zhao, Toshio Nakagawa:
Overtime Replacement Policies with Finite Operating Interval and Number. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2069-2076 (2015) - 2011
- [c2]Satoshi Mizutani, Toshio Nakagawa:
Replacement Policies with Interval of Dual System for System Transition. FGIT-ASEA/DRBC/EL 2011: 362-369 - 2010
- [j3]Toshio Nakagawa, Satoshi Mizutani, Mingchih Chen:
A summary of periodic and random inspection policies. Reliab. Eng. Syst. Saf. 95(8): 906-911 (2010)
2000 – 2009
- 2009
- [j2]Toshio Nakagawa, Satoshi Mizutani:
A summary of maintenance policies for a finite interval. Reliab. Eng. Syst. Saf. 94(1): 89-96 (2009) - 2006
- [j1]Satoshi Mizutani, Toshio Nakagawa, Kodo Ito, Hiroaki Sandoh:
Optimal periodic testing policy for circuit with self-testing. Comput. Math. Appl. 51(2): 363-370 (2006)
1990 – 1999
- 1999
- [c1]Hiroyuki Tarumi, Satoshi Mizutani, Tetsuya Matsuyama, Yahiko Kambayashi:
Simulation of Agent-Based Groupware with Human Factors. DANTE 1999: 343-350
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-25 05:45 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:
