According to our database1, Han Hoogeveen authored at least 66 papers between 1990 and 2021.
Legend:Book In proceedings Article PhD thesis Other
Synchronizing transportation of people with reduced mobility through airport terminals.
Comput. Oper. Res., 2021
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020
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
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018
Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem.
Comput. Oper. Res., 2017
Eur. J. Oper. Res., 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
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
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
J. Sched., 2012
Using column generation to solve parallel machine scheduling problems with minmax objective functions.
J. Sched., 2012
Oper. Res. Lett., 2012
Eur. J. Oper. Res., 2012
Comput. Oper. Res., 2011
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
Proceedings of the Motion in Games - Third International Conference, 2010
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
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
J. Sched., 2006
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
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
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
Oper. Res. Lett., 2003
Oper. Res. Lett., 2003
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem.
INFORMS J. Comput., 2002
Oper. Res. Lett., 2001
INFORMS J. Comput., 2001
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.
SIAM J. Discret. Math., 2000
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
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
Math. Program., 1998
INFORMS J. Comput., 1997
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
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
Oper. Res. Lett., 1994
Oper. Res., 1994
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.
Discret. Appl. Math., 1994
Oper. Res. Lett., 1992
Oper. Res. Lett., 1991
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990