No description available.

Coronary artery disease (CAD) affects every fifth person in the world. The gold-standard treatment for CAD is stent implantation, however, the existing therapy is not sufficient due to many reasons. For instance, in-stent restenosis, biocompatibility, controlled degradation rate, protein adsorption, and adequate endothelialization are still the main concerns. In the last two decades, the field of stent technology has been grown rapidly and many new stent types and in vitro testing methods for stent characterization have been developed to minimize the aforementioned issues. In this vicinity, there are still many unaddressed issues: i) the quantitative analysis of corrosion is conducted with simpler samples made of stent material instead of stents, in most cases due to the absence of a mathematical model to calculate the entire stent surface area (ESSA); ii) in vitro stent testing in environments that are very far from actual physiological environments; iii) Evaluation of the influence of in-vitro test conditions on coated metallic stents; iv) absence of flow-induced shear stress (FISS) corrosion model, to mention a few. This thesis presents the novel ESSA model, the fluid dynamic experimental setup with the integration of various sensors and pH control, the influence of in vitro degradation behavior of the titanium oxynitride (TiOxNy) coated stainless steel stents and anodized AZ31 samples, and the FISS corrosion model. The results show some important contributions in this field, however, there is still a huge potential for the development of promising stent characterization solutions. / Die koronare Herzkrankheit (KHK) betrifft jeden fünften Menschen auf der Welt. Der Goldstandard bei der Behandlung von KHK ist die Stent-Implantation, doch die bestehende Therapie ist aus vielen Gründen nicht ausreichend. So sind beispielsweise die Restenose im Stent, die Biokompatibilität, die kontrollierte Abbaugeschwindigkeit, die Proteinadsorption und die angemessene Endothelialisierung nach wie vor die Hauptprobleme. In den letzten zwei Jahrzehnten hat sich die Stenttechnologie rasant weiterentwickelt, und es wurden viele neue Stenttypen und In-vitro-Testmethoden zur Stentcharakterisierung entwickelt, um die oben genannten Probleme zu minimieren. In dieser Umgebung gibt es noch viele ungelöste Probleme: i) die quantitative Analyse der Korrosion wird mit einfacheren Proben aus Stentmaterial anstelle von Stents durchgeführt, in den meisten Fällen aufgrund des Fehlens eines mathematischen Modells zur Berechnung der gesamten Stentoberfläche (ESSA); ii) In-vitro-Stent-Tests in Umgebungen, die sehr weit von der tatsächlichen physiologischen Umgebung entfernt sind; iii) Bewertung des Einflusses von In-vitro-Testbedingungen auf beschichtete metallische Stents; iv) Fehlen eines FISS-Korrosionsmodells (flow-induced shear stress), um nur einige zu nennen. In dieser Arbeit werden das neuartige ESSA-Modell, der strömungsdynamische Versuchsaufbau mit der Integration verschiedener Sensoren und pH-Kontrolle, der Einfluss des In-vitro-Degradationsverhaltens der mit Titanoxynitrid (TiOxNy) beschichteten Edelstahlstents und anodisierten AZ31-Proben sowie das FISS-Korrosionsmodell vorgestellt. Die Ergebnisse zeigen einige wichtige Beiträge in diesem Bereich, jedoch gibt es noch ein großes Potenzial für die Entwicklung von vielversprechenden Lösungen zur Charakterisierung von Stents.

The central thesis of this dissertation is that by combining classical scheduling methodologies with those of inventory management and queueing theory we can better model, understand and solve complex real-world scheduling problems. In part II of this dissertation, we provide models of a realistic supply chain scheduling problem that capture both its combinatorial nature and its dependence on inventory availability. We present an extensive empirical evaluation of how well implementations of these models in commercially available software solve the problem. We are therefore able to address, within a specific problem, the need for scheduling to take into account related decision-making processes. In order to simultaneously deal with combinatorial and dynamic properties of real scheduling problems, in part III we propose to integrate queueing theory and deterministic scheduling. Firstly, by reviewing the queueing theory literature that deals with dynamic resource allocation and sequencing and outlining numerous future work directions, we build a strong foundation for the investigation of the integration of queueing theory and scheduling. Subsequently, we demonstrate that integration can take place on three levels: conceptual, theoretical and algorithmic. At the conceptual level, we combine concepts, ideas and problem settings from the two areas, showing that such combinations provide insights into the trade-off between long-run and short-run objectives. Next, we show that theoretical integration of queueing and scheduling can lead to long-run performance guarantees for scheduling algorithms that have previously been proved only for queueing policies. In particular, we are the first to prove, in two flow shop environments, the stability of a scheduling method that is based on the traditional scheduling literature and utilizes processing time information to make sequencing decisions. Finally, to address the algorithmic level of integration, we present, in an extensive future work chapter, one general approach for creating hybrid queueing/scheduling algorithms. To our knowledge, this dissertation is the first work that builds a framework for integrating queueing theory and scheduling. Motivated by characteristics of real problems, this dissertation takes a step toward extending scheduling research beyond traditional assumptions and addressing more realistic scheduling problems.

The central thesis of this dissertation is that by combining classical scheduling methodologies with those of inventory management and queueing theory we can better model, understand and solve complex real-world scheduling problems. In part II of this dissertation, we provide models of a realistic supply chain scheduling problem that capture both its combinatorial nature and its dependence on inventory availability. We present an extensive empirical evaluation of how well implementations of these models in commercially available software solve the problem. We are therefore able to address, within a specific problem, the need for scheduling to take into account related decision-making processes. In order to simultaneously deal with combinatorial and dynamic properties of real scheduling problems, in part III we propose to integrate queueing theory and deterministic scheduling. Firstly, by reviewing the queueing theory literature that deals with dynamic resource allocation and sequencing and outlining numerous future work directions, we build a strong foundation for the investigation of the integration of queueing theory and scheduling. Subsequently, we demonstrate that integration can take place on three levels: conceptual, theoretical and algorithmic. At the conceptual level, we combine concepts, ideas and problem settings from the two areas, showing that such combinations provide insights into the trade-off between long-run and short-run objectives. Next, we show that theoretical integration of queueing and scheduling can lead to long-run performance guarantees for scheduling algorithms that have previously been proved only for queueing policies. In particular, we are the first to prove, in two flow shop environments, the stability of a scheduling method that is based on the traditional scheduling literature and utilizes processing time information to make sequencing decisions. Finally, to address the algorithmic level of integration, we present, in an extensive future work chapter, one general approach for creating hybrid queueing/scheduling algorithms. To our knowledge, this dissertation is the first work that builds a framework for integrating queueing theory and scheduling. Motivated by characteristics of real problems, this dissertation takes a step toward extending scheduling research beyond traditional assumptions and addressing more realistic scheduling problems.