![]() | ![]() |
Johann L. Hurink
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 52 | 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 | |
| 51 | 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) | |
| 2011 | ||
| 50 | 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 | |
| 49 | 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 | |
| 48 | 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) | |
| 47 | Tobias Brüggemann, Johann L. Hurink: Matching based very large-scale neighborhoods for parallel machine scheduling. J. Heuristics 17(6): 637-658 (2011) | |
| 46 | 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) | |
| 45 | Johann Hurink, Jacob Jan Paulus: Improved online algorithms for parallel job scheduling and strip packing. Theor. Comput. Sci. 412(7): 583-593 (2011) | |
| 2010 | ||
| 44 | 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 | |
| 43 | 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 | |
| 42 | Jan-Maarten Verbree, Maurits de Graaf, Johann Hurink: An analysis of the lifetime of OLSR networks. Ad Hoc Networks 8(4): 391-399 (2010) | |
| 41 | Ulrich Faigle, Johann Hurink: Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discrete Applied Mathematics 158(4): 239 (2010) | |
| 40 | 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) | |
| 39 | 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) | |
| 38 | 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) | |
| 2009 | ||
| 37 | 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 | |
| 2008 | ||
| 36 | Johann Hurink, Jacob Jan Paulus: Special Cases of Online Parallel Job Scheduling. CTW 2008: 82-85 | |
| 35 | 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 | |
| 34 | Raluca Marin-Perianu, Johann Hurink, Pieter H. Hartel: A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks. ISPA 2008: 863-870 | |
| 33 | Tim Nieberg, Johann Hurink, Walter Kern: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4): (2008) | |
| 32 | Johann Hurink, Tim Nieberg: Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2): 155-160 (2008) | |
| 31 | T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, J. M. J. Schutten: Time-constrained project scheduling. J. Scheduling 11(2): 137-148 (2008) | |
| 30 | Johann Hurink, Jacob Jan Paulus: Online scheduling of parallel jobs on two machines is 2-competitive. Oper. Res. Lett. 36(1): 51-56 (2008) | |
| 2007 | ||
| 29 | Johann Hurink, Walter Kern, Gerhard F. Post, Georg Still: Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007 University of Twente 2007 | |
| 28 | Jacob Jan Paulus, Johann Hurink: Decomposition method for project scheduling with adjacent resources. CTW 2007: 119-122 | |
| 27 | Johann Hurink, Tim Nieberg: Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80 | |
| 26 | 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 | |
| 25 | 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 | |
| 24 | Johann Hurink, Jacob Jan Paulus: Online Algorithm for Parallel Job Scheduling and Strip Packing. WAOA 2007: 67-74 | |
| 2006 | ||
| 23 | Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl: Preface. Discrete Applied Mathematics 154(9): 1315 (2006) | |
| 22 | 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) | |
| 21 | 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) | |
| 20 | 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) | |
| 2005 | ||
| 19 | Tim Nieberg, Johann Hurink: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. WAOA 2005: 296-306 | |
| 18 | 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) | |
| 2004 | ||
| 17 | Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink: Run-Time Adaptation of a Reconfigurable Mobile UMTS Receiver. ERSA 2004: 313 | |
| 16 | Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink, Gerard K. Rauwerda: BER Estimation for HiperLAN/2. PWC 2004: 164-179 | |
| 15 | Tim Nieberg, Johann Hurink, Walter Kern: A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221 | |
| 14 | 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) | |
| 2003 | ||
| 13 | 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 | |
| 12 | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003) | |
| 11 | Peter Brucker, Silvia Heitmann, Johann Hurink: How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003) | |
| 2002 | ||
| 10 | 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) | |
| 2001 | ||
| 9 | 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) | |
| 8 | 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) | |
| 7 | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001) | |
| 6 | 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) | |
| 1999 | ||
| 5 | 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) | |
| 1997 | ||
| 4 | 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) | |
| 3 | 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) | |
| 1996 | ||
| 2 | Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for Some Scheduling Problems-I. Discrete Applied Mathematics 65(1-3): 97-122 (1996) | |
| 1 | Johann Hurink: Polygon Scheduling. Discrete Applied Mathematics 70(1): 37-55 (1996) | |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page