Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. - J. A. Hoogeveen (IPCO, 1990)

Seven criteria for integer sequences being graphic. - Gerard Sierksma; Han Hoogeveen (J. Graph Theory, 1991)

Analysis of Christofides' heuristic: Some paths are more difficult than cycles. - J. A. Hoogeveen (Oper. Res. Lett., 1991)

A new lower bound approach for single-machine multicriteria scheduling. - J. A. Hoogeveen; Steef L. van de Velde (Oper. Res. Lett., 1992)

Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. - J. A. Hoogeveen; Steef L. van de Velde; Bart Veltman (Discret. Appl. Math., 1994)

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. - J. A. Hoogeveen; H. Oosterhout; Steef L. van de Velde (Oper. Res., 1994)

Three, four, five, six, or the complexity of scheduling with communication delays. - J. A. Hoogeveen; Jan Karel Lenstra; Bart Veltman (Oper. Res. Lett., 1994)

Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. - Han Hoogeveen; Steef L. van de Velde (IPCO, 1995)

Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. - J. A. Hoogeveen; Steef L. van de Velde (Math. Program., 1995)

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. - J. A. Hoogeveen; Steef L. van de Velde (Oper. Res. Lett., 1995)

Optimal On-Line Algorithms for Single-Machine Scheduling. - Han Hoogeveen; Arjen P. A. Vestjens (IPCO, 1996)

A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time. - J. A. Hoogeveen; Steef L. van de Velde (INFORMS J. Comput., 1996)

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. - Han Hoogeveen (J. Algorithms, 1996)

Minimizing Maximum Promptness and Maximum Lateness on a Single Machine. - J. A. Hoogeveen (Math. Oper. Res., 1996)

Earliness-Tardiness Scheduling Around Almost Equal Due Dates. - Han Hoogeveen; Steef L. van de Velde (INFORMS J. Comput., 1997)

Short Shop Schedules. - David P. Williamson; Leslie A. Hall; J. A. Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey Vasil'evich Sevast'janov; David B. Shmoys (Oper. Res., 1997)

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. - Han Hoogeveen; Steef L. van de Velde (Math. Program., 1998)

Parallel Machine Scheduling by Column Generation. - J. M. van den Akker; J. A. Hoogeveen; Steef L. van de Velde (Oper. Res., 1999)

Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. - J. A. Hoogeveen; Tsuyoshi Kawaguchi (Math. Oper. Res., 1999)

Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. - Marjan van den Akker 001; Han Hoogeveen; Nodari Vakhania (ESA, 2000)

Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. - Wenny H. M. Raaymakers; J. A. Hoogeveen (Eur. J. Oper. Res., 2000)

On-line scheduling on a single machine: maximizing the number of early jobs. - Han Hoogeveen; Chris N. Potts; Gerhard J. Woeginger (Oper. Res. Lett., 2000)

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine. - Han Hoogeveen; Arjen P. A. Vestjens (SIAM J. Discret. Math., 2000)

Scheduling with target start times. - J. A. Hoogeveen; Steef L. van de Velde (Eur. J. Oper. Res., 2001)

Non-Approximability Results for Scheduling Problems with Minsum Criteria. - Han Hoogeveen; Petra Schuurman; Gerhard J. Woeginger (INFORMS J. Comput., 2001)

A very difficult scheduling problem with communication delays. - Han Hoogeveen; Gerhard J. Woeginger (Oper. Res. Lett., 2001)

Some Comments on Sequencing with Controllable Processing Times. - Han Hoogeveen; Gerhard J. Woeginger (Computing, 2002)

Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem. - Marjan van den Akker 001; Han Hoogeveen; Steef L. van de Velde (INFORMS J. Comput., 2002)

Preemptive scheduling with rejection. - Han Hoogeveen; Martin Skutella; Gerhard J. Woeginger (Math. Program., 2003)

The two-machine open shop problem: To fit or not to fit, that is the question. - Marjan van den Akker 001; Han Hoogeveen; Gerhard J. Woeginger (Oper. Res. Lett., 2003)

The three-machine proportionate flow shop problem with unequal machine speeds. - Sixiang Hou; Han Hoogeveen (Oper. Res. Lett., 2003)

Book Review. - Han Hoogeveen (J. Sched., 2004)

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. - Wenci Yu; Han Hoogeveen; Jan Karel Lenstra (J. Sched., 2004)

Minimizing the Number of Tardy Jobs. - Marjan van den Akker 001; Han Hoogeveen (Handbook of Scheduling, 2004)

Getting rid of stochasticity: applicable sometimes. - Han Hoogeveen; Marjan van den Akker 001 (Algorithms for Optimization with Incomplete Information, 2005)

Multicriteria scheduling. - Han Hoogeveen (Eur. J. Oper. Res., 2005)

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. - Ann Vandevelde; Han Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra (INFORMS J. Comput., 2005)

Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions. - Marjan van den Akker 001; J. A. Hoogeveen; Jules W. van Kempen (ESA, 2006)

Scheduling with step-improving processing times. - T. C. Edwin Cheng; Yong He 014; Han Hoogeveen; Min Ji 001; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

Lower bounds for minimizing total completion time in a two-machine flow shop. - Han Hoogeveen; Linda van Norden; Steef L. van de Velde (J. Sched., 2006)

A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. - J. M. van den Akker; Guido Diepen; J. A. Hoogeveen (CPAIOR, 2007)

Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. - Guido Diepen; Marjan van den Akker 001; Han Hoogeveen (ATMOS, 2008)

Minimizing the number of late jobs in a stochastic setting using a chance constraint. - Marjan van den Akker 001; Han Hoogeveen (J. Sched., 2008)

Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. - Guido Diepen; J. M. van den Akker; J. A. Hoogeveen (Robust and Online Large-Scale Optimization, 2009)

Path Planning for Groups Using Column Generation. - Marjan van den Akker 001; Roland Geraerts; Han Hoogeveen; Corien Prins (MIG, 2010)

Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. - J. M. van den Akker; Guido Diepen; J. A. Hoogeveen (J. Sched., 2010)

Recoverable Robustness by Column Generation. - Paul C. Bouman; J. M. van den Akker; J. A. Hoogeveen (ESA, 2011)

Identifying and exploiting commonalities for the job-shop scheduling problem. - Marnix Kammer; Marjan van den Akker 001; Han Hoogeveen (Comput. Oper. Res., 2011)

Rescheduling for new orders on a single machine with setup times. - Han Hoogeveen; Christophe Lenté; Vincent T'kindt (Eur. J. Oper. Res., 2012)

Minimizing the number of late jobs when the start time of the machine is variable. - Han Hoogeveen; Vincent T'kindt (Oper. Res. Lett., 2012)

Using column generation to solve parallel machine scheduling problems with minmax objective functions. - J. M. van den Akker; J. A. Hoogeveen; Jules W. van Kempen (J. Sched., 2012)

Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. - Guido Diepen; J. M. van den Akker; J. A. Hoogeveen; J. W. Smeltink (J. Sched., 2012)

Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. - Marjan van den Akker 001; Kevin van Blokland; Han Hoogeveen (SEA, 2013)

Robust planning of airport platform buses. - Guido Diepen; Barbara F. I. Pieters; J. M. van den Akker; J. A. Hoogeveen (Comput. Oper. Res., 2013)

Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment. - Arne Hillebrand; Marjan van den Akker 001; Roland Geraerts; Han Hoogeveen (COCOA, 2016)

Separating a walkable environment into layers. - Arne Hillebrand; Marjan van den Akker 001; Roland Geraerts; Han Hoogeveen (MIG, 2016)

Robust Recoverable Path Using Backup Nodes. - Marjan van den Akker 001; Hans L. Bodlaender; Thomas C. van Dijk; Han Hoogeveen; Erik van Ommeren (SOFSEM, 2016)

Decomposition approaches for recoverable robust optimization problems. - J. M. van den Akker; Paul C. Bouman; J. A. Hoogeveen; Denise D. Tönissen (Eur. J. Oper. Res., 2016)

Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. - Denise D. Tönissen; J. M. van den Akker; J. A. Hoogeveen (Comput. Oper. Res., 2017)

Scheduling electric vehicles. - Marcel E. van Kooten Niekerk; J. M. van den Akker; J. A. Hoogeveen (Public Transp., 2017)

How to Measure the Robustness of Shunting Plans. - Roel van den Broek; Han Hoogeveen; Marjan van den Akker 001 (ATMOS, 2018)

Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. - Marjan van den Akker 001; Han Hoogeveen; Judith Stoef (J. Sched., 2018)

Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining. - Han Hoogeveen; Jakub Tomczyk; Tom C. van der Zanden (Comput. Ind. Eng., 2019)

Airport operations management. - Jason A. D. Atkin; Han Hoogeveen; Raik Stolletz (OR Spectr., 2019)

Personnel Scheduling on Railway Yards. - Roel van den Broek; Han Hoogeveen; Marjan van den Akker 001 (ATMOS, 2020)

TORS: A Train Unit Shunting and Servicing Simulator. - Jacobus G. M. van der Linden; Jesse Mulderij; Bob Huisman; Joris W. den Ouden; Marjan van den Akker 001; Han Hoogeveen; Mathijs Michiel de Weerdt (AAMAS, 2021)

Synchronizing transportation of people with reduced mobility through airport terminals. - René van Twist; Marjan van den Akker 001; Han Hoogeveen (Comput. Oper. Res., 2021)

Optimizing bus line platform assignment across bus stations in Utrecht. - Wouter ten Bosch; J. A. Hoogeveen; Marcel E. van Kooten Niekerk (Public Transp., 2022)

A Local Search Algorithm for Train Unit Shunting with Service Scheduling. - Roel van den Broek; Han Hoogeveen; Marjan van den Akker 001; Bob Huisman (Transp. Sci., 2022)

Scheduling Electric Buses with Stochastic Driving Times. - Philip de Bruin; Marjan van den Akker 001; Han Hoogeveen; Marcel E. van Kooten Niekerk (ATMOS, 2023)

The e-VSP Problem: Planning Electric Buses and Drivers. - Han Hoogeveen (ICORES, 2023)

On the complexity of Nurse Rostering problems. - Steven J. M. den Hartog; Han Hoogeveen; Tom C. van der Zanden (Oper. Res. Lett., 2023)

A hybrid local search algorithm for the continuous energy-constrained scheduling problem. - Roel J. J. Brouwer; Marjan van den Akker 001; Han Hoogeveen (J. Sched., 2025)

A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling. - Guido Passage; Marjan van den Akker 001; Han Hoogeveen (J. Heuristics, 2025)