2010 - EURO Gold Medal
Rolf H. Möhring spends much of his time researching Mathematical optimization, Scheduling, Discrete mathematics, Interval graph and Time complexity. His research in Mathematical optimization intersects with topics in Rate-monotonic scheduling, Dynamic priority scheduling and Resource allocation. The concepts of his Dynamic priority scheduling study are interwoven with issues in Scheduling and Fair-share scheduling.
His Scheduling research incorporates elements of Least slack time scheduling and Operations research. He does research in Scheduling, focusing on Job shop scheduling specifically. His Discrete mathematics research includes elements of Tree, Combinatorics, Combinatorial optimization and Decomposition.
Rolf H. Möhring focuses on Mathematical optimization, Combinatorics, Scheduling, Discrete mathematics and Algorithm. His Mathematical optimization research is multidisciplinary, incorporating elements of Dynamic priority scheduling and Job shop scheduling. In his study, Heuristic is inextricably linked to Fair-share scheduling, which falls within the broad field of Job shop scheduling.
His work deals with themes such as Time complexity, Decision support system and Theoretical computer science, which intersect with Scheduling. Rolf H. Möhring works mostly in the field of Discrete mathematics, limiting it down to topics relating to Comparability and, in certain cases, Ordered set. As part of one scientific family, he deals mainly with the area of Scheduling, narrowing it down to issues related to the Operations research, and often Network planning and design.
His main research concerns Combinatorics, Price of anarchy, Mathematical optimization, Approximation algorithm and Combinatorial optimization. His Combinatorics study integrates concerns from other disciplines, such as Algorithm and Polynomial. Rolf H. Möhring has researched Mathematical optimization in several fields, including Convergence and Job shop scheduling.
The various areas that he examines in his Job shop scheduling study include Local search, Graph and Traffic optimization. His Combinatorial optimization research is multidisciplinary, incorporating elements of Disjoint sets, Partition, Performance guarantee and Meta heuristic. His Travelling salesman problem study incorporates themes from Scheduling and Independent set.
Rolf H. Möhring mostly deals with Mathematical optimization, Function, Job shop scheduling, Adaptive routing and Local search. He is interested in Optimization problem, which is a field of Mathematical optimization. His work in the fields of Function, such as Continuous function, overlaps with other areas such as Class, Pairwise comparison and Pareto efficiency.
His studies deal with areas such as Graph and Traffic optimization as well as Job shop scheduling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Resource-constrained project scheduling: Notation, classification, models, and methods
Peter Brucker;Andreas Drexl;Rolf H. Möhring;Klaus Neumann.
European Journal of Operational Research (1999)
Scheduling project networks with resource constraints and time windows
M. Bartusch;R. H. Mohring;F. J. Radermacher.
Annals of Operations Research (1988)
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
R.H. Möhring;F.J. Radermacher.
North-holland Mathematics Studies (1984)
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
Christian Liebchen;Marco Lübbecke;Rolf Möhring;Sebastian Stiller.
Lecture Notes in Computer Science (2009)
Algorithmic Aspects of Comparability Graphs and Interval Graphs
Rolf H. Möhring.
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Olaf Jahn;Rolf H. Möhring;Andreas S. Schulz;Nicolás E. Stier-Moses.
Operations Research (2005)
Solving Project Scheduling Problems by Minimum Cut Computations
Rolf H. Möhring;Andreas S. Schulz;Frederik Stork;Marc Uetz.
Management Science (2003)
The pathwidth and treewidth of cographs
Hans L. Bodlaender;Rolf H. Möhring.
SIAM Journal on Discrete Mathematics (1993)
Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
Rolf H. Möhring.
Operations Research (1984)
An incremental linear-time algorithm for recognizing interval graphs
Norbert Korte;Rolf H. Möhring.
SIAM Journal on Computing (1989)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: