J. A. Hoogeveen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2022

Optimizing bus line platform assignment across bus stations in UtrechtWouter ten Bosch, J. A. Hoogeveen, Marcel E. van Kooten Niekerk. pubtrans, 14(2):323-342, 2022. [doi]

2017

Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problemDenise D. Tönissen, J. M. van den Akker, J. A. Hoogeveen. cor, 83:125-139, 2017. [doi]

Scheduling electric vehiclesMarcel E. van Kooten Niekerk, J. M. van den Akker, J. A. Hoogeveen. pubtrans, 9(1-2):155-176, 2017. [doi]

2016

Decomposition approaches for recoverable robust optimization problemsJ. M. van den Akker, Paul C. Bouman, J. A. Hoogeveen, Denise D. Tönissen. eor, 251(3):739-750, 2016. [doi]

2013

Robust planning of airport platform busesGuido Diepen, B. F. I. Pieters, J. M. van den Akker, J. A. Hoogeveen. cor, 40(3):747-757, 2013. [doi]

2012

Finding a robust assignment of flights to gates at Amsterdam Airport SchipholGuido Diepen, J. M. van den Akker, J. A. Hoogeveen, J. W. Smeltink. scheduling, 15(6):703-715, 2012. [doi]

Using column generation to solve parallel machine scheduling problems with minmax objective functionsJ. M. van den Akker, J. A. Hoogeveen, Jules W. van Kempen. scheduling, 15(6):801-810, 2012. [doi]

2011

Recoverable Robustness by Column GenerationP. C. Bouman, J. M. van den Akker, J. A. Hoogeveen. esa 2011: 215-226 [doi]

2010

Minimizing total weighted tardiness on a single machine with release dates and equal-length jobsJ. M. van den Akker, Guido Diepen, J. A. Hoogeveen. scheduling, 13(6):561-576, 2010. [doi]

2009

Integrated Gate and Bus Assignment at Amsterdam Airport SchipholGuido Diepen, J. M. van den Akker, J. A. Hoogeveen. In Ravindra K. Ahuja, Rolf H. MÃ¶hring, Christos D. Zaroliagis, editors, Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Volume 5868 of Lecture Notes in Computer Science, pages 338-353, Springer, 2009. [doi]

2007

A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling ProblemsJ. M. van den Akker, Guido Diepen, J. A. Hoogeveen. cpaior 2007: 376-390 [doi]

2006

Parallel Machine Scheduling Through Column Generation: Minimax Objective FunctionsMarjan van den Akker, J. A. Hoogeveen, Jules W. van Kempen. esa 2006: 648-659 [doi]

2001

Scheduling with target start timesJ. A. Hoogeveen, Steef L. van de Velde. eor, 129(1):87-94, 2001. [doi]

2000

Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealingW. H. M. Raaymakers, J. A. Hoogeveen. eor, 126(1):131-151, 2000. [doi]

1999

Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special CasesJ. A. Hoogeveen, T. Kawaguchi. mor, 24(4):887-910, 1999. [doi]

Parallel Machine Scheduling by Column GenerationJ. M. van den Akker, J. A. Hoogeveen, Steef L. van de Velde. ior, 47(6):862-872, 1999. [doi]

1997

Short Shop SchedulesDavid P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys. ior, 45(2):288-294, 1997. [doi]

1996

A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle TimeJ. A. Hoogeveen, Steef L. van de Velde. informs, 8(4):402-412, 1996. [doi]

Minimizing Maximum Promptness and Maximum Lateness on a Single MachineJ. A. Hoogeveen. mor, 21(1):100-114, 1996. [doi]

1995

Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problemsJ. A. Hoogeveen, Steef L. van de Velde. mp, 70:173-190, 1995. [doi]

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial timeJ. A. Hoogeveen, Steef L. van de Velde. orl, 17(5):205-208, 1995. [doi]

1994

Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor AllocationsJ. A. Hoogeveen, Steef L. van de Velde, Bart Veltman. DAM, 55(3):259-272, 1994. [doi]

Three, four, five, six, or the complexity of scheduling with communication delaysJ. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman. orl, 16(3):129-137, 1994. [doi]

New Lower and Upper Bounds for Scheduling Around a Small Common Due DateJ. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde. ior, 42(1):102-110, 1994. [doi]

1993

Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problemsJ. A. Hoogeveen, Steef L. van de Velde. ipco 1993: 195-208

1992

New Lower and Upper Bounds for Scheduling Around a Small Common Due DateJ. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde. ipco 1992: 122-135

A new lower bound approach for single-machine multicriteria schedulingJ. A. Hoogeveen, Steef L. van de Velde. orl, 11(1):39-44, 1992. [doi]

1991

Analysis of Christofides' heuristic: Some paths are more difficult than cyclesJ. A. Hoogeveen. orl, 10(5):291-295, 1991. [doi]

1990

Minimizing Maximum Earliness and Maximum Lateness on a Single MachineJ. A. Hoogeveen. ipco 1990: 283-295

Sign in or sign up to see more results.

runs on WebDSL