default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHan Hoogeveen
Person information
- affiliation: Utrecht University, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j51]Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden
:
On the complexity of Nurse Rostering problems. Oper. Res. Lett. 51(5): 483-487 (2023)- [c23]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 - [c22]Han Hoogeveen:
The e-VSP Problem: Planning Electric Buses and Drivers. ICORES 2023: 5 - 2022
- [j50]Wouter ten Bosch, J. A. Hoogeveen, Marcel E. van Kooten Niekerk:
Optimizing bus line platform assignment across bus stations in Utrecht. Public Transp. 14(2): 323-342 (2022) - [j49]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
- [j48]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) - [c21]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
- [c20]Roel van den Broek, Han Hoogeveen, Marjan van den Akker:
Personnel Scheduling on Railway Yards. ATMOS 2020: 12:1-12:15
2010 – 2019
- 2019
- [j47]Han Hoogeveen, Jakub Tomczyk, Tom C. van der Zanden:
Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining. Comput. Ind. Eng. 127: 39-44 (2019) - [j46]Jason A. D. Atkin, Han Hoogeveen, Raik Stolletz:
Airport operations management. OR Spectr. 41(3): 613-614 (2019) - 2018
- [j45]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) - [c19]Roel van den Broek, Han Hoogeveen, Marjan van den Akker:
How to Measure the Robustness of Shunting Plans. ATMOS 2018: 3:1-3:13 - 2017
- [j44]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) - [j43]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
- [j42]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) - [c18]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 - [c17]Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen:
Separating a walkable environment into layers. MIG 2016: 101-106 - [c16]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
- [j41]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) - [c15]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
- [j40]Han Hoogeveen, Christophe Lenté, Vincent T'kindt:
Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223(1): 40-46 (2012) - [j39]Han Hoogeveen, Vincent T'kindt:
Minimizing the number of late jobs when the start time of the machine is variable. Oper. Res. Lett. 40(5): 353-355 (2012) - [j38]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) - [j37]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
- [j36]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) - [c14]Paul C. Bouman, J. M. van den Akker, J. A. Hoogeveen:
Recoverable Robustness by Column Generation. ESA 2011: 215-226 - 2010
- [j35]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) - [c13]Marjan van den Akker, Roland Geraerts, Han Hoogeveen, Corien Prins:
Path Planning for Groups Using Column Generation. MIG 2010: 94-105
2000 – 2009
- 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 - 2008
- [j34]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) - [c12]Guido Diepen, Marjan van den Akker, Han Hoogeveen:
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. ATMOS 2008 - 2007
- [c11]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 - 2006
- [j33]T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger:
Scheduling with step-improving processing times. Oper. Res. Lett. 34(1): 37-40 (2006) - [j32]Han Hoogeveen, Linda van Norden, Steef L. van de Velde:
Lower bounds for minimizing total completion time in a two-machine flow shop. J. Sched. 9(6): 559-568 (2006) - [c10]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
- [j31]Han Hoogeveen:
Multicriteria scheduling. Eur. J. Oper. Res. 167(3): 592-623 (2005) - [j30]Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra:
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. 17(3): 305-320 (2005) - [i1]Han Hoogeveen, Marjan van den Akker:
Getting rid of stochasticity: applicable sometimes. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j29]Han Hoogeveen:
Book Review. J. Sched. 7(1): 93-94 (2004) - [j28]Wenci Yu, Han Hoogeveen, Jan Karel Lenstra:
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Sched. 7(5): 333-348 (2004) - [r1]Marjan van den Akker, Han Hoogeveen:
Minimizing the Number of Tardy Jobs. Handbook of Scheduling 2004 - 2003
- [j27]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive scheduling with rejection. Math. Program. 94(2-3): 361-374 (2003) - [j26]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) - [j25]Sixiang Hou, Han Hoogeveen:
The three-machine proportionate flow shop problem with unequal machine speeds. Oper. Res. Lett. 31(3): 225-231 (2003) - 2002
- [j24]Han Hoogeveen, Gerhard J. Woeginger:
Some Comments on Sequencing with Controllable Processing Times. Computing 68(2): 181-192 (2002) - [j23]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) - 2001
- [j22]J. A. Hoogeveen, Steef L. van de Velde:
Scheduling with target start times. Eur. J. Oper. Res. 129(1): 87-94 (2001) - [j21]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13(2): 157-168 (2001) - [j20]Han Hoogeveen, Gerhard J. Woeginger:
A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29(5): 241-245 (2001) - 2000
- [j19]Wenny H. M. Raaymakers, J. A. Hoogeveen:
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur. J. Oper. Res. 126(1): 131-151 (2000) - [j18]Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger:
On-line scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. 27(5): 193-197 (2000) - [j17]Han Hoogeveen, Arjen P. A. Vestjens:
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine. SIAM J. Discret. Math. 13(1): 56-63 (2000) - [c9]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive Scheduling with Rejection. ESA 2000: 268-277 - [c8]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
1990 – 1999
- 1999
- [j16]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) - [j15]J. A. Hoogeveen, Tsuyoshi Kawaguchi:
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. Math. Oper. Res. 24(4): 887-910 (1999) - 1998
- [j14]Han Hoogeveen, Steef L. van de Velde:
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Math. Program. 82: 273-289 (1998) - [c7]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO 1998: 353-366 - 1997
- [j13]Han Hoogeveen, Steef L. van de Velde:
Earliness-Tardiness Scheduling Around Almost Equal Due Dates. INFORMS J. Comput. 9(1): 92-99 (1997) - [j12]David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys:
Short Shop Schedules. Oper. Res. 45(2): 288-294 (1997) - 1996
- [j11]J. A. Hoogeveen, Steef L. van de Velde:
A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time. INFORMS J. Comput. 8(4): 402-412 (1996) - [j10]Han Hoogeveen:
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. J. Algorithms 21(2): 415-433 (1996) - [j9]J. A. Hoogeveen:
Minimizing Maximum Promptness and Maximum Lateness on a Single Machine. Math. Oper. Res. 21(1): 100-114 (1996) - [c6]Han Hoogeveen, Tsuyoshi Kawaguchi:
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. IPCO 1996: 374-388 - [c5]Han Hoogeveen, Arjen P. A. Vestjens:
Optimal On-Line Algorithms for Single-Machine Scheduling. IPCO 1996: 404-414 - 1995
- [j8]J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Math. Program. 70: 173-190 (1995) - [j7]J. A. Hoogeveen, Steef L. van de Velde:
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17(5): 205-208 (1995) - [c4]Han Hoogeveen, Steef L. van de Velde:
Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. IPCO 1995: 292-306 - 1994
- [j6]J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman:
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. Discret. Appl. Math. 55(3): 259-272 (1994) - [j5]J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. Oper. Res. 42(1): 102-110 (1994) - [j4]J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman:
Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16(3): 129-137 (1994) - 1993
- [c3]J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. IPCO 1993: 195-208 - 1992
- [j3]J. A. Hoogeveen, Steef L. van de Velde:
A new lower bound approach for single-machine multicriteria scheduling. Oper. Res. Lett. 11(1): 39-44 (1992) - [c2]J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. IPCO 1992: 122-135 - 1991
- [j2]Gerard Sierksma, Han Hoogeveen:
Seven criteria for integer sequences being graphic. J. Graph Theory 15(2): 223-231 (1991) - [j1]J. A. Hoogeveen:
Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Oper. Res. Lett. 10(5): 291-295 (1991) - 1990
- [c1]J. A. Hoogeveen:
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. IPCO 1990: 283-295
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 2025-01-21 00:17 CET 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:
