Han Hoogeveen - RankMe

51 papers A 3B 6C 8Journal 32Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Scheduling electric vehicles by simulated annealing with recombination through ILP. Public Transp. Wouter ten Bosch, Han Hoogeveen, Marcel E. van Kooten Niekerk, Philip de Bruin
2025	J	`jnl`	A hybrid local search algorithm for the continuous energy-constrained scheduling problem. J. Sched. Roel J. J. Brouwer, Marjan van den Akker, Han Hoogeveen
2025	J	`jnl`	A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling. J. Heuristics Guido Passage, Marjan van den Akker, Han Hoogeveen
2023	J	`jnl`	On the complexity of Nurse Rostering problems. Oper. Res. Lett. Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden
2023	C	`conf`	Scheduling Electric Buses with Stochastic Driving Times. ATMOS Philip de Bruin, Marjan van den Akker, Han Hoogeveen, Marcel E. van Kooten Niekerk
2023	C	`conf`	The e-VSP Problem: Planning Electric Buses and Drivers. ICORES Han Hoogeveen
2022	J	`jnl`	A Local Search Algorithm for Train Unit Shunting with Service Scheduling. Transp. Sci. Roel van den Broek, Han Hoogeveen, Marjan van den Akker, Bob Huisman
2021	J	`jnl`	Synchronizing transportation of people with reduced mobility through airport terminals. Comput. Oper. Res. René van Twist, Marjan van den Akker, Han Hoogeveen
2021	A	`conf`	TORS: A Train Unit Shunting and Servicing Simulator. AAMAS Jacobus G. M. van der Linden, Jesse Mulderij, Bob Huisman, Joris W. den Ouden, Marjan van den Akker, Han Hoogeveen, Mathijs Michiel de Weerdt
2020	C	`conf`	Personnel Scheduling on Railway Yards. ATMOS Roel van den Broek, Han Hoogeveen, Marjan van den Akker
2019	J	`jnl`	Airport operations management. OR Spectr. Jason A. D. Atkin, Han Hoogeveen, Raik Stolletz
2019	J	`jnl`	Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining. Comput. Ind. Eng. Han Hoogeveen, Jakub Tomczyk, Tom C. van der Zanden
2018	J	`jnl`	Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. J. Sched. Marjan van den Akker, Han Hoogeveen, Judith Stoef
2018	C	`conf`	How to Measure the Robustness of Shunting Plans. ATMOS Roel van den Broek, Han Hoogeveen, Marjan van den Akker
2016	C	`conf`	Performing Multicut on Walkable Environments - Obtaining a Minimally Connected Multi-layered Environment from a Walkable Environment. COCOA Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen
2016	B	`conf`	Robust Recoverable Path Using Backup Nodes. SOFSEM Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren
2016	C	`conf`	Separating a walkable environment into layers. MIG Arne Hillebrand, Marjan van den Akker, Roland Geraerts, Han Hoogeveen
2013	B	`conf`	Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. SEA Marjan van den Akker, Kevin van Blokland, Han Hoogeveen
2012	J	`jnl`	Minimizing the number of late jobs when the start time of the machine is variable. Oper. Res. Lett. Han Hoogeveen, Vincent T'kindt
2012	J	`jnl`	Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. Han Hoogeveen, Christophe Lenté, Vincent T'kindt
2011	J	`jnl`	Identifying and exploiting commonalities for the job-shop scheduling problem. Comput. Oper. Res. Marnix Kammer, Marjan van den Akker, Han Hoogeveen
2010	C	`conf`	Path Planning for Groups Using Column Generation. MIG Marjan van den Akker, Roland Geraerts, Han Hoogeveen, Corien Prins
2008	C	`conf`	Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. ATMOS Guido Diepen, Marjan van den Akker, Han Hoogeveen
2008	J	`jnl`	Minimizing the number of late jobs in a stochastic setting using a chance constraint. J. Sched. Marjan van den Akker, Han Hoogeveen
2006	J	`jnl`	Lower bounds for minimizing total completion time in a two-machine flow shop. J. Sched. Han Hoogeveen, Linda van Norden, Steef L. van de Velde
2006	J	`jnl`	Scheduling with step-improving processing times. Oper. Res. Lett. T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
2005	—	`conf`	Getting rid of stochasticity: applicable sometimes. Algorithms for Optimization with Incomplete Information Han Hoogeveen, Marjan van den Akker
2005	J	`jnl`	Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS J. Comput. Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra
2005	J	`jnl`	Multicriteria scheduling. Eur. J. Oper. Res. Han Hoogeveen
2004	J	`jnl`	Book Review. J. Sched. Han Hoogeveen
2004	J	`jnl`	Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Sched. Wenci Yu, Han Hoogeveen, Jan Karel Lenstra
2004	—	`ch.`	Minimizing the Number of Tardy Jobs. Handbook of Scheduling Marjan van den Akker, Han Hoogeveen
2003	J	`jnl`	Preemptive scheduling with rejection. Math. Program. Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2003	J	`jnl`	The three-machine proportionate flow shop problem with unequal machine speeds. Oper. Res. Lett. Sixiang Hou, Han Hoogeveen
2003	J	`jnl`	The two-machine open shop problem: To fit or not to fit, that is the question. Oper. Res. Lett. Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger
2002	J	`jnl`	Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem. INFORMS J. Comput. Marjan van den Akker, Han Hoogeveen, Steef L. van de Velde
2002	J	`jnl`	Some Comments on Sequencing with Controllable Processing Times. Computing Han Hoogeveen, Gerhard J. Woeginger
2001	J	`jnl`	A very difficult scheduling problem with communication delays. Oper. Res. Lett. Han Hoogeveen, Gerhard J. Woeginger
2001	J	`jnl`	Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
2000	J	`jnl`	A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine. SIAM J. Discret. Math. Han Hoogeveen, Arjen P. A. Vestjens
2000	J	`jnl`	On-line scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
2000	A	`conf`	Preemptive Scheduling with Rejection. ESA Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2000	A	`conf`	Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. ESA Marjan van den Akker, Han Hoogeveen, Nodari Vakhania
1998	B	`conf`	Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
1998	J	`jnl`	Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Math. Program. Han Hoogeveen, Steef L. van de Velde
1997	J	`jnl`	Earliness-Tardiness Scheduling Around Almost Equal Due Dates. INFORMS J. Comput. Han Hoogeveen, Steef L. van de Velde
1996	B	`conf`	Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. IPCO Han Hoogeveen, Tsuyoshi Kawaguchi
1996	B	`conf`	Optimal On-Line Algorithms for Single-Machine Scheduling. IPCO Han Hoogeveen, Arjen P. A. Vestjens
1996	J	`jnl`	Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. J. Algorithms Han Hoogeveen
1995	B	`conf`	Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. IPCO Han Hoogeveen, Steef L. van de Velde
1991	J	`jnl`	Seven criteria for integer sequences being graphic. J. Graph Theory Gerard Sierksma, Han Hoogeveen