Johann L. Hurink

From MaRDI portal
Revision as of 08:05, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Person:210522 to Johann L. Hurink: Duplicate)

Person:322694

Available identifiers

zbMath Open hurink.johann-lWikidataQ42426991 ScholiaQ42426991MaRDI QIDQ322694

List of research outcomes

PublicationDate of PublicationType
Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits2023-09-12Paper
On a Reduction for a Class of Resource Allocation Problems2022-07-01Paper
A fast algorithm for quadratic resource allocation problems with nested constraints2022-03-09Paper
In memoriam Walter Kern2021-09-15Paper
Greedy algorithm for local heating problem2021-04-21Paper
A fast algorithm for quadratic resource allocation problems with nested constraints2020-09-08Paper
On a reduction for a class of resource allocation problems2020-08-26Paper
ODDO: Online Duality-Driven Optimization2020-08-22Paper
Quadratic nonseparable resource allocation problems with generalized bound constraints2020-07-13Paper
An average case analysis of the minimum spanning tree heuristic for the power assignment problem2019-10-16Paper
Approximation schemes for wireless networks2018-11-05Paper
Smart Charging of Electric Vehicles2017-11-30Paper
Resource allocation problems in decentralized energy management2017-08-25Paper
On the Interplay Between Global DVFS and Scheduling Tasks With Precedence Constraints2017-05-16Paper
Optimizing the strategic patient mix combining queueing theory and dynamic programming2016-11-10Paper
Erratum to ``Optimizing the strategic patient mix combining queueing theory and dynamic programing2016-11-10Paper
The lockmaster's problem2016-10-07Paper
A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering2016-05-18Paper
A survey of offline algorithms for energy minimization under deadline constraints2016-05-13Paper
Clustering clinical departments for wards to achieve a prespecified blocking probability2015-03-12Paper
Reducing the number of required beds by rearranging the OR-schedule2014-12-11Paper
In memoriam Peter Brucker2014-08-18Paper
Exponential size neighborhoods for makespan minimization scheduling2012-06-18Paper
Efficiency evaluation for pooling resources in health care2012-06-13Paper
Planning the production of a fleet of domestic combined heat and power generators2012-05-14Paper
Matching based very large-scale neighborhoods for parallel machine scheduling2012-05-08Paper
https://portal.mardi4nfdi.de/entity/Q31712452011-10-05Paper
Improved online algorithms for parallel job scheduling and strip packing2011-02-21Paper
Time-constrained project scheduling with adjacent resources2010-10-15Paper
Approximating minimum independent dominating sets in wireless networks2010-06-09Paper
Run-time spatial mapping of streaming applications to heterogeneous multi-processor systems2010-03-12Paper
Time-constrained project scheduling2009-08-28Paper
Online scheduling of parallel jobs on two machines is 2-competitive2008-05-29Paper
A master surgical scheduling approach for cyclic scheduling in operating room departments2008-04-11Paper
Quality of move-optimal schedules for minimizing total weighted completion time2008-03-28Paper
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines2008-02-20Paper
Online Algorithm for Parallel Job Scheduling and Strip Packing2008-02-20Paper
Two very large-scale neighborhoods for single machine scheduling2007-08-20Paper
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines2007-05-29Paper
Adjacent-Resource Scheduling2007-05-29Paper
Approximation and Online Algorithms2007-02-12Paper
Job-shop scheduling with limited capacity buffers2006-11-03Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Tabu search algorithms for job-shop problems with a single transport robot2005-02-09Paper
Modeling of capacitated transportation systems for integral scheduling2004-09-22Paper
How useful are preemptive schedules?2003-11-17Paper
Flow-shop problems with intermediate buffers2003-11-09Paper
Routing of railway carriages2003-09-15Paper
A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)2003-06-23Paper
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags2002-07-30Paper
List scheduling in a parallel machine environment with precedence constraints and setup times2002-07-03Paper
A tabu search algorithm for scheduling a single robot in a job-shop environment2002-06-24Paper
Makespan minimization for flow-shop problems with transportation times and a single robot2001-10-16Paper
Solving a chemical batch scheduling problem by local search2001-01-17Paper
Scheduling identical jobs with chain precedence constraints on two uniform machines2000-05-07Paper
An exponential neighborhood for a one-machine batching problem1999-11-25Paper
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags1999-06-28Paper
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour1998-11-01Paper
A branch \(\&\) bound algorithm for the open-shop problem1998-02-24Paper
https://portal.mardi4nfdi.de/entity/Q43500451997-08-28Paper
Improving local search heuristics for some scheduling problems. II1997-04-21Paper
Polygon scheduling1996-10-09Paper
Improving local search heuristics for some scheduling problems. I1996-07-07Paper
https://portal.mardi4nfdi.de/entity/Q48724761996-03-21Paper
Tabu search for the job-shop scheduling problem with multi-purpose machines1994-04-26Paper
Cyclic schedules for r irregularity occurring events1990-01-01Paper
A railway scheduling problem1986-01-01Paper
Improving the Optimization in Model Predictive Controllers: Scheduling Large Groups of Electric Vehicles0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Johann L. Hurink