Johann Hurink

Kamiel Cornelissen, Ruben Hoeksma, Johann Hurink, Bodo Manthey (Eds.): 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. CTIT Workshop Proceedings WP 13-01, 2013

Maurice G. C. Bosman, Vincent Bakker, Albert Molderink, Johann Hurink, Gerard J. M. Smit: Planning the production of a fleet of domestic combined heat and power generators. European Journal of Operational Research 216(1): 140-151 (2012)

Ardjan Zwartjes, Paul J. M. Havinga, Gerard J. M. Smit, Johann L. Hurink: Distribution Bottlenecks in Classification Algorithms. Procedia CS 10: 960-967 (2012)

Maurice G. C. Bosman, Albert Molderink, Vincent Bakker, Gerard J. M. Smit, Johann L. Hurink: Multilevel Unit Commitment in Smart Grids. ICORES 2012: 361-370

Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. J. Schutten: Time-constrained project scheduling with adjacent resources. Computers & OR 38(1): 310-319 (2011)

Tobias Brüggemann, Johann L. Hurink: Matching based very large-scale neighborhoods for parallel machine scheduling. J. Heuristics 17(6): 637-658 (2011)

Peter T. Vanberkel, Richard J. Boucherie, Erwin W. Hans, Johann Hurink, Wineke A. M. van Lent, Wim H. van Harten: An exact approach for relating recovering surgical patient workload to the master surgical schedule. JORS 62(10): 1851-1860 (2011)

Johann Hurink, Jacob Jan Paulus: Improved online algorithms for parallel job scheduling and strip packing. Theor. Comput. Sci. 412(7): 583-593 (2011)

H. C. M. Bossers, Johann Hurink, Gerard J. M. Smit: Online Univariate Outlier Detection in Final Test: A Robust Rolling Horizon Approach. European Test Symposium 2011: 201

Ardjan Zwartjes, Majid Bahrepour, Paul J. M. Havinga, Johann L. Hurink, Gerard J. M. Smit: On the Effects of Input Unreliability on Classification Algorithms. MobiQuitous 2011: 126-137

Jan-Maarten Verbree, Maurits de Graaf, Johann Hurink: An analysis of the lifetime of OLSR networks. Ad Hoc Networks 8(4): 391-399 (2010)

Ulrich Faigle, Johann Hurink: Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discrete Applied Mathematics 158(4): 239 (2010)

Philip K. F. Hölzenspies, Timon D. ter Braak, Jan Kuper, Gerard J. M. Smit, Johann Hurink: Run-time Spatial Mapping of Streaming Applications to Heterogeneous Multi-Processor Systems. International Journal of Parallel Programming 38(1): 68-83 (2010)

Angelika Mader, Henrik C. Bohnenkamp, Yaroslav S. Usenko, David N. Jansen, Johann Hurink, Holger Hermanns: Synthesis and stochastic assessment of cost-optimal schedules. STTT 12(5): 305-318 (2010)

Albert Molderink, Vincent Bakker, Maurice G. C. Bosman, Johann Hurink, Gerard J. M. Smit: Management and Control of Domestic Smart Grid Technology. IEEE Trans. Smart Grid 1(2): 109-119 (2010)

Timon D. ter Braak, Philip K. F. Hölzenspies, Jan Kuper, Johann Hurink, Gerard J. M. Smit: Run-time spatial resource management for real-time applications on heterogeneous MPSoCs. DATE 2010: 357-362

Vincent Bakker, Albert Molderink, Maurice G. C. Bosman, Johann Hurink, Gerard J. M. Smit: On simulating the effect on the energy efficiency of smart grid technologies. Winter Simulation Conference 2010: 393-404

Albert Molderink, Maurice G. C. Bosman, Vincent Bakker, Johann Hurink, Gerard J. M. Smit: Simulating the Effect on the Energy Efficiency of Smart Grid Technologies. Winter Simulation Conference 2009: 1530-1541

Johann Hurink, Tim Nieberg: Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2): 155-160 (2008)

Johann Hurink, Jacob Jan Paulus: Online scheduling of parallel jobs on two machines is 2-competitive. Oper. Res. Lett. 36(1): 51-56 (2008)

T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, J. M. J. Schutten: Time-constrained project scheduling. J. Scheduling 11(2): 137-148 (2008)

Tim Nieberg, Johann Hurink, Walter Kern: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4) (2008)

Johann Hurink, Jacob Jan Paulus: Special Cases of Online Parallel Job Scheduling. CTW 2008: 82-85

Philip K. F. Hölzenspies, Johann Hurink, Jan Kuper, Gerard J. M. Smit: Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). DATE 2008: 212-217

Raluca Marin-Perianu, Johann Hurink, Pieter H. Hartel: A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks. ISPA 2008: 863-870

Johann Hurink, Tim Nieberg: Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80

Jacob Jan Paulus, Johann Hurink: Decomposition method for project scheduling with adjacent resources. CTW 2007: 119-122

Philip K. F. Hölzenspies, Jan Kuper, Gerard J. M. Smit, Johann Hurink: Demonstration of Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). Quantitative Aspects of Embedded Systems 2007

Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger: Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. WAOA 2007: 41-54

Johann Hurink, Jacob Jan Paulus: Online Algorithm for Parallel Job Scheduling and Strip Packing. WAOA 2007: 67-74

Johann Hurink, Walter Kern, Gerhard F. Post, Georg Still (Eds.): Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007. University of Twente 2007

Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl: Preface. Discrete Applied Mathematics 154(9): 1315 (2006)

Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger: Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electronic Notes in Discrete Mathematics 25: 29-33 (2006)

Jacob Jan Paulus, Johann Hurink: Adjacent-Resource Scheduling: Why spatial resources are so hard to incorporate. Electronic Notes in Discrete Mathematics 25: 113-116 (2006)

Tobias Brüggemann, Johann Hurink, Walter Kern: Quality of move-optimal schedules for minimizing total weighted completion time. Oper. Res. Lett. 34(5): 583-590 (2006)

Johann Hurink, Sigrid Knust: Tabu search algorithms for job-shop problems with a single transport robot. European Journal of Operational Research 162(1): 99-111 (2005)

Tim Nieberg, Johann Hurink: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. WAOA 2005: 296-306

Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink: Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discrete Applied Mathematics 136(2-3): 159-160 (2004)

Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink: Run-Time Adaptation of a Reconfigurable Mobile UMTS Receiver. ERSA 2004: 313

Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte: Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT 2004: 421-424

Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink, Gerard K. Rauwerda: BER Estimation for HiperLAN/2. PWC 2004: 164-179

Tim Nieberg, Johann Hurink, Walter Kern: A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221

Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)

Peter Brucker, Johann Hurink, Sigrid Knust: A polynomial algorithm for P | p_j=1, r_j, outtree | ∑ C_j. Math. Meth. of OR 56(3): 407-412 (2003)

Peter Brucker, Silvia Heitmann, Johann Hurink: How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003)

Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink, André B. J. Kokkeler: Soft Output Bit Error Rate Estimation for WCDMA. PWC 2003: 448-457

Johann Hurink, Sigrid Knust: A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics 119(1-2): 181-203 (2002)

Johann Hurink, Jens Keuchel: Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics 112(1-3): 179-197 (2001)

Johann Hurink, Sigrid Knust: Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics 112(1-3): 199-216 (2001)

Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001)

Johann Hurink, Sigrid Knust: List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett. 29(5): 231-239 (2001)

Peter Brucker, Thomas Hilbig, Johann Hurink: A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. Discrete Applied Mathematics 94(1-3): 77-99 (1999)

Peter Brucker, Johann Hurink, Wieslaw Kubiak: Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Meth. of OR 49(2): 211-219 (1999)

Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for some Scheduling Problems. Part II. Discrete Applied Mathematics 72(1-2): 47-69 (1997)

Peter Brucker, Johann Hurink, Bernd Jurisch, Birgit Wöstmann: A Branch & Bound Algorithm for the Open-shop Problem. Discrete Applied Mathematics 76(1-3): 43-59 (1997)

Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for Some Scheduling Problems-I. Discrete Applied Mathematics 65(1-3): 97-122 (1996)

Johann Hurink: Polygon Scheduling. Discrete Applied Mathematics 70(1): 37-55 (1996)