Han Hoogeveen

  • Profile
  • Research
  • Projects

Contents

  • Topics
  • Awards
  • Publications
  • Academic services

Research


Topics

  • Algorithms for scheduling and planning problems
  • Robustness and planning under uncertainty
  • Integer linear programming and column generation
  • Optimization of energy networks
  • Planning in public transportation
  • Planning for veterinary and agricultural applications

Awards

  • Winner of NGI Informatie Scriptieprijs 2013 (Young Talent Computer Science Master's Thesis Award) from Koninklijke Hollandsche Maatschappij der Wetenschappen (Dutch Science Society) Arne Hillbrand, Separating a polygonal environment into a multi-layered environments, supervised by R. Gerearts, J.A. Hoogeveen, J.M. van den Akker. Read more here (dutch).
  • Winner of Master's Thesis Award Science Faculty 2013 and nomination Utrecht Unversity Master's Thesis Award 2013:
    Arne Hillbrand, Separating a polygonal environment into a multi-layered environments, supervised by R. Gerearts, J.A. Hoogeveen, J.M. van den Akker. Read more here (dutch).
  • Nomination for best paper award:
    H.M. Vermeulen, J.A. Hoogeveen, J.M. van den Akker (2011). Solving the no-wait job shop problem: an ILP and CP approach. In P. de Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck & T. Vermeulen (Eds.), Proceedings of the Twenty-Third Benelux Conference on Artificial Intelligence (BNAIC 2011) (pp. 312-319). Gent.

Publications

Book chapters and book reviews

  • J.M. van den Akker, J.A. Hoogeveen, and S.L. van de Velde (2005) Machine Scheduling. In G. Desaulniers, J. Descrosiers, M.M. Solomon (eds.) Column Generation . Springer Science and Business Media, New York, Ch. 11, pp. 303-330.
  • J.M. van den Akker and J.A. Hoogeveen (2004). Minimizing the number of tardy jobs. In J.Y.-T. Leung (ed.) Handbook of Scheduling: Algortihms, Models, and Performance Analysis Chapman Hall/CRC Computer and Information Science Series.
  • J.A. Hoogeveen, J.K. Lenstra, and S.L. van de Velde (1997). Sequencing and scheduling: an annotated bibliography. In: M. Dell'Amico, F. Maffioli, and S. Martello (eds.). Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 181-197.
  • J.A. Hoogeveen (2004). Book review. V. T'kindt and J.-C. Billaut (2004). Multicriteria scheduling: Theory, Models and Algorithms. Journal of scheduling Vol 7, number 1, 93-94.

Conference proceedings (selection)

  • J.M. van den Akker, C.H.M. van Blokland, and J.A. Hoogeveen (2013). Finding robust solutions for the stochastic job shop scheduling problem by including simulation in local search. In: V. Bonifaci et al (Eds.) Symposium on Experimental Algorithms 2013, Lecture Notes in Computer Science 7933, pp. 402-413, Springer.
  • P.C. Bouman, J.M. van den Akker, J.A. Hoogeveen(2011). Recoverable robustness by column generation. In P. de Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck and T. Vermeulen (Eds.), Proceedings of the Twenty-Third Benelux Conference on Artificial Intelligence (BNAIC 2011).
  • H.M. Vermeulen, J.A. Hoogeveen, and J.M. van den Akker (2011). Solving the no-wait job shop problem: an ILP and CP approach. In Tobias Achterberg, J. Christopher Beck (eds.) CPAIOR 2011- Late Breaking Abstracts. ZIB-Report 11-20.
  • J.M. van den Akker, J.A. Hoogeveen, and W. Lauret (2011). Using column generation to solve the edge coloring problem. In Tobias Achterberg, J. Christopher Beck (eds.) CPAIOR 2011- Late Breaking Abstracts. ZIB-Report 11-20.
  • Marjan van den Akker, Roland Gerearts, Han Hoogeveen, Corien Prins (2010). Path planning for groups using column generation. Proceedings of the Third International Conference on Motion in Games (MIG 2010) Springer Lecture Notes on Computer Science 6459.
  • Marnix Kammer, Marjan van den Akker, Han Hoogeveen (2010). Indentifying and exploiting commonalities for the job-shop scheduling problem Proceedings of the 22nd Benelux Conference on Artificial Intelligence (BNIAC 2010).
  • G. Diepen, J. M. van den Akker, and J. A. Hoogeveen (2009). Integrated gate and bus assignment at Amsterdam Airport Schiphol. In Robust and Online Large-Scale Optimization , Lecture Notes in Computer Science, 5868, pages 338-353, 2009.
  • G.Diepen, J.M. van den Akker, and J.A. Hoogeveen (2008). Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. (Extended abstract). Proceedings of the Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008). Dagstuhl Research Online Publication Server (DROPS), http://drops.dagstuhl.de/. PDF.
  • J.M. van den Akker, G. Diepen and J.A. Hoogeveen (2007). A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. P. van Hentenrijck and L. Wolsey (Eds.) Integration of AI and OR Techniques for Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007) . Lecture Notes in Computer Science, Volume 4510, Springer-Verlag Berlin Heidelberg, 376-390.
  • J.M. van den Akker and J.A. Hoogeveen and J.W. van Kempen (2006). Parallel Machine Scheduling Through Column Generation: Minimax Objectives, In Y. Azar and T. Erlebach (eds.), Algorithms ESA 2006 , Lecture Notes in Computer Science, volume 4168, Springer-Verlag Berlin Heidelberg, pp. 648-659.
  • J.A. Hoogeveen, M. Skutella, Gerhard Woeginger (2003). Preemptive scheduling with rejection.Proceedings Algorithms- ESA 2000, Lecture Notes in Computer Science, Vol. 1879, Springer-Verlag Berlin Heidelberg, pp. 268-277.
  • J.M. van den Akker, J.A. Hoogeveen, and N. Vakhania (2000). Restarts can help in on-line minimization of maximum delivery time. Proceedings Algorithms- ESA 2000, Lecture Notes in Computer Science, Vol. 1879, Springer-Verlag Berlin Heidelberg, pp. 427-436.
  • Han Hoogeveen, Petra Schuurman, and Gerhard J. Woeginger (1998). Non-approximability results for scheduling problems with minsum criteria. In: R.E. Bixby, E.A. Boyd, and R.Z. Rios-Mercado (eds.). Proceedings of the sixth International IPCO Conference, Lecture Notes in Computer Science, Vol. 1412, Springer-Verlag, Berlin Heidelberg, 353-366.
  • J.A. Hoogeveen and T. Kawaguchi (1996). Minimizing total completion time in a two-machine flowshop: analysis of special cases. In: W.H. Cunningham, S.T. McCormick, and M. Queyranne (eds.). Proceedings of the fifth International IPCO Conference, Lecture Notes in Computer Science, Vol. 1084, Springer-Verlag Berlin Heidelberg, pp. 374-388.
  • J.A. Hoogeveen and A.P.A. Vestjens (1996). Optimal on-line algorithms for single-machine scheduling. In: W.H. Cunningham, S.T. McCormick, and M. Queyranne (eds.). Proceedings of the fifth International IPCO Conference, Lecture Notes in Computer Science, Vol. 1084, Springer-Verlag Berlin Heidelberg, pp. 404-414.
  • J.A. Hoogeveen and S.L. Van de Velde (1995). Formulating a scheduling problem with almost identical jobs by using positional completion times. In: E. Balas and J. Clausen (eds.) Proceedings 4th International IPCO Conference, Springer LNCS 920, pp. 292-306.
  • J.A. Hoogeveen and S.L. Van de Velde (1993). Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. In: G. Rinaldi and L.A. Wolsey (eds.) Proceedings of the third Internation IPCO Conference, 195-208.
  • J.A. Hoogeveen, H. Oosterhout, and S.L. van de Velde (1992). New lower and upper bounds for scheduling around a small common due date. In: E. Balas, G. Cornuéjols, R. Kannan (eds.), Proceedings of the second Intenational IPCO Conference, Carnegie Mellon University Press, Pittsburgh, pp. 122-135.
  • J.A. Hoogeveen (1990). Minimizing maximum promptness and maximum lateness on a single machine. In: R. Kannan and W.R. Pulleyblank (eds.), Proceedings of the first Intenational IPCO Conference, University of Waterloo Press, Waterloo, pp. 283-296.

Journals

  • G. Diepen, B.F.I. Pieters, J.M. van den Akker, J.A. Hoogeveen (2013). Robust planning of airport platform buses, Computers and Operations Research, , Vol. 40, number 3, pp. 747--757.
  • J.M. van den Akker, J.A. Hoogeveen, J.W. van Kempen (2012). Using column generation to solve parallel machine scheduling problems with minmax objective functions. Journal of Scheduling , Vol. 15, number 6, pp. 801--810.
  • G.Diepen, J.M. van den Akker, J.A. Hoogeveen, J.W. Smeltink (2012). Finding robust assignment of flights to gates at Amsterdam Airport Schiphol. Journal of Scheduling , Vol. 15, number 6, pp. 703-715.
  • J.M. van den Akker, G. Diepen, J.A. Hoogeveen (2010). Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. Journal of Scheduling , Vol 13, Number 6, 561-576.
  • Marjan van den Akker and Han Hoogeveen (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling Volume 11, number 1, pp: 59-70. T.C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger (2006). Scheduling with step-improving processing times. Operations Research Letters Vol. 34, number 1, pp: 37-40.
  • J.A. Hoogeveen, L. van Norden, S.L. van de Velde (2006). Lower bounds for minimizing total completion time in a two-machine flow shop. Journal of Scheduling , Vol 9, number 6, pp: 559-568.
  • Han Hoogeveen (2005). Multicriteria scheduling European Journal of Operational Research Vol 167, number 3, pp. 592-623.
  • A. Vandevelde, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra (2005). Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop. INFORMS Journal on Computing Vol. 17, number 3, pp. 305-320.
  • W. Yu, J.A. Hoogeveen, J.K. Lenstra (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling Vol. 7, number 5, 333-348.
  • Marjan van den Akker, Han Hoogeveen, and Gerhard Woeginger. (2003) The two machine open shop problem: to fit or not to fit, that was the question. Operations Research Letters 31, 219-224.
  • Sixiang Hou and Han Hoogeveen (2003). The three-machine proportionate flow shop problem with unequal machine speeds. Operations Research Letters Vol. 31, 225-231.
  • J.A. Hoogeveen, M. Skutella, Gerhard Woeginger (2003). Preemptive scheduling with rejection. Mathematical Programming B Vol. 94, 361-374.
  • Han Hoogeveen and Gerhard J. Woeginger (2002). Some comments on sequencing with controllable processing times. Computing Vol. 68, number 2, pp. 181-192.
  • J.M. van den Akker, J.A. Hoogeveen, and S.L. van de Velde (2002). Combining column generation and Lagrangean relaxation to solve single-machine common due date scheduling problem. INFORMS Journal on Computing 14 , 37-51.
  • Han Hoogeveen and Steef van de Velde (2001). Scheduling with target start times European Journal of Operational Research Vol. 129, 87-94.
  • Han Hoogeveen and Gerhard J. Woeginger (2001). A very difficult scheduling problem with communication delays. Operations Research Letters Vol. 29, 241-245.
  • Han Hoogeveen, Petra Schuurman, and Gerhard J. Woeginger (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing Vol. 13, 157-168.
  • Han Hoogeveen, Chris N. Potts and Gerhard J. Woeginger (2000). On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters Vol. 27, 193-197.
  • Han Hoogeveen and Arjen Vestjens (2000). A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics Vol. 13, 56-63.
  • W.H.M. Raaymakers and J.A. Hoogeveen (2000). Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing European Journal of Operational Research Vol. 126, 131-151.
  • J.M. van den Akker, J.A. Hoogeveen, and N. Vakhania (2000). Restarts can help in on-line minimization of maximum delivery time. Journal of Scheduling, Vol. 3, November/December 2000, pp. 333-341.
  • Suresh P. Sethi, Chelliah Sriskandarajah, Steef van de Velde, Michael Y. Wang, Han Hoogeveen (1999). Minimizing makespan in a pallet-constrained flowshop. Journal of Scheduling Vol. 2, 115-133.
  • J.A. Hoogeveen and T. Kawaguchi (1999). Minimizing total completion time in a two-machine flowshop: analysis of special cases. Mathematics of Operations Research Vol. 24, 887-910.
  • J.M. van den Akker, J.A. Hoogeveen, and S.L. van de Velde (1999). Parallel machine scheduling by column generation. Operations Research , Vol. 47, No. 6, 862-872.
  • J.A. Hoogeveen and S.L. Van de Velde (1998). Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Mathematical Programming Vol. 82, 273-289.
  • P. Brucker, A. Gladky, J.A. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde (1998). Scheduling a batching machine. Journal of scheduling Vol. 1, 31-54.
  • N.V. Shakhlevich, J.A. Hoogeveen, and M.L. Pinedo (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling Vol. 1, 157-168.
  • J.A. Hoogeveen and S.L. van de Velde (1997). Earliness-tardiness scheduling around almost equal due dates. INFORMS Journal on Computing Vol. 9, 92-99.
  • D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, and D.B. Shmoys (1997). Short shop schedules. Operations Research Vol. 45, 288-294.
  • J.A. Hoogeveen, J.K. Lenstra, and B. Veltman (1996). Minimizing makespan in a multiprocessor flowshop is strongly NP-hard. European Journal on Operational Research Vol. 89, 172-175.
  • J.A. Hoogeveen (1996). Single-machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms Vol. 21, 415-433.
  • J.A. Hoogeveen and S.L. van de Velde (1996). A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing Vol. 8, 402-412.
  • J.A. Hoogeveen (1996). Minimizing maximum promptness and maximum lateness on a single machine Mathematics of Operations Research Vol. 21, number 4, pp. 100-114.
  • J.A. Hoogeveen and S.L. van de Velde (1995). Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters Vol. 17, 205-208.
  • J.A. Hoogeveen and S.L. Van de Velde (1995). Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. Mathematical Programming Vol. 70, 173-190.
  • J.A. Hoogeveen, H. Oosterhout, and S.L. van de Velde (1994). New lower and upper bounds for scheduling around a small common due date. Operations Research Vol. 42, 102-110.
  • J.A. Hoogeveen, J.K. Lenstra, and B. Veltman (1994). Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters Vol. 16, 129-138.
  • J.A. Hoogeveen, S.L. van de Velde, and B. Veltman (1994). Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics Vol. 55, 259-272.
  • J.A. Hoogeveen and S.L. van de Velde (1992). A new lower bound approach for single-machine multicriteria scheduling. Operations Research Letters Vol. 11, number 1, pp. 39-44.
  • J.A. Hoogeveen (1991). Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Operations Research Letters Vol. 10, number 5, pp. 291-295.
  • G. Sierksma and J.A. Hoogeveen (1991). Seven criteria for integer sequences being graphic. Journal of Graph Theory Vol. 15, number 2, pp. 223-231.
  • J.A. Hoogeveen and S.L. van de Velde (1991). Scheduling around a small common due date. European Journal of Operational Research Vol. 55, number 2, pp. 237-242.

Academic services

Membership PhD committees:

  • Arjen Vestjens. On-line machine scheduling. Eindhoven University of Technology. Supervisor Jan Karel Lenstra. I was copromotor.
  • Wenci Yu. The two-machine flow shop problem with delays and the one-machine total tardiness problem. Eindhoven University of Technology. Supervisor Jan Karel Lenstra. I was copromotor.
  • Petra Schuurman. Approximating schedules. Eindhoven University of Technology. Supervisor Jan Karel Lenstra. I was copromotor.
  • Koen De Bontridder. Integrating purchase and production planning Eindhoven University of Technology. Supervisor Jan Karel Lenstra. I was copromotor.
  • On-line scheduling and bin packing Rob van Stee, Leiden University. Supervisors Han La Poutré, Joost Kok.
  • Peter Lennartz. No-wait job shop scheduling Utrecht University. Supervisor Jan van Leeuwen. I was copromotor.
  • Guido Diepen Column generation algorithms for machine scheduling and integrated airport planning. Utrecht University. Supervisor Jan van Leeuwen. I was copromotor.
  • Francis Sourd Ordonnancer Juste-à-temps Université Paris 6 (habilitation thesis).
  • Xiandong Zhang. Scheduling with time lags Erasmus University Rotterdam. Supervisor Steef van de Velde.

 

Membership program committees:

  • Models and Algorithms for Planning and Scheduling Problems (MAPSP), Renesse, June 14-18, 1999 (co-organizer).
  • 21st workshop of the UK Planning & Scheduling SIG, Delft, November 21-22, 2002.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Nottingham, August 17-21, 2003.
  • Models and Algorithms for Planning and Scheduling Problems (MAPSP), Siena, June 6-10, 2005.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), New York, July 18-21, 2005.
  • Multi Objective Programming and Goal Programming (MOPGP): Tours, June 12-14, 2006.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), August 28-31, 2007.
  • FLAIRS-21 (21st International Florida Artificial Intelligence Research Society Conference: Special track on AI Planning and Scheduling, Coconut Grove, Florida, May 15-17, 2008.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Dublin, August 10-12, 2009.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Phoenix, August 9-12, 2011.
  • International Conference on Operations Research and Enterprise Systems (ICORES), Vilamoura, Portugal, February 4-6, 2012.
  • International Conference on Operations Research and Enterprise Systems (ICORES), Barcelona, February 16-18, 2013.
  • Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Ghent, Auugst 27-30, 2013.
  • International Conference on Operations Research and Enterprise Systems (ICORES), Angers, March 6-8, 2013.

 

Editorships

Associate Editor of
  • Operations Research Letters (2002-2006)
  • Journal of scheduling (2002-present)
  • Computers & Operations Research (2004-present)

Copyright (c) 2013 cs.uu.nl All rights reserved. Design by FreeCSSTemplates.org.