default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan van der Wal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c4]René Haijema, Diana van Dijk, Eligius M. T. Hendrix
, Jan van der Wal:
Simulation to discover structure in optimal dynamic control policies. WSC 2012: 151:1-151:12
2000 – 2009
- 2008
- [j13]Moshe Haviv, Jan van der Wal:
Mean sojourn times for phase-type discriminatory processor sharing systems. Eur. J. Oper. Res. 189(2): 375-386 (2008) - 2007
- [j12]René Haijema, Jan van der Wal, Nico M. van Dijk:
Blood platelet production: Optimization by dynamic programming and simulation. Comput. Oper. Res. 34(3): 760-779 (2007) - [j11]Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Jan van der Wal:
Scheduling-free resource management. Data Knowl. Eng. 61(1): 59-75 (2007) - [j10]Moshe Haviv, Jan van der Wal:
Waiting times in queues with relative priorities. Oper. Res. Lett. 35(5): 591-594 (2007) - 2006
- [j9]Gido A. J. F. Brouns, Jan van der Wal:
Optimal threshold policies in a two-class preemptive priority queue with admission and termination control. Queueing Syst. Theory Appl. 54(1): 21-33 (2006) - 2005
- [c3]Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Jan van der Wal:
The Price of Coordination in Resource Management. Business Process Management 2005: 96-108 - [c2]Nico M. van Dijk, Erik van der Sluis, René Haijema, Assil Al-Ibrahim, Jan van der Wal:
Simulation and or (operations research) in combination for practical optimization. WSC 2005: 274-284 - 2004
- [c1]René Haijema, Jan van der Wal, Nico M. van Dijk:
Blood Platelet Production: a multi-type perishable inventory problem. OR 2004: 84-92 - 2003
- [j8]Richard J. Boucherie, Jan van der Wal:
Transient handover blocking probabilities in road covering cellular mobile networks. Comput. Networks 42(4): 537-550 (2003) - [j7]Gido A. J. F. Brouns, Jan van der Wal:
Optimal threshold policies in a workload model with a variable number of service phases per job. Math. Methods Oper. Res. 58(3): 483-501 (2003) - 2000
- [j6]I. Halachmi, Ivo J. B. F. Adan, Jan van der Wal, J. A. P. Heesterbeek, P. van Beek:
The design of robotic dairy barns using closed queueing networks. Eur. J. Oper. Res. 124(3): 437-446 (2000)
1990 – 1999
- 1994
- [j5]Ivo J. B. F. Adan, Geert-Jan van Houtum, Jan van der Wal:
Upper and lower bounds for the waiting time in the symmetric shortest queue system. Ann. Oper. Res. 48(2): 197-217 (1994)
1980 – 1989
- 1989
- [j4]Ivo J. B. F. Adan, Jan van der Wal:
Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs. Oper. Res. 37(6): 953-957 (1989) - [j3]Nico M. van Dijk, Jan van der Wal:
Simple Bounds and Monotonicity Results for Finite Multi-Server Exponential Tandem Queues. Queueing Syst. Theory Appl. 4(1): 1-15 (1989) - 1987
- [j2]Theodore P. Hill, Jan van der Wal:
Monotonically Improving Limit-Optimal Strategies in Finite-State Decision Processes. Math. Oper. Res. 12(3): 463-473 (1987) - 1984
- [j1]Jan van der Wal:
On Stationary Strategies in Countable State Total Reward Markov Decision Processes. Math. Oper. Res. 9(2): 290-300 (1984)
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:13 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:
