default search action
Aart van Harten
Person information
- affiliation: University of Twente, Enschede, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j14]Martijn Mes, Matthieu van der Heijden, Aart van Harten:
Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. Eur. J. Oper. Res. 181(1): 59-75 (2007) - [j13]Marisela Mainegra Hing
, Aart van Harten, P. C. Schuur
Reinforcement learning versus heuristics for order acceptance on a single resource. J. Heuristics 13(2): 167-187 (2007) - 2006
- [j12]Karin S. de Smidt-Destombes, Matthieu van der Heijden, Aart van Harten:
On the interaction between maintenance, spare part inventories and repair capacity for a k. Eur. J. Oper. Res. 174(1): 182-200 (2006) - 2005
- [j11]Andrei Sleptchenko
Using repair priorities to reduce stock investment in spare part networks. Eur. J. Oper. Res. 163(3): 733-750 (2005) - [j10]Mark J. R. Ebben, M. C. van der Heijden, Aart van Harten:
Dynamic transport scheduling under multiple resource constraints. Eur. J. Oper. Res. 167(2): 320-335 (2005) - [j9]Andrei Sleptchenko
An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities. Queueing Syst. Theory Appl. 50(1): 81-107 (2005) - 2004
- [j8]Matthieu van der Heijden, Aart van Harten, Andrei Sleptchenko
Approximations for Markovian multi-class queues with preemptive priorities. Oper. Res. Lett. 32(3): 273-282 (2004) - [j7]Karin S. de Smidt-Destombes, Matthieu van der Heijden, Aart van Harten:
On the availability of a k-out-of-N system given limited spares and repair capacity under a condition based maintenance strategy. Reliab. Eng. Syst. Saf. 83(3): 287-300 (2004) - 2003
- [j6]Andrei Sleptchenko
Trade-off between inventory and repair capacity in spare part networks. J. Oper. Res. Soc. 54(3): 263-272 (2003) - [j5]Aart van Harten, Andrei Sleptchenko
On Markovian Multi-Class, Multi-Server Queueing. Queueing Syst. Theory Appl. 43(4): 307-328 (2003) - 2002
- [j4]M. C. van der Heijden, Aart van Harten, Mark J. R. Ebben, Yvo A. Saanen, Edwin Valentin, Alexander Verbraeck
Using Simulation to Design an Automated Underground System for Transporting Freight Around Schiphol Airport. Interfaces 32(4): 1-19 (2002) - [j3]Matthieu van der Heijden, Mark J. R. Ebben, Noud Gademann
Scheduling vehicles in automated transportation systems Algorithms and case study. OR Spectr. 24(1): 31-58 (2002)
1990 – 1999
- 1998
- [j2]Gerhard C. van Dijkhuizen, Aart van Harten:
Two-stage generalized age maintenance of a queue-like production system. Eur. J. Oper. Res. 108(2): 363-378 (1998)
1980 – 1989
- 1984
- [j1]Aart van Harten:
Singularly perturbed systems of diffusion type and feedback control. Autom. 20(1): 79-91 (1984)
Coauthor Index
aka: M. C. van der Heijden
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:14 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: