World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
18768
World Ranking
5209
National Ranking
242

Mathematics

D-Index
48
Citations
17012
World Ranking
1179
National Ranking
61

Overview

Peter Brucker was affiliated with Osnabrück University in Germany. Their research contributed to various areas within health professions and medicine, focusing on subfields such as physical therapy, sports therapy and rehabilitation, as well as pulmonary and respiratory medicine.

Their main research topics included:

  • Medical Practices and Rehabilitation
  • Interstitial Lung Diseases and Idiopathic Pulmonary Fibrosis

Peter Brucker's publication record includes work in the venue Zeitschrift für Orthopädie und Unfallchirurgie. One notable paper authored alongside Philipp Niemeyer and others was titled "Erratum: Empfehlungen der AG Klinische Geweberegeneration zur Behandlung von Knorpelschäden am Kniegelenk," published in 2022.

Frequent co-authors in Brucker's research were:

  • Philipp Niemeyer
  • D. Albrecht
  • Matthias Aurich
  • Christoph Becher
  • Peter Behrens

Best Publications

  • Resource-constrained project scheduling: Notation, classification, models, and methods

    Peter Brucker;Andreas Drexl;Rolf H. Möhring;Klaus Neumann

  • Complexity of machine scheduling problems

    Jan Karel Lenstra;A.H.G. Rinnooy Kan;P. Brucker

  • Job-shop scheduling with multi-purpose machines

    P. Brucker;R. Schlie

  • A branch and bound algorithm for the job-shop scheduling problem

    Peter Brucker;Bernd Jurisch;Bernd Sievers

  • Scheduling a batching machine

    Peter Brucker;Andrei Gladky;Han Hoogeveen;Mikhail Y. Kovalyov

  • A branch and bound algorithm for the resource-constrained project scheduling problem

    Peter Brucker;Sigrid Knust;Arno Schoo;Olaf Thiele

  • Review of recent development: An O( n) algorithm for quadratic knapsack problems

    Peter Brucker

  • Complex Scheduling

    Peter Brucker;Sigrid Knust

  • Complex Scheduling

    Unknown

  • Personnel scheduling: Models and complexity

    Peter Brucker;Rong Qu;Edmund K. Burke

  • A branch & bound algorithm for the open-shop problem

    Peter Brucker;Johann Hurink;Bernd Jurisch;Birgit Wöstmann

  • Job-shop Scheduling Problem

    Unknown

  • The complexity of one-machine batching problems

    Susanne Albers;Peter Brucker

  • On the Complexity of Clustering Problems

    Unknown

  • A linear programming and constraint propagation-based lower bound for the RCPSP

    Peter Brucker;Sigrid Knust

  • A branch & bound method for the general-shop problem with sequence dependent setup-times

    Peter Brucker;Olaf Thiele

  • Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness

    Peter Brucker;M. R. Garey;D. S. Johnson

  • A shift sequence based approach for nurse scheduling and a new benchmark dataset

    Peter Brucker;Edmund K. Burke;Tim Curtois;Rong Qu

  • Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem

    Tonius Baar;Peter Brucker;Sigrid Knust

  • Improving local search heuristics for some scheduling problems. Part II

    Peter Brucker;Johann Hurink;Frank Werner

  • Complexity results for parallel machine problems with a single server

    Peter Brucker;Clarisse Dhaenens-Flipo;Sigrid Knust;Svetlana A. Kravchenko

  • Lower bounds for resource-constrained project scheduling problems

    Peter Brucker;Sigrid Knust

  • Complexity of scheduling problems with multi-purpose machines

    Peter Brucker;Bernd Jurisch;Andreas Krämer

Frequent Co-Authors

Sigrid Knust
Sigrid Knust Osnabrück University
Johann L. Hurink
Johann L. Hurink University of Twente
Edmund K. Burke
Edmund K. Burke Bangor University
Rong Qu
Rong Qu University of Nottingham
Frank Werner
Frank Werner Otto-von-Guericke University Magdeburg
Mikhail Y. Kovalyov
Mikhail Y. Kovalyov National Academy of Sciences of Belarus
Marek Chrobak
Marek Chrobak University of California, Riverside
T.C.E. Cheng
T.C.E. Cheng Hong Kong Polytechnic University
Horst W. Hamacher
Horst W. Hamacher Technical University of Kaiserslautern

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can expand career opportunities in fields like finance, marketing, and business administration. A growing number of programs offer flexibility and affordability, making advanced education accessible without disrupting professional goals.

Those looking to deepen their financial expertise may consider the best online masters in finance. These programs often combine quantitative skills with practical financial knowledge, ideal for mathematicians aiming to enter the finance sector.

For career changers or those seeking leadership roles, pursuing an MBA online can be a strategic move. Some students prefer programs known for speed and efficiency, such as the quickest online mba, which allows completion in a condensed timeframe without sacrificing quality.

Marketing professionals with a math background can benefit from the analytical approach taught in a masters in marketing program. These programs focus on data-driven decision-making that leverages mathematical skills.

Alternatively, candidates seeking an intensive experience may explore the one year mba, which offers a fast-track path to broad managerial competencies useful for various industries combining math and business.

Best Scientists Citing Peter Brucker

Recently Published Articles