default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenk C. Tijms
Person information
- affiliation: Free University of Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b2]Henk C. Tijms:
A First Course in Probability for Computer and Data Science. WorldScientific 2023, ISBN 9789811271748, pp. 1-244- 2021
- [b1]Henk C. Tijms:
Basic Probability - What Every Math Student Should Know, Second Edition. WorldScientific 2021, ISBN 9789811237492, pp. 1-184
2000 – 2009
- 2002
- [j13]Henk C. Tijms, D. J. van Vuuren:
Markov Processes on a Semi-Infinite Strip and the Geometric Tail Algorithm. Ann. Oper. Res. 113(1-4): 133-140 (2002) - 2000
- [j12]Henk C. Tijms, R. Veldman:
A fast algorithm for the transient reward distribution in continuous-time Markov chains. Oper. Res. Lett. 26(4): 155-158 (2000) - [j11]Rein D. Nobel, Henk C. Tijms:
Optimal control of a queueing system with heterogeneous servers and setup costs. IEEE Trans. Autom. Control. 45(4): 780-784 (2000)
1990 – 1999
- 1999
- [j10]Rein D. Nobel, Henk C. Tijms:
Optimal control for an MX/G/1 queue with two service modes. Eur. J. Oper. Res. 113(3): 610-619 (1999) - 1998
- [j9]Frank N. Gouweleeuw, Henk C. Tijms:
Computing Loss Probabilities in Discrete-Time Queues. Oper. Res. 46(1): 149-154 (1998) - 1992
- [j8]Erwin Kalvelagen, Henk C. Tijms:
ORSTAT: Software for operations research and statistics. Oper. Res. Lett. 12(2): 125-127 (1992)
1980 – 1989
- 1987
- [c2]Henk C. Tijms:
A Quick and Practical Approximation to the Waiting Time Distribution in the Multi-Server Queue with Priorities. Computer Performance and Reliability 1987: 161-169 - 1985
- [j7]Ton de Kok
, Henk C. Tijms:
A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability. Perform. Evaluation 5(2): 77-84 (1985) - 1983
- [j6]Awi Federgruen, Paul J. Schweitzer, Henk C. Tijms:
Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards. Math. Oper. Res. 8(2): 298-313 (1983) - 1982
- [j5]Michiel Harpert van Hoorn, Henk C. Tijms:
Approximations for the waiting time distribution of the M/G/c queue. Perform. Evaluation 2(1): 22-28 (1982)
1970 – 1979
- 1977
- [j4]Henk C. Tijms:
On a switch-over policy for controlling the workload in a queueing system with two constant service rates and fixed switch-over costs. Math. Methods Oper. Res. 21(1): 19-32 (1977) - 1975
- [c1]Henk C. Tijms:
On the Optimality of a Switch- Over Policy for Controlling the Queue Size in an M/G/1 Queue with Varibale Service Rate. Optimization Techniques 1975: 736-742 - 1974
- [j3]Arie Hordijk, Henk C. Tijms:
Technical Note - The Method of Successive Approximations and Markovian Decision Problems. Oper. Res. 22(3): 519-521 (1974) - [j2]Henk C. Tijms:
A Control Policy for a Priority Queue with Removable Server. Oper. Res. 22(4): 833-837 (1974) - [j1]Henk C. Tijms:
An iterative method for approximating average cost optimal (s, S) inventory policies. Z. Oper. Research 18(5): 215-223 (1974)
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 22:58 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:
