Han Hoogeveen

According to our database1, Han Hoogeveen authored at least 66 papers between 1990 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Synchronizing transportation of people with reduced mobility through airport terminals.
Comput. Oper. Res., 2021

Personnel Scheduling on Railway Yards.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

Airport operations management.
OR Spectr., 2019

Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining.
Comput. Ind. Eng., 2019

Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times.
J. Sched., 2018

How to Measure the Robustness of Shunting Plans.
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

Scheduling electric vehicles.
Public Transp., 2017

Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem.
Comput. Oper. Res., 2017

Decomposition approaches for recoverable robust optimization problems.
Eur. J. Oper. Res., 2016

Robust Recoverable Path Using Backup Nodes.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Separating a walkable environment into layers.
Proceedings of the 9th International Conference on Motion in Games, 2016

Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment.
Proceedings of the Combinatorial Optimization and Applications, 2016

Robust planning of airport platform buses.
Comput. Oper. Res., 2013

Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol.
J. Sched., 2012

Using column generation to solve parallel machine scheduling problems with minmax objective functions.
J. Sched., 2012

Minimizing the number of late jobs when the start time of the machine is variable.
Oper. Res. Lett., 2012

Rescheduling for new orders on a single machine with setup times.
Eur. J. Oper. Res., 2012

Identifying and exploiting commonalities for the job-shop scheduling problem.
Comput. Oper. Res., 2011

Recoverable Robustness by Column Generation.
Proceedings of the Algorithms - ESA 2011, 2011

Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs.
J. Sched., 2010

Path Planning for Groups Using Column Generation.
Proceedings of the Motion in Games - Third International Conference, 2010

Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Minimizing the number of late jobs in a stochastic setting using a chance constraint.
J. Sched., 2008

Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.
Proceedings of the ATMOS 2008, 2008

A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Lower bounds for minimizing total completion time in a two-machine flow shop.
J. Sched., 2006

Scheduling with step-improving processing times.
Oper. Res. Lett., 2006

Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions.
Proceedings of the Algorithms, 2006

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.
INFORMS J. Comput., 2005

Multicriteria scheduling.
Eur. J. Oper. Res., 2005

Getting rid of stochasticity: applicable sometimes.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Minimizing the Number of Tardy Jobs.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.
J. Sched., 2004

Book Review.
J. Sched., 2004

The three-machine proportionate flow shop problem with unequal machine speeds.
Oper. Res. Lett., 2003

The two-machine open shop problem: To fit or not to fit, that is the question.
Oper. Res. Lett., 2003

Preemptive scheduling with rejection.
Math. Program., 2003

Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem.
INFORMS J. Comput., 2002

Some Comments on Sequencing with Controllable Processing Times.
Computing, 2002

A very difficult scheduling problem with communication delays.
Oper. Res. Lett., 2001

Non-Approximability Results for Scheduling Problems with Minsum Criteria.
INFORMS J. Comput., 2001

Scheduling with target start times.
Eur. J. Oper. Res., 2001

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.
SIAM J. Discret. Math., 2000

On-line scheduling on a single machine: maximizing the number of early jobs.
Oper. Res. Lett., 2000

Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing.
Eur. J. Oper. Res., 2000

Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine.
Proceedings of the Algorithms, 2000

Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases.
Math. Oper. Res., 1999

Parallel Machine Scheduling by Column Generation.
Oper. Res., 1999

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
Math. Program., 1998

Short Shop Schedules.
Oper. Res., 1997

Earliness-Tardiness Scheduling Around Almost Equal Due Dates.
INFORMS J. Comput., 1997

Minimizing Maximum Promptness and Maximum Lateness on a Single Machine.
Math. Oper. Res., 1996

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

A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time.
INFORMS J. Comput., 1996

Optimal On-Line Algorithms for Single-Machine Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.
Oper. Res. Lett., 1995

Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems.
Math. Program., 1995

Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Three, four, five, six, or the complexity of scheduling with communication delays.
Oper. Res. Lett., 1994

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
Oper. Res., 1994

Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.
Discret. Appl. Math., 1994

A new lower bound approach for single-machine multicriteria scheduling.
Oper. Res. Lett., 1992

Analysis of Christofides' heuristic: Some paths are more difficult than cycles.
Oper. Res. Lett., 1991

Seven criteria for integer sequences being graphic.
J. Graph Theory, 1991

Minimizing Maximum Earliness and Maximum Lateness on a Single Machine.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990