J. A. Hoogeveen

29 papers A 2B 4Journal 22

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Optimizing bus line platform assignment across bus stations in Utrecht. Public Transp. Wouter ten Bosch, J. A. Hoogeveen, Marcel E. van Kooten Niekerk
2017	J	`jnl`	Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. Comput. Oper. Res. Denise D. Tönissen, J. M. van den Akker, J. A. Hoogeveen
2017	J	`jnl`	Scheduling electric vehicles. Public Transp. Marcel E. van Kooten Niekerk, J. M. van den Akker, J. A. Hoogeveen
2016	J	`jnl`	Decomposition approaches for recoverable robust optimization problems. Eur. J. Oper. Res. J. M. van den Akker, Paul C. Bouman, J. A. Hoogeveen, Denise D. Tönissen
2013	J	`jnl`	Robust planning of airport platform buses. Comput. Oper. Res. Guido Diepen, Barbara F. I. Pieters, J. M. van den Akker, J. A. Hoogeveen
2012	J	`jnl`	Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J. Sched. Guido Diepen, J. M. van den Akker, J. A. Hoogeveen, J. W. Smeltink
2012	J	`jnl`	Using column generation to solve parallel machine scheduling problems with minmax objective functions. J. Sched. J. M. van den Akker, J. A. Hoogeveen, Jules W. van Kempen
2011	A	`conf`	Recoverable Robustness by Column Generation. ESA Paul C. Bouman, J. M. van den Akker, J. A. Hoogeveen
2010	J	`jnl`	Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. J. Sched. J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
2009	—	`ch.`	Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. Robust and Online Large-Scale Optimization Guido Diepen, J. M. van den Akker, J. A. Hoogeveen
2007	B	`conf`	A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. CPAIOR J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
2006	A	`conf`	Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions. ESA Marjan van den Akker, J. A. Hoogeveen, Jules W. van Kempen
2001	J	`jnl`	Scheduling with target start times. Eur. J. Oper. Res. J. A. Hoogeveen, Steef L. van de Velde
2000	J	`jnl`	Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur. J. Oper. Res. Wenny H. M. Raaymakers, J. A. Hoogeveen
1999	J	`jnl`	Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. Math. Oper. Res. J. A. Hoogeveen, Tsuyoshi Kawaguchi
1999	J	`jnl`	Parallel Machine Scheduling by Column Generation. Oper. Res. J. M. van den Akker, J. A. Hoogeveen, Steef L. van de Velde
1997	J	`jnl`	Short Shop Schedules. Oper. Res. David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
1996	J	`jnl`	A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time. INFORMS J. Comput. J. A. Hoogeveen, Steef L. van de Velde
1996	J	`jnl`	Minimizing Maximum Promptness and Maximum Lateness on a Single Machine. Math. Oper. Res. J. A. Hoogeveen
1995	J	`jnl`	Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. J. A. Hoogeveen, Steef L. van de Velde
1995	J	`jnl`	Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Math. Program. J. A. Hoogeveen, Steef L. van de Velde
1994	J	`jnl`	Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. Discret. Appl. Math. J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman
1994	J	`jnl`	New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. Oper. Res. J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde
1994	J	`jnl`	Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman
1993	B	`conf`	Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. IPCO J. A. Hoogeveen, Steef L. van de Velde
1992	J	`jnl`	A new lower bound approach for single-machine multicriteria scheduling. Oper. Res. Lett. J. A. Hoogeveen, Steef L. van de Velde
1992	B	`conf`	New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. IPCO J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde
1991	J	`jnl`	Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Oper. Res. Lett. J. A. Hoogeveen
1990	B	`conf`	Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. IPCO J. A. Hoogeveen