Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Peter Brucker"'
Autor:
Philipp Niemeyer, Dirk Albrecht, Matthias Aurich, Christoph Becher, Peter Behrens, Peter Bichmann, Gerrit Bode, Peter Brucker, Christoph Erggelet, Marco Ezechieli, Svea Faber, Stefan Fickert, Jürgen Fritz, Arnd Hoburg, Peter Kreuz, Jörg Lützner, Henning Madry, Stefan Marlovits, Julian Mehl, Peter E. Müller, Stefan Nehrer, Thomas Niethammer, Matthias Pietschmann, Christian Plaass, Philip Rössler, Klaus Rhunau, Bernhard Schewe, Gunter Spahn, Matthias Steinwachs, Thomas Tischer, Martin Volz, Markus Walther, Wolfgang Zinser, Johannes Zellner, Peter Angele
Publikováno v:
Zeitschrift fur Orthopadie und Unfallchirurgie.
Autor:
Philipp Niemeyer, Dirk Albrecht, Matthias Aurich, Christoph Becher, Peter Behrens, Peter Bichmann, Gerrit Bode, Peter Brucker, Christoph Erggelet, Marco Ezechieli, Svea Faber, Stefan Fickert, Jürgen Fritz, Arnd Hoburg, Peter Kreuz, Jörg Lützner, Henning Madry, Stefan Marlovits, Julian Mehl, Peter E. Müller, Stefan Nehrer, Thomas Niethammer, Matthias Pietschmann, Christian Plaass, Philip Rössler, Klaus Rhunau, Bernhard Schewe, Gunter Spahn, Matthias Steinwachs, Thomas Tischer, Martin Volz, Markus Walther, Wolfgang Zinser, Johannes Zellner, Peter Angele
Publikováno v:
Zeitschrift fur Orthopadie und Unfallchirurgie.
The Working Group of the German Orthopedic and Trauma Society (DGOU) on Tissue Regeneration has published recommendations on the indication of different surgical approaches for treatment of full-thickness cartilage defects in the knee joint in 2004,
Publikováno v:
Sports Orthopaedics and Traumatology. 33:270-277
Zusammenfassung Vorbereitende Masnahmen vor der Betreuung von Athleten beinhalten die Erkundung ortlicher Gegebenheiten, die Mitnahme geeigneter medizinischer Ausrustung und eine Voruntersuchung der Sportler mit Beurteilung der aktuellen Spielfahigke
Autor:
Peter Brucker, Natalia V. Shakhlevich
Publikováno v:
Journal of Scheduling. 19:659-685
In this paper we characterize optimal schedules for scheduling problems with parallel machines and unit processing times by providing necessary and sufficient conditions of optimality. We show that the optimality conditions for parallel machine sched
Publikováno v:
Journal of Scheduling. 16:417-422
The inverse and reverse counterparts of the single-machine scheduling problem $$1||L_{\max }$$ are studied in [2], in which the complexity classification is provided for various combinations of adjustable parameters (due dates and processing times) a
Publikováno v:
Computers & Operations Research. 39:3200-3214
The cyclic job-shop problem with transportation can be used to describe optimization problems in fully automated manufacturing systems or assembly lines. We study the problem where the machines have no buffers, which rapidly decreases the number of f
Publikováno v:
European Journal of Operational Research. 210:467-473
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relatively low level of study on models and complexity in these important pr
Autor:
Natalia V. Shakhlevich, Peter Brucker
Publikováno v:
Journal of Scheduling. 14:239-256
We study an inverse counterpart of the two-machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for whic
Autor:
Natalia V. Shakhlevich, Peter Brucker
Publikováno v:
Journal of Scheduling. 14:371-389
A flow-shop batching problem with consistent batches is considered in which the processing times of all jobs on each machine are equal to p and all batch set-up times are equal to s. In such a problem, one has to partition the set of jobs into batche
Autor:
Peter Brucker, Natalia V. Shakhlevich
Publikováno v:
Journal of Scheduling. 12:475-488
We study a range of counterparts of the single-machine scheduling problem with the maximum lateness criterion that arise in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to