Akker, J.M. van den, Dijk, T.C. van, Hoogeveen, J.A. & Toorop, T. (2011). Optimizing wireless sensor network flow by column generation. In 24th Conference of the European Chapter on Combinatorial Optimization (ECCO).
|
Akker, J.M. van den, Geraerts, R.J., Hoogeveen, J.A. & Prins, C.J. (2011). Path Planning in Games. In 10th Workshop on Models and Algorithms for Planning and Scheduling Problems. Nymburk, Czech Republic.
|
Bouman, P.C., Akker, J.M. van den & Hoogeveen, J.A. (2011). Recoverable robustness by column generation. : Department of Information and Computing Sciences, Utrecht University.
|
Bouman, P.C., Akker, J.M. van den & Hoogeveen, J.A. (2011). Recoverable robustness by column generation. In P. de Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck & T. Vermeulen (Eds.), Proceedings of the Twenty-Third Benelux Conference on Artificial Intelligence. Gent.
|
Bouman, P.C., Akker, J.M. van den & Hoogeveen, J.A. (2011). Recoverable robustness by column generation. In Demetrescu and Halldorsson (Ed.), Algorithms ESA 2011 Vol. 6942. Lecture Notes in Computer Science (pp. 215-226). Springer.
|
Vermeulen, H.M., Hoogeveen, J.A. & Akker, J.M. van den (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 (pp. 312-319). Gent.
|
Vermeulen, H., Hoogeveen, J.A. & Akker, J.M. van den (2011). Solving the no-wait job shop problem: an ILP and CP approach. In T. Achterberg & J.C. Beck (Eds.), CPAIOR 2011-Late Breaking Abstracs (pp. 44-46). Berlin.
|
Hoogeveen, J.A., Akker, J.M. van den & Lauret, Wouter (2011). Using column generation to solve the edge coloring problem. In T. Achterberg & C. Beck (Eds.), CPAIOR 2011 Late breaking abstracts (pp. 38-40). Berlijn.
|
Kammer, M.L., Akker, J.M. van den & Hoogeveen, J.A. (2010). Identifying and exploiting commonalities for the job-shop scheduling problem. In Proceedings of the 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010). Luxembourg.
|
Kammer, M.L., Hoogeveen, J.A. & Akker, J.M. van den (2010). Identifying and exploiting commonalities for the job-shop scheduling problem. : Department of Information and Computing Sciences, Utrecht University.
|
Hoogeveen, J.A. & T'kindt, V. (2010). Minimizing the late number of jobs when the start time of the machine is variable. In 12th International Conference on Project Management and Scheduling (pp. 235-238). Tours.
|
Akker, J.M. van den, Diepen, G. & Hoogeveen, J.A. (2010). Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. Journal of Scheduling, 13(6), 561-576.
|
Akker, J.M. van den, Kooten-Niekerk, M. van & Hoogeveen, J.A. (2010). Optimizing depot locations based on a public transportation timetable. In Proceeding of the 24th European Conference on Operational Research. Lissabon.
|
Akker, M. van den, Geraerts, R.J., Hoogeveen, J.A. & Prins, C. (2010). Path Planning for Groups using Column Generation. : Department of Information and Computing Sciences, Utrecht University.
|
Akker, J.M. van den, Geraerts, R.J., Hoogeveen, J.A. & Prins, C. (2010). Path Planning for Groups using Column Generation. In Proceeding of the Third International Conference on Motion in Games (MIG 2010) Vol. 6459. Lecture Notes in Computer Science. Springer.
|
Diepen, G., Akker, J.M. van den & Hoogeveen, J.A. (2009). Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol. In R.K. Ahuja, R.H. Möhring & C.D. Zaroliagis (Eds.), Robust and Online Large-Scale Optimization (Lecture Notes in Computer Science, 5868) (pp. 338-353). Springer.
|
Akker, J.M. van den, Diepen, G. & Hoogeveen, J.A. (2009). More Efficient Algorithms for Resource Constrained Project Scheduling. In Models and Algorithms for Planning and Scheduling Problems.
|
Hoogeveen, J.A., Lenté, C. & T'kindt, V. (2009). Rescheduling for New Orders on a Single Machine with Setup Times. In 13th IFAC Symposium on Information Control Problems in Manufacturing.
|
Diepen, G., Pieters, B.F.I., Akker, J.M. van den & Hoogeveen, J.A. (2009). Robust Planning of Airport Platform Buses. UU-CS 2009-026. onbekend: UU BETA ICS Departement Informatica.
|
Hoogeveen, J.A., Akker, J.M. van den & Kammer, M.H.L. (2009). Simulated annealing with commonalities for the job shop scheduling problem. In Models and Algorithms for Planning and Scheduling Problems.
|
Akker, J.M. van den, Diepen, G. & Hoogeveen, J.A. (2008). Integrated gate and bus assignment at Amsterdam Airport Schiphol. In International Workshop on Column Generation 2008.
|
Diepen, G., Akker, J.M. van den & Hoogeveen, J.A. (2008). Integrated gate and bus assignment at Amsterdam Airport Schiphol. UU-CS 2008-041. onbekend: UU WINFI Informatica en Informatiekunde.
|
Diepen, G., Akker, J.M. van den & Hoogeveen, J.A. (2008). Integrated gate and bus assignment at Amsterdam Airport Schiphol (Extended abstract). In Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008)..
|
Akker, J.M. van den & Hoogeveen, J.A. (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling, 11(1), 59-70.
|
Akker, J.M. van den, Diepen, G., Hoogeveen, J.A. & Smeltink, J.W. (2007). A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. UU-CS 2007-005. onbekend: UU WINFI Informatica en Informatiekunde.
|
Akker, J.M. van den, Diepen, G. & Hoogeveen, J.A. (2007). A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. In P. van Hentenrijck & L. Wolsey (Eds.), Integration of AI and OR Techniques for Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007) Vol. 4510. Lecture Notes in Computer Science (pp. 376-390). Springer-Verlag Berlin Heidelberg.
|
Hoogeveen, J.A. & Wijgers, R. (2007). A column generation approach for examination timetabling. UU-CS 2007-002. onbekend: UU WINFI Informatica en Informatiekunde.
|
Hoogeveen, J.A. & Penninkx, E. (2007). Finding Near-Optimal Rosters Using Column Generation. UU-CS 2007-001. onbekend: UU WINFI Informatica en Informatiekunde.
|
Hoogeveen, J.A. & Penninkx, E. (2007). Finding near optimal schedules using column generation. In E. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 437-438). Brno: Masaryk University.
|
Hoogeveen, J.A., Norden, L. & Velde, S.L. van de (2007). Lower bounds for minimizing total completion time in a two-machine flow shop. Journal of Scheduling, 9, 559.
|
Diepen, G., Akker, J.M. van den & Hoogeveen, J.A. (2007). Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. In 8th Workshop on Models and Algorithms for Planning and Scheduling Problems.
|
Hoogeveen, J.A., Cheng, T.C.E., He, Y., Ji, M. & Woeginger, G.J. (2007). Scheduling with step-improving processing times. Operations Research Letters, 34, 37-40.
|
Diepen, G., Akker, J.M. van den, Hoogeveen, J.A. & Smeltink, J.W. (2007). Using column generation for gate planning at Amsterdam Airport Schiphol. UU-CS 2007-018. onbekend: UU WINFI Informatica en Informatiekunde.
|
Akker, J.M. van den, Hoogeveen, J.A. & Kempen, J.M. van (2007). Using column generation to solve parallel machine scheduling problems with minmax objective functions. In 8th Workshop on Models and Algorithms for Planning and Scheduling Problems.
|
Akker, J.M. van den, Hoogeveen, J.A. & Kempen, J.W. van (2006). Parallel Machine Scheduling Through Column Generation: Minimax Objectives (extendedn abstract). In Y. Azar & T. Erlebach (Eds.), ESA 2006 (pp. 648-659).
|
Diepen, G., Akker, J.M. van den, Hoogeveen, J.A. & Smeltink, J.W. (2006). Using column generation to plan gates and buses at Amsterdam Airport Schiphol. In 10th International Conference on Computer-Aided Scheduling of Public Transport.
|
Akker, J.M. van den, Hoogeveen, J.A. & Velde, S.L. van de (2005). Applying column generation to machine scheduling. In G. Desaulniers, J. Desrosiers & M.M. Solomon (Eds.), Column generation (Gerad) (pp. 303-331). New York: Springer-Verlag.
|
Vandevelde, A., Hoogeveen, J.A., Hurkens, C.A.J. & Lenstra, J.K. (2005). Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop. INFORMS Journal on Computing, 17(3), 305-320.
|
Diepen, G., Akker, J.M. van den & Hoogeveen, J.A. (2005). Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. CS-UU 2005-054. onbekend: UU WINFI Informatica en Informatiekunde.
|
Hoogeveen, J.A. (2005). Multicriteria scheduling. European Journal of Operational Research, 167(3), 592-623.
|
Akker, J.M. van den, Hoogeveen, J.A. & Kempen, J.W. van (2005). Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines and/or generalized precedence constraints. CS-UU 2005-27. onbekend: UU WINFI Informatica en Informatiekunde.
|
Diepen, G., Akker, J.M. van den, Hoogeveen, J.A. & Smeltink, J.W. (2005). Solving the gate-assignment problem using column generation. In 7th Workshop on Models and Algorithms for Planning and Scheduling.
|
Yu, W., Hoogeveen, J.A. & Lenstra, J.K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333-348.
|
Akker, J.M. van den & Hoogeveen, J.A. (2004). Minimizing the Number of Tardy Jobs. In J.Y.-T. Leung (Ed.), Handbook of Scheduling, Algorithms, Models and Performance Analysis (Computer and Information Science Series). Chapman & Hall.
|
Akker, J.M. van den & Hoogeveen, J.A. (2004). Minimizing the number of late jobs in case of stochastic processing times with minimum succes probabilities. UU-CS 2004-67. Utrecht: Utrecht University: Information and Computing Sciences.
|
Akker, J.M. van den, Hoogeveen, J.A. & Velde, S.L. van de (2002). Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem. INFORMS Journal on Computing, 14, 37-51.
|
Hoogeveen, J.A. & Woeginger, G.J. (2002). Some comments on sequencing with controllable processing times. Computing, 68, 181-192.
|
Hoogeveen, J.A. & Woeginger, G.J. (2001). A very difficult scheduling problem with communication delays. Operations Research Letters, 29, 241-245.
|
Hoogeveen, J.A., Schuurman, P. & Woeginger, G.J. (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing, 13, 157-168.
|
Hoogeveen, J.A. (2001, November 21). Produce or procure: How many jobs can you get on time in an uncertain environment ? Eindhoven, The Netherlands, Voordracht in de BETA Workshop on supply chain optimization.
|
Hoogeveen, J.A. (Ed.). (2001). Journal of Scheduling.
|
Hoogeveen, J.A. (Ed.). (2001). Operations Research Letters.
|
Hoogeveen, J.A. (2001, June 18). The three-machine proportionate flow shop problem with unequal machine speeds. Aussois, France, Voordracht op conferentie Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP'01.
|
Hou, S. & Hoogeveen, J.A. (2001). The three-machine proportionate flow shop problem with unequal machine speeds. In Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems MAPSP'01. Aussois, France.
|
Hoogeveen, J.A. & Vestjens, A.P.A. (2000). A best possible deterministic on-line algorithm for minimizing maximum. SIAM Journal on Discrete Mathematics, 13, 56-63.
|
Hoogeveen, J.A. (2000, April 19). Minimizing makespan in a pallet-constrained flowhop. Osnabrueck (Duitsland), Conferentie Seventh International workshop on project management and scheduling.
|
Hoogeveen, J.A., Potts, C.N. & Woeginger, G.J. (2000). On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters, 27, 193-198.
|
Hoogeveen, J.A., Skutella, M. & Woeginger, G.J. (2000). Preemptive scheduling with rejection. In M. Patterson (Ed.), Proceedings 8th Annual European Symposium on Algorithms, ESA 2000 (pp. 268-277). Berlin, Germany: Springer-Verlag.
|
Akker, J.M. van den, Hoogeveen, J.A. & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3, 333-342.
|
Hoogeveen, J.A. (2000, June 14). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Eindhoven, Wiskunde seminar.
|
Akker, J.M. van den, Hoogeveen, J.A. & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. In M. Paterson (Ed.), Proceedings ESA 2000 (pp. 427-436). Springer-Verlag.
|
Raaymakers, W.H.M. & Hoogeveen, J.A. (2000). Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 126, 131-151.
|
Hoogeveen, J.A. (Ed.). (2000). Journal of Scheduling.
|
Hoogeveen, J.A. (Ed.). (2000). Operations Research Letters.
|
Sethi, S.P., Sriskandarajah, C., Velde, S.L. van de, Wang, M.Y. & Hoogeveen, J.A. (1999). Minimizing makespan in a pallet-constrained flowshop. Journal of Scheduling, 2, 115-133.
|
Hoogeveen, J.A. & Kawaguchi, T. (1999). Minimizing total completion time in a twomachine flowshop: analysis of special cases. Mathematics of Operations Research, 24, 887-910.
|
Hoogeveen, J.A. & Velde, S.L. van de (1999). Scheduling with target start times. European Journal of Operational Research.
|
webmaster@cs.uu.nl,
Tue, 22 May 2012 11:29:44 +0200
←
Departement Informatica, Universiteit Utrecht