Many car-following models predict a stable car-following behavior with a very small fluctuation around an equilibrium value g* of the net headway g with zero speed-difference Δv between the following and the lead vehicle. However, it is well-known and additionally demonstrated by data in this paper, that the fluctuations are much larger than these models predict. Typically, the fluctuation in speed difference is around ±2m/s, while the fluctuation in the net time headway T=g/v can be as big as one or even two seconds, which is as large as the mean time headway itself. By analyzing data from loop detectors as well as data from vehicle trajectories, evidence is provided that this randomness is not due to driver heterogeneity, but can be attributed to an internal stochasticity of the driver itself. A final model-based analysis supports the hypothesis, that the preferred headway of the driver is the parameter that is not kept constant but fluctuates strongly, thus causing the even macroscopically observable randomness in traffic flow.

No description available.

O sequenciamento e a programação da produção trazem grandes benefícios financeiros às empresas se realizados de forma adequada. Atualmente, soluções generalizadas apresentam resultados aceitáveis, porém têm como consequência benefícios inferiores quando comparados a estudos específicos. O ramo da otimização de resultados possui dois tipos de soluções: as exatas para problemas de menores dimensões e não exatas, ou heurísticas, para problemas de médias e grandes dimensões. Este trabalho apresenta algoritmos exatos do tipo Branch & Bound e Modelos de Programação Linear Inteira Mista para solucionar quatro variações de problemas de scheduling: Fm|block|∑Cjm, Fm|block|∑Tj, Fm|block, Sijk|∑Cjm e Fm|block, Sijk|∑Tj. As abordagens utilizadas são inéditas na literatura e apresentaram resultados animadores para a maioria dos cenários. O limitante para o tempo total de fluxo obteve resposta ótima em 100% dos casos para problemas de até 20 tarefas e 4 máquinas em menos de uma hora. Para o tempo total de atraso, o limitante se mostrou mais eficiente quando os valores das due dates apresentam alta taxa de dispersão. Para os casos com setup, foram elaboradas três variações de limitantes para cada problema. O limitante com setup que apresentou o melhor desempenho foi o que obteve a melhor relação entre o seu valor numérico e seu custo computacional. Os modelos MILP solucionaram 100% dos problemas sem setup para até 20 tarefas e 4 máquinas e para os casos com setup, foram solucionados problemas de até 14 tarefas e 4 máquinas no tempo limite de uma hora. Os testes computacionais mostram a eficiência na redução do número de nós e, consequentemente, no tempo de execução. Portanto, o estudo realizado indica que, para problemas de pequeno porte e médio, os métodos em questão possuem grande potencial para aplicações práticas. / Job Sequence and Programming give benefits both financial and organizational to any company when performed properly. Nowadays, there is still a gap between theory and practice due to solutions that are short in specification. The analyzed problems differ in type and dimension thus modifying its complexity. The results optimization field is divided into two types of solution: the exact solution for minor problems and the non-exact solution for greater dimension problems. The present paper presents exact algorithms to solve the problems Fm|block|∑Cjm, Fm|block|∑Tj, Fm|block, Sijk|∑Cjm by the Branch & Bounds and Mixed Integer Linear Program models. The approaches are new and presented good results for most cases. Bounds for the no-setup total flow time scenario solved 100% of the 20 jobs and 4 machines cases. High dispersion range due dates contributed for the effectiveness of the no-setup total tardiness bound\'s effectiveness. Three different approaches were developed for the setup cases. The best approach aimed to optimize the value/effort factor for the B&B. The Mixed Integer Linear Program models solved 100% of the no-setup cases for 20 jobs and 4 machines. The MILPs setup cases solved optimally 14 jobs and 4 machines cases. Computational tests were executed and analyzed and they highlighted the node count reduction and, consequently, the execution time. The present study points out that the exact methods can be applied to small and medium scheduling problems in practice.

O sequenciamento e a programação da produção trazem grandes benefícios financeiros às empresas se realizados de forma adequada. Atualmente, soluções generalizadas apresentam resultados aceitáveis, porém têm como consequência benefícios inferiores quando comparados a estudos específicos. O ramo da otimização de resultados possui dois tipos de soluções: as exatas para problemas de menores dimensões e não exatas, ou heurísticas, para problemas de médias e grandes dimensões. Este trabalho apresenta algoritmos exatos do tipo Branch & Bound e Modelos de Programação Linear Inteira Mista para solucionar quatro variações de problemas de scheduling: Fm|block|∑Cjm, Fm|block|∑Tj, Fm|block, Sijk|∑Cjm e Fm|block, Sijk|∑Tj. As abordagens utilizadas são inéditas na literatura e apresentaram resultados animadores para a maioria dos cenários. O limitante para o tempo total de fluxo obteve resposta ótima em 100% dos casos para problemas de até 20 tarefas e 4 máquinas em menos de uma hora. Para o tempo total de atraso, o limitante se mostrou mais eficiente quando os valores das due dates apresentam alta taxa de dispersão. Para os casos com setup, foram elaboradas três variações de limitantes para cada problema. O limitante com setup que apresentou o melhor desempenho foi o que obteve a melhor relação entre o seu valor numérico e seu custo computacional. Os modelos MILP solucionaram 100% dos problemas sem setup para até 20 tarefas e 4 máquinas e para os casos com setup, foram solucionados problemas de até 14 tarefas e 4 máquinas no tempo limite de uma hora. Os testes computacionais mostram a eficiência na redução do número de nós e, consequentemente, no tempo de execução. Portanto, o estudo realizado indica que, para problemas de pequeno porte e médio, os métodos em questão possuem grande potencial para aplicações práticas. / Job Sequence and Programming give benefits both financial and organizational to any company when performed properly. Nowadays, there is still a gap between theory and practice due to solutions that are short in specification. The analyzed problems differ in type and dimension thus modifying its complexity. The results optimization field is divided into two types of solution: the exact solution for minor problems and the non-exact solution for greater dimension problems. The present paper presents exact algorithms to solve the problems Fm|block|∑Cjm, Fm|block|∑Tj, Fm|block, Sijk|∑Cjm by the Branch & Bounds and Mixed Integer Linear Program models. The approaches are new and presented good results for most cases. Bounds for the no-setup total flow time scenario solved 100% of the 20 jobs and 4 machines cases. High dispersion range due dates contributed for the effectiveness of the no-setup total tardiness bound\'s effectiveness. Three different approaches were developed for the setup cases. The best approach aimed to optimize the value/effort factor for the B&B. The Mixed Integer Linear Program models solved 100% of the no-setup cases for 20 jobs and 4 machines. The MILPs setup cases solved optimally 14 jobs and 4 machines cases. Computational tests were executed and analyzed and they highlighted the node count reduction and, consequently, the execution time. The present study points out that the exact methods can be applied to small and medium scheduling problems in practice.

The aim of this thesis is to reach a distinctive rationalization of the production and assembling plant of Cargo Van Brno company. In the project of new lay-out of the production area were all restrictions given by management of the company and by owner of the property strictly met. Technological changes of the process plan and investments suggestions are determined by the company's strategic plan.

This work is concerned with the theoretical analysis of the space-time discontinuous Galerkin method applied to the numerical solution of nonstationary nonlinear convection-diffusion problem in a time- dependent domain. At first, the problem is reformulated by the use of the arbitrary Lagrangian-Eulerian (ALE) method, which replaces the classical partial time derivative by the so-called ALE derivative and an additional convection term. Then the problem is discretized with the use of the ALE space-time discontinuous Galerkin method. On the basis of a technical analysis we obtain an unconditional stability of this method. An important step in the analysis is the generalization of a discrete characteristic function associated with the approximate solutionin a time-dependentdomainand the derivationof its properties. Further we derive an a priori error estimate of the method in terms of the interpolation error, as well as in terms of h and tau. Finally, some practical applications of the ALE space-time discontinuos Galerkin method in a time-dependent domain are given. We are concerned with the numerical solution of a nonlinear elasticity benchmark problem and moreover with the interaction of compressible viscous flow with elastic structures. The main attention is paid to the modeling of flow induced vocal fold...

During the pressing of powder mixtures to make cemented carbide tools, the degree to which the powder spreads to fill the die and to which it compacts is uncertain. This leads to inconsistent dimensions and densities in the finished product. This performance changes with the composition of the powder, including the amount of pressing agent in the mixture, the particle size distribution and particle shape. One way to quantify the degree to which powder will spread to fill the mold evenly is using the property called 'flowability'. There are several techniques by which flowability can be measured, and each technique does not always give results that are consistent with other techniques. It is, therefore, important to know what technique(s) predict(s) the final behavior of the powder in this application before it is used in quality assurance or to design a process. Additionally, powder size distribution and shape metrics are measured using dynamic image analysis to investigate if there is any relationship between key values of these properties and compaction behavior. In this study, static Angle of repose, Tap Density, Hall flow time and Powder rheometry were benchmarked against each other and against the dimensions of presses and liquid phase sintered tool inserts to understand which technique had the strongest dependence on the compactability, which was defined as the ratio of the tallest dimension in the insert to the smallest. After the study, the results showed that a more extensive particle size distribution improves the compaction properties and that the powders with a higher resistance to a rotating blade tend to have better compaction properties. On the other hand, a clear pattern for the results of all measurement methods and the correlation between the compaction behavior of the carbide tools could not be discerned. In conclusion, the study showed that it is possible to determine a relationship between the results of measurement methods and the compaction behavior of powders. By using simple tests to predict the compactability properties, both money and time can be saved on the research of new, improved powder. Furthermore, the implementation of this study can lead to even better pressing and compactibility properties in the future for cemented carbide tools. / Vid pressning av pulverblandningar för tillverkning av hårdmetallverktyg är det osäkert i vilken grad pulvret sprider sig för att fylla matrisen och i vilken grad det komprimeras. Detta leder till inkonsekventa dimensioner och densitet i den färdiga produkten. Denna prestanda förändras med pulvrets sammansättning, inklusive mängden bindemedel som finns i blandningen, partikelstorleksfördelningen och partikelformen. Ett sätt att kvantifiera i vilken grad pulvret sprids för att fylla formen jämnt är att använda den egenskap som kallas "flytbarhet". Det finns flera tekniker för att mäta flytbarhet, och varje teknik ger inte alltid resultat som överensstämmer med andra tekniker. Det är därför viktigt att veta vilken eller vilka tekniker som förutsäger pulvrets slutliga beteende i denna tillämpning innan den används i kvalitetssäkring eller för att utforma en process. Vidare mäts pulvrets partikelstorleksfördelning och form med dynamisk bildanalys för att undersöka om det finns något samband mellan nyckelvärden för dessa egenskaper och komprimeringsbeteendet. I den här studien jämfördes statisk rasvinkel, tappdensitet, hallflödestid och pulverreometri samt med dimensionerna på pressar och sintrade verktygsinsatser i vätskefas för att förstå vilken teknik som hade det starkaste beroendet på kompatibiliteten, vilket definieras som förhållandet mellan den högsta dimensionen i insatsen och den minsta. Efter studien visade resultaten att en mer omfattande partikelstorleksfördelning förbättrar komprimeringsegenskaperna och att pulver med högre motståndskraft mot ett roterande blad tenderar att ha bättre komprimeringsegenskaper. Vidare kunde inte ett tydligt mönster för resultaten för alla mätmetoder och sambandet på komprimeringbeteendet för hårmetallverktygen urskiljas. Sammanfattningsvis visade studien på att det går att använda sig av mätmetoder för att kunna urskilja ett samband mellan resultaten på mätmetoderna och pulvers kompaktibillitetsegenskaper. Genom att använda sig av enkla mätningar för att kunna förutsäga kompaktibilitetsegenskaper samt komprimeringsbeteende kan både pengar respektive tid sparas. Vidare kan genomförandet av denna studie i framtiden leda till ännu bättre pressnings- samt kompaktibilitetsegenskaper för hårdmetallverktyg.