Recent & Upcoming Talks

Double Underscore (dunder) Funktionen werden häfig verwendet in Python, aber wenige kennen die Stärken und den Nutzen dieser internen Funktionen. Dabei nutzt jede Integer in Python eine ganze Reihe dieser internen Möglichkeiten um ihre Funktionalität sicherzustellen. Wissen Sie warum 5 + 3 funktioniert, oder kennen das Ergebnis von 5 @ 3?

Assembly line balancing problems have been much investigated in the last decades. Most work affects static problems in which process times and resources are known in advance due to the complexity and diversity of such problems. However, the past has shown that static resource allocation for dynamic process scheduling is insufficient due to volatile market demands required by the reconfigurable production paradigm. Consequent change of resource selection by production requests affect feasible assembly lines. This paper introduces a mixed integer programming based linear optimization approach for solving the dynamic resource allocation for assembly lines modelled as Assembly Line Balancing Problem.

Decreasing product life cycles with increasing product variants force manufacturing companies to adapt their assembly systems to changing conditions. As a result of this, typically manually performed design tasks of assembly workstation layouts often are suboptimal and timeextensive. One reason is the identification of complex interactions between resources. This paper presents an approach to support manufacturing engineers in applying physically based modeling techniques to the design process. The model describes relationships between different resources with physical principles. Resources with more impact on the layout are able to obtain their optimum location and influence the locations of other resources.

The Summer Seminar series aims to promote scientific discussions and networking between researchers at the University of Stuttgart. With focus on scientific talks and group based problem solving techniques this event promotes interdisciplinary exchange.

Das P vs NP Problem ist eines der Millennium-Probleme, eine im Jahr 2000 erstellte Liste ungelöster Probleme der Mathematik. Das Problem ist in der Komplexitätstheorie der theoretischen Informatik verortet und bezeichnet die Frage ob ob alle NP Probleme gleich P Probleme sind, und wir müssen nur weiter suchen um einen Beweis hierfür zu finden?

The Cyber Valley research Forum aims to promote networking between Cyber Valley researchers, partners, and actors. With different formats, we offer participants the opportunity to draw attention to their research within the Cyber Valley ecosystem.