Fachbereich Maschinenbau und Mechatronik
Refine
Year of publication
- 2024 (1)
- 2023 (5)
- 2022 (3)
- 2021 (2)
- 2020 (6)
- 2019 (4)
- 2018 (3)
- 2017 (1)
- 2016 (4)
- 2015 (4)
- 2014 (2)
- 2013 (2)
- 2012 (8)
- 2011 (6)
- 2010 (6)
- 2009 (3)
- 2008 (4)
- 2007 (1)
- 2006 (5)
- 2005 (5)
- 2004 (3)
- 2003 (5)
- 2002 (1)
- 2001 (2)
- 1999 (1)
- 1998 (6)
- 1997 (5)
- 1996 (3)
- 1995 (5)
- 1994 (9)
- 1992 (2)
- 1991 (2)
- 1990 (2)
- 1989 (2)
- 1988 (4)
- 1987 (5)
- 1986 (1)
- 1985 (5)
- 1984 (4)
- 1983 (5)
- 1981 (1)
Institute
Language
- English (148) (remove)
Document Type
- Article (148) (remove)
Keywords
- additive manufacturing (3)
- Brake set-up (2)
- Freight rail (2)
- SLM (2)
- factory planning (2)
- fused filament fabrication (2)
- manufacturing flexibility (2)
- rapid tooling (2)
- 316L (1)
- 3D nonlinear finite element model (1)
Improving the Mechanical Strength of Dental Applications and Lattice Structures SLM Processed
(2020)
To manufacture custom medical parts or scaffolds with reduced defects and high mechanical characteristics, new research on optimizing the selective laser melting (SLM) parameters are needed. In this work, a biocompatible powder, 316L stainless steel, is characterized to understand the particle size, distribution, shape and flowability. Examination revealed that the 316L particles are smooth, nearly spherical, their mean diameter is 39.09 μm and just 10% of them hold a diameter less than 21.18 μm. SLM parameters under consideration include laser power up to 200 W, 250–1500 mm/s scanning speed, 80 μm hatch spacing, 35 μm layer thickness and a preheated platform. The effect of these on processability is evaluated. More than 100 samples are SLM-manufactured with different process parameters. The tensile results show that is possible to raise the ultimate tensile strength up to 840 MPa, adapting the SLM parameters for a stable processability, avoiding the technological defects caused by residual stress. Correlating with other recent studies on SLM technology, the tensile strength is 20% improved. To validate the SLM parameters and conditions established, complex bioengineering applications such as dental bridges and macro-porous grafts are SLM-processed, demonstrating the potential to manufacture medical products with increased mechanical resistance made of 316L.
Tribological performance of biodegradable lubricants under different surface roughness of tools
(2019)
The fourth industrial revolution introduces disruptive technologies to production environments. One of these technologies are multi-agent systems (MASs), where agents virtualize machines. However, the agent's actual performances in production environments can hardly be estimated as most research has been focusing on isolated projects and specific scenarios. We address this gap by implementing a highly connected and configurable reference model with quantifiable key performance indicators (KPIs) for production scheduling and routing in single-piece workflows. Furthermore, we propose an algorithm to optimize the search of extrema in highly connected distributed systems. The benefits, limits, and drawbacks of MASs and their performances are evaluated extensively by event-based simulations against the introduced model, which acts as a benchmark. Even though the performance of the proposed MAS is, on average, slightly lower than the reference system, the increased flexibility allows it to find new solutions and deliver improved factory-planning outcomes. Our MAS shows an emerging behavior by using flexible production techniques to correct errors and compensate for bottlenecks. This increased flexibility offers substantial improvement potential. The general model in this paper allows the transfer of the results to estimate real systems or other models.
We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.