default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. M. van den Akker
Person information
- affiliation: Utrecht University, Netherlands
Other persons with the same name
- Marjan van den Akker 0002
![[0000-0002-1022-8637]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1022-8637")
— Goethe University Frankfurt, Department of General Practice, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j23]Rolf N. van Lieshout, J. M. van den Akker, Rafael Mendes Borges, T. Druijf, Egidio Quaglietta:
Microscopic simulation of decentralized dispatching strategies in railways. J. Rail Transp. Plan. Manag. 23: 100335 (2022)- [j22]Mark M. Dekker, Rolf N. van Lieshout, Robin C. Ball, Paul C. Bouman, Stefan C. Dekker, Henk A. Dijkstra, Rob M. P. Goverde, Dennis Huisman, Debabrata Panja, Alfons A. M. Schaafsma, Marjan van den Akker:
A next step in disruption management: combining operations research and complexity science. Public Transp. 14(1): 5-26 (2022) - [j21]Roel van den Broek, Han Hoogeveen, Marjan van den Akker, Bob Huisman:
A Local Search Algorithm for Train Unit Shunting with Service Scheduling. Transp. Sci. 56(1): 141-161 (2022) - 2021
- [j20]René van Twist, Marjan van den Akker, Han Hoogeveen:
Synchronizing transportation of people with reduced mobility through airport terminals. Comput. Oper. Res. 125: 105103 (2021) - 2018
- [j19]Marjan van den Akker, Han Hoogeveen, Judith Stoef:
Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. J. Sched. 21(6): 607-617 (2018) - 2017
- [j18]Denise D. Tönissen, J. M. van den Akker, J. A. Hoogeveen:
Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. Comput. Oper. Res. 83: 125-139 (2017) - [j17]Marcel E. van Kooten Niekerk, J. M. van den Akker, J. A. Hoogeveen:
Scheduling electric vehicles. Public Transp. 9(1-2): 155-176 (2017) - 2016
- [j16]J. M. van den Akker, Paul C. Bouman, J. A. Hoogeveen, Denise D. Tönissen:
Decomposition approaches for recoverable robust optimization problems. Eur. J. Oper. Res. 251(3): 739-750 (2016) - 2013
- [j15]Guido Diepen, Barbara F. I. Pieters, J. M. van den Akker, J. A. Hoogeveen:
Robust planning of airport platform buses. Comput. Oper. Res. 40(3): 747-757 (2013) - [j14]Johan Versendaal, Marjan van den Akker, Xiaochun Xing, Bastiaan de Bevere:
Procurement maturity and IT-alignment models: overview and a case study. Electron. Mark. 23(4): 295-306 (2013) - 2012
- [j13]Guido Diepen, J. M. van den Akker, J. A. Hoogeveen, J. W. Smeltink:
Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J. Sched. 15(6): 703-715 (2012) - [j12]J. M. van den Akker, J. A. Hoogeveen, Jules W. van Kempen:
Using column generation to solve parallel machine scheduling problems with minmax objective functions. J. Sched. 15(6): 801-810 (2012) - 2011
- [j11]Marnix Kammer, Marjan van den Akker, Han Hoogeveen:
Identifying and exploiting commonalities for the job-shop scheduling problem. Comput. Oper. Res. 38(11): 1556-1561 (2011) - 2010
- [j10]Chen Li, Marjan van den Akker, Sjaak Brinkkemper, Guido Diepen:
An integrated approach for requirement selection and scheduling in software release planning. Requir. Eng. 15(4): 375-396 (2010) - [j9]J. M. van den Akker, Guido Diepen, J. A. Hoogeveen:
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. J. Sched. 13(6): 561-576 (2010) - 2008
- [j8]Marjan van den Akker, Sjaak Brinkkemper, Guido Diepen, Johan Versendaal:
Software product release planning through optimization and what-if analysis. Inf. Softw. Technol. 50(1-2): 101-111 (2008) - [j7]Marjan van den Akker, Han Hoogeveen:
Minimizing the number of late jobs in a stochastic setting using a chance constraint. J. Sched. 11(1): 59-69 (2008) - 2003
- [j6]Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger:
The two-machine open shop problem: To fit or not to fit, that is the question. Oper. Res. Lett. 31(3): 219-224 (2003) - 2002
- [j5]Marjan van den Akker, Han Hoogeveen, Steef L. van de Velde:
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem. INFORMS J. Comput. 14(1): 37-51 (2002) - 2000
- [j4]Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh:
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J. Comput. 12(2): 111-124 (2000) - 1999
- [j3]J. M. van den Akker, J. A. Hoogeveen, Steef L. van de Velde:
Parallel Machine Scheduling by Column Generation. Oper. Res. 47(6): 862-872 (1999) - [j2]J. M. van den Akker, C. P. M. van Hoesel, Martin W. P. Savelsbergh:
A polyhedral approach to single-machine scheduling problems. Math. Program. 85(3): 541-572 (1999) - 1990
- [j1]J. M. van den Akker, Jacobus H. Koolen, Rob J. M. Vaessens:
Perfect modes with distinct protective radii. Discret. Math. 81(1): 103-109 (1990)
Conference and Workshop Papers
- 2023
- [c19]Philip de Bruin, Marjan van den Akker, Han Hoogeveen, Marcel E. van Kooten Niekerk:
Scheduling Electric Buses with Stochastic Driving Times. ATMOS 2023: 14:1-14:19 - 2021
- [c18]Jacobus G. M. van der Linden, Jesse Mulderij, Bob Huisman, Joris W. den Ouden, Marjan van den Akker, Han Hoogeveen, Mathijs Michiel de Weerdt:
TORS: A Train Unit Shunting and Servicing Simulator. AAMAS 2021: 1785-1787 - 2020
- [c17]Roel van den Broek, Han Hoogeveen, Marjan van den Akker:
Personnel Scheduling on Railway Yards. ATMOS 2020: 12:1-12:15 - 2018
- [c16]Roel van den Broek, Han Hoogeveen, Marjan van den Akker:
How to Measure the Robustness of Shunting Plans. ATMOS 2018: 3:1-3:13 - 2016
- [c15]Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen:
Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment. COCOA 2016: 311-325 - [c14]Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen:
Separating a walkable environment into layers. MIG 2016: 101-106 - [c13]Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren:
Robust Recoverable Path Using Backup Nodes. SOFSEM 2016: 95-106 - 2013
- [c12]Marjan van den Akker, Kevin van Blokland, Han Hoogeveen:
Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. SEA 2013: 402-413 - 2012
- [c11]J. M. van den Akker, S. L. Leemhuis, G. A. Bloemhof:
Optimizing Storage Placement in Electricity Distribution Networks. OR 2012: 183-188 - 2011
- [c10]Xiaochun Xing, Johan Versendaal, Marjan van den Akker, Bastiaan de Bevere:
Maturity of Operational Procurement in the Construction Industry: A Business/IT-Alignment Perspective. Bled eConference 2011: 22 - [c9]Paul C. Bouman, J. M. van den Akker, J. A. Hoogeveen:
Recoverable Robustness by Column Generation. ESA 2011: 215-226 - 2010
- [c8]Marjan van den Akker, Roland Geraerts, Han Hoogeveen, Corien Prins:
Path Planning for Groups Using Column Generation. MIG 2010: 94-105 - 2008
- [c7]Guido Diepen, Marjan van den Akker, Han Hoogeveen:
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. ATMOS 2008 - 2007
- [c6]J. M. van den Akker, Guido Diepen, J. A. Hoogeveen:
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. CPAIOR 2007: 376-390 - [c5]C. Li, J. M. van den Akker, Sjaak Brinkkemper, Guido Diepen:
Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product. REFSQ 2007: 93-108 - 2006
- [c4]Marjan van den Akker, J. A. Hoogeveen, Jules W. van Kempen:
Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions. ESA 2006: 648-659 - 2005
- [c3]Marjan van den Akker, Sjaak Brinkkemper, Guido Diepen, Johan Versendaal:
Determination of the Next Release of a Software Product: an Approach using Integer Linear Programming. CAiSE Short Paper Proceedings 2005 - 2000
- [c2]Marjan van den Akker, Han Hoogeveen, Nodari Vakhania:
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. ESA 2000: 427-436 - 1996
- [c1]Cees H. M. van Kemenade, J. M. van den Akker, Joost N. Kok:
Evolutionary Air Traffic Flow Management for Large 3D-problems. PPSN 1996: 910-919
Parts in Books or Collections
- 2009
- [p1]Guido Diepen, J. M. van den Akker, J. A. Hoogeveen:
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. Robust and Online Large-Scale Optimization 2009: 338-353
Reference Works
- 2004
- [r1]Marjan van den Akker, Han Hoogeveen:
Minimizing the Number of Tardy Jobs. Handbook of Scheduling 2004
Informal and Other Publications
- 2005
- [i1]Han Hoogeveen, Marjan van den Akker:
Getting rid of stochasticity: applicable sometimes. Algorithms for Optimization with Incomplete Information 2005
Coauthor Index
aka: J. A. Hoogeveen
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:03 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:
