Han Hoogeveen

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 14

Top Topics

Number Of Late Jobs

Stochastic Programming

Finding Optimal

Top Venues

Oper. Res. Lett.

Comput. Oper. Res.

Publications

Han Hoogeveen
The e-VSP Problem: Planning Electric Buses and Drivers. ICORES (2023)
Philip de Bruin, Marjan van den Akker, Han Hoogeveen, Marcel E. van Kooten Niekerk
Scheduling Electric Buses with Stochastic Driving Times. ATMOS (2023)
Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden
On the complexity of Nurse Rostering problems. Oper. Res. Lett. 51 (5) (2023)
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) (2022)
René van Twist, Marjan van den Akker, Han Hoogeveen
Synchronizing transportation of people with reduced mobility through airport terminals. Comput. Oper. Res. 125 (2021)
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)
Roel van den Broek, Han Hoogeveen, Marjan van den Akker
Personnel Scheduling on Railway Yards. ATMOS (2020)
Jason A. D. Atkin, Han Hoogeveen, Raik Stolletz
Airport operations management. OR Spectr. 41 (3) (2019)
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 (2019)
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) (2018)
Roel van den Broek, Han Hoogeveen, Marjan van den Akker
How to Measure the Robustness of Shunting Plans. ATMOS (2018)
Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren
Robust Recoverable Path Using Backup Nodes. SOFSEM (2016)
Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen
Separating a walkable environment into layers. MIG (2016)
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)
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)
Han Hoogeveen, Christophe Lenté, Vincent T'kindt
Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223 (1) (2012)
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) (2012)
Marnix Kammer, Marjan van den Akker, Han Hoogeveen
Identifying and exploiting commonalities for the job-shop scheduling problem. Comput. Oper. Res. 38 (11) (2011)
Marjan van den Akker, Roland Geraerts, Han Hoogeveen, Corien Prins
Path Planning for Groups Using Column Generation. MIG (2010)
Guido Diepen, Marjan van den Akker, Han Hoogeveen
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. ATMOS (2008)
Marjan van den Akker, Han Hoogeveen
Minimizing the number of late jobs in a stochastic setting using a chance constraint. J. Sched. 11 (1) (2008)
T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
Scheduling with step-improving processing times. Oper. Res. Lett. 34 (1) (2006)
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) (2006)
Han Hoogeveen, Marjan van den Akker
Getting rid of stochasticity: applicable sometimes. Algorithms for Optimization with Incomplete Information (2005)
Han Hoogeveen
Multicriteria scheduling. Eur. J. Oper. Res. 167 (3) (2005)
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) (2005)
Han Hoogeveen
Book Review. J. Sched. 7 (1) (2004)
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) (2004)
Sixiang Hou, Han Hoogeveen
The three-machine proportionate flow shop problem with unequal machine speeds. Oper. Res. Lett. 31 (3) (2003)
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) (2003)
Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
Preemptive scheduling with rejection. Math. Program. 94 (2-3) (2003)
Han Hoogeveen, Gerhard J. Woeginger
Some Comments on Sequencing with Controllable Processing Times. Computing 68 (2) (2002)
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) (2002)
Han Hoogeveen, Gerhard J. Woeginger
A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29 (5) (2001)
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13 (2) (2001)
Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
Preemptive Scheduling with Rejection. ESA (2000)
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) (2000)
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)
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) (2000)
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO (1998)
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 (1998)
Han Hoogeveen, Steef L. van de Velde
Earliness-Tardiness Scheduling Around Almost Equal Due Dates. INFORMS J. Comput. 9 (1) (1997)
Han Hoogeveen, Arjen P. A. Vestjens
Optimal On-Line Algorithms for Single-Machine Scheduling. IPCO (1996)
Han Hoogeveen, Tsuyoshi Kawaguchi
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. IPCO (1996)
Han Hoogeveen
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. J. Algorithms 21 (2) (1996)
Han Hoogeveen, Steef L. van de Velde
Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. IPCO (1995)
Gerard Sierksma, Han Hoogeveen
Seven criteria for integer sequences being graphic. J. Graph Theory 15 (2) (1991)