With energy demands at an all time high, mechanical power systems are under great scrutiny. Substantial efforts are being made throughout the world to reduce energy use in common mechanical systems such as the internal combustion engine and transmission system. Eliminating or reducing efficiency losses in the transmission is a potential source of improving the efficiency of the system. To do so, various alternative types of transmissions are being investigated. At Brigham Young University, development of a Positively Engaged Continuously Variable Transmission (PECVT) is progressing. In addition to the efficiency increases that would occur as a result of operating the engine at a more constant speed, a PECVT type transmission may reduce efficiency losses that occur in a standard transmission by eliminating the disengagement of involute gear sets to change gear ratios of the transmission. For a PECVT, this is done by maintaining engagement of the input and output members of the transmission, while changing the gear ratio. Both of these types of losses are major contributing factors to the overall efficiency of the transmission and engine system, thus a PECVT is of great interest. The investigation for developing a feasible PECVT began with the identification of a behavioral issue identified in all known PECVT embodiments. This behavioral issue, known as the Non-Integer-Tooth-Problem (NITP), is due to the geometry of an involute gear and prevents specific gear ratios from being achieved. The research effort presented in this thesis returns to the conceptual design of a PECVT to address involutometry along with the NITP. A design tool entitled the Line-of-Action Model is developed which assists in quantifying how a conceptual solution can address the NITP using involutometry principles. As a result of the Line-of-Action Model, the Hybrid Involute Profile was discovered. Due to the simplicity of The Hybrid Involute Profile, it has proven to be an elegant solution to the NITP. Validation of the Hybrid Involute Profile concept was conducted to ensure that this concept satisfies the objectives and requirements of a PECVT and solves the NITP. The validation was completed using two case studies and a theoretical analysis. As a result of the validation, the Hybrid Involute Profile is declared a conceptual principal solution to the NITP. Fulfillment of the PECVT objectives, requirements list and elimination of the NITP by the Hybrid Involute Profile is also demonstrated. With the Hybrid Involute Profile as the conceptual principle solution, the development of a commercially viable PECVT is believed to be attainable.

No description available.

No description available.

No description available.

Untypische Zahnradgetriebebauformen ermöglichen es, die technische Grenzen von Standardgetriebeformen zu überwinden. Beispielsweise ermöglicht das perizyklische Getriebe oder das triaxiale Getriebe „Hypogear“, eine sehr hohe Übersetzung auf kompaktem Bauraum zu realisieren. Zur Gewährleistung der korrekten Funktionsweise sind bei der Getriebeentwicklung mehrere Einbaubedingungen zu beachten. Diese werden im Rahmen des Beitrages zunächst anhand einer Standard – Planetenradgetriebebauform vorgestellt. Im Anschluss folgt eine Anwendung sowie die Erweiterung der Einbaubedingungen auf mehrere untypische Zahnradgetriebe. Hierfür wird das triaxiales Getriebe „Hypogear“, Planetenradgetriebe mit vollem Planeteneingriff, exzentrische Planetenradgetriebe mit unterschiedlich großen Planetenrädern und perizyklische Getriebe betrachtet. / Special gearbox designs make it possible to overcome the technical limits of standard gearbox designs. For example, the pericyclic gearbox or the triaxial gearbox 'Hypogear' makes it possible to realize a very high transmission ratio in a compact installation space. To ensure correct functioning, several assembly conditions must be taken into account during gearbox development. These are first explained using a standard planetary gearbox design as an example. This is followed by an application and the extension of the assembly conditions to several special gearbox designs. For this purpose, the triaxial gearbox 'Hypogear', a full planet engagement planetary gear train, eccentric planetary gearboxes with planet wheels of different sizes and pericyclic gearboxes are analyzed.

The economy of a developing nation like India depends on various sectors such as: Agriculture, Commerce and Industries, Finance, Communication and Information Technology, etc. The manufacturing industries play a key role in contributing to the economy of a nation. They mainly consist of industries like steel casting, automobiles and other heavy manufacturing. This research study is related to automobile industry and particularly the gear manufacturers. The automobile industry is an important industry from the manufacturing point of view. This is due to the fact that it has deep forward and backward linkages with several key segments of the economy and it has a strong multiplier effect. Hence, it is capable of being the driver of economic growth. The recent trend among the automobile manufacturing organizations is to outsource individual components to sub-contractors and conduct the sub-assemblies and assemblies in-house. Some components like gears are important in terms of quality. So in case of these components the automobile manufacturing organizations normally partially outsource the components. They carry out the important finishing operations in-house. Due to this practice, many micro to medium scale gear manufacturers have emerged as sub-contractors to different automobile manufacturing organizations. There is a high amount of competition among different gear manufacturers. To survive the competition any gear manufacturer must focus on the three major aspects: cost, quality and delivery. The focus in this study is on the delivery aspect. Precisely, this thesis attempts to address the scheduling problems in automobile gear manufacturing by proposing efficient solution methodologies in order to aid the gear manufacturers in the delivery of orders in the form of semi-finished gears, to the customers (i.e. automobile manufacturing organizations). The automobile gear manufacturing process can be broadly divided into three distinct stages, starting from the machining of the gear blanks. These three stages in automobile gear manufacturing are: pre heat treatment (pre-HT), heat treatment (HT) and post heat treatment (post-HT). Out of these three stages, the gear manufacturers carry out the first two stages namely pre-HT and HT, and deliver the semi-finished gears to the automobile manufacturing organizations. As most of the operations are carried out by the gear manufacturers, the real research problem lies in identifying bottleneck operations in both pre-HT and HT stages. By addressing the bottleneck operations, one can expect to have a competitive advantage among the gear manufacturers and in turn among the automobile manufacturing organizations. Since every gear manufacturer is involved in both: the pre-HT stage and the HT stage of gear manufacturing, they will always try to achieve both: throughput (from their own company’s perspective) and due date compliance (from the customer’s i.e. automobile manufacturing organizations’ perspective). In order to meet these two objectives for the gear manufacturer, there are two research problems identified in this thesis based on the bottleneck operations: one at the pre-HT stage and the other at the HT stage. The Research Problem 1, identified in the pre HT stage consists of a variety of machining operations. In all the pre-HT operations, one single gear is processed on a machine at a time. The machines used in these operations are essentially the discrete processors as known in the scheduling literature. Among the different operations carried out in the pre-HT stage, the gear shaving operation is the final operation which takes a relatively longer processing time compared to other operations in this stage. Hence this operation becomes the bottleneck operation and the Research Problem 1 is related to this operation. Normally, there are more than one machines available for carrying out the gear shaving operations. The processing time of a job is independent of the type of machine used (identical parallel machines). However, since automobile gears vary widely in terms of size, all the available machines may not be able to process a given job (machine eligibility restrictions). The jobs are made available for processing as and when the job orders are received from the automobile manufacturing organizations. Thus all the jobs may not be available for processing at the same time (unequal release times or dynamic job arrivals). After a job is completed on a machine, a setup is incurred before processing the next job. The setup operations involve cleaning of the machine, changing of cutting tools and toolings, setting of the machining parameters and fine tuning of the machining parameters. The amount of time required for the setup depends on both, the job that has been completed and the job that is to be processed (sequence dependent setup time). Different jobs will have different priorities depending on the nature of the job order, monetary value of the job and urgency for the next stage (job weights). Since the pre-HT stage is an upstream stage in gear manufacturing, particularly to the heat treatment (HT) stage, the aim of this stage will be to feed the downstream stage as quickly as possible. Hence, a completion time based scheduling objective is considered. Since the release times of jobs are unequal, the flowtime of a job is of interest in determining the throughput. Also, since the jobs have different weights, the weighted flowtime is of significance. Therefore, the scheduling objective for Research Problem 1 is taken as minimizing the total weighted flowtime of the jobs in a scheduling window. A vast amount of literature is available on scheduling of parallel machines. However, to the best of our knowledge, no study has simultaneously addressed the job characteristics: unequal release times, sequence dependent setup times and machine eligibility restrictions for identical parallel machines to minimize the total weighted flowtime. The Research Problem 2 was identified at the HT stage of gear manufacturing. The aim of the HT stage in the metallurgical terms is to achieve case hardening of gears. The types of machines used in the HT stage are essentially the batch processing machines (BPM) or simply batch processors (BP). A BP unlike the discrete processor, can process several different jobs at a time. The constituent jobs that are processed together form a batch in the BP. The different operations of this stage are: hardening and soaking, quenching, tempering and shot blasting. The hardening and soaking operation typically takes a longer processing time (6-18 hours) as compared to the other operations (15 minutes to 90 minutes). Also, being the first operation of the HT stage, once the hardening and soaking operation is completed, the other operations can be streamlined. Hence the scheduling of this bottleneck operation is of managerial importance. The jobs arrive at the hardening and soaking operation as and when they are completed at the pre-HT stage (unequal release times). Different jobs may have different processing requirements corresponding to time and temperature setting. Therefore, although a BP can process multiple jobs at a time, jobs with different processing requirements cannot be processed together. Jobs that can be processed together are grouped in job families. Since jobs of different families cannot be processed together we get the situation of incompatible job families. The BP has a fixed and finite capacity (expressed in terms of mass). Jobs will have different masses – which represents the size of jobs (non-identical job sizes). While constructing a batch, a job can be split in case there is a capacity violation for the BP (job splitting). The same priorities of the jobs (job weights) as in the pre-HT stage, will continue in this stage as well. As the Research Problem 2 deals with downstream stage of the gear manufacturing the objective of scheduling will be efficient delivery of the job to the automobile manufacturing organizations. The non-conformance to the due date will result in tardiness of the job. Also, since the jobs have different weights, the weighted tardiness of a job is of significance. Therefore, the scheduling objective for Research Problem 2 is taken as minimizing the total weighted tardiness (TWT) of the jobs in a scheduling window. Compared to the discrete processors, the scheduling of batch processors is a relatively new field (about two decades old). However, a review of literature reveals that no study has simultaneously addressed in any problem domain, the characteristics: unequal release times, incompatible job families, non-identical job sizes and job splitting for scheduling batch processors to minimize the total weighted tardiness. For Research Problem 1, an integer linear programming (ILP) model is developed. A suitable numerical example is developed and the workability of the proposed ILP model is validated for a small sized problem. The computational intractability of the proposed ILP model is verified empirically. Due to the computational intractability, real life large-size problems cannot be solved using the proposed ILP model. This has motivated us to propose simple heuristic algorithms. Accordingly, ten heuristic algorithms are proposed. Out of these ten proposed heuristic algorithms, five heuristic algorithms allow the use of unforced idleness and the remaining five heuristic algorithms do not allow the use of unforced idleness. In scheduling, unforced idleness is a situation when a machine is kept idle even if there are jobs available for processing. In order to understand the performance of the proposed heuristic algorithms, various factors that can affect the performance of the heuristic algorithms are identified based on the literature as well as based on the knowledge gained from the industry. An experimental design is developed based on the identified factors with different levels. A series of computational experiments has been conducted for absolute evaluation of the heuristic algorithms: (a) in comparison with optimal solution for small size problem instances (there are 96 problem instances) and (b) in comparison with the estimated optimal solution for large size problem instances (there are 2880 problem instances). The evaluation is based on computational time and the quality of the solution. With respect to the computational time, it is observed that the time required for obtaining results from the heuristic algorithms is meager. For evaluating the quality of the solution, the two standard performance measures – Average Relative Percentage Deviation (ARPD) which indicates the average performance of the proposed heuristic algorithms and Maximum Relative Percentage Deviation (MRPD) which indicates the worst case performance of the proposed heuristic algorithms have been used. From the results of the experimental evaluation it is observed that the heuristic algorithms incorporating the information on machine eligibility restrictions along with other job characteristics worked relatively better compared to other proposed heuristic algorithms. It is also observed that system congestion plays an important role in determining the performance of the heuristic algorithms. Hence, a further study based on the effect of system congestion on different heuristic algorithms is carried out. The system congestion effect was controlled using the two problem factors: number of jobs and release time of jobs. The computational experiments were based on a total of 48 problem instances. Based on the results it was inferred that for congested systems, the proposed heuristic algorithms allowing unforced idleness perform better than the corresponding heuristic algorithms not allowing unforced idleness. For Research Problem 2, two situations are examined. The first situation pertains to the micro and small scale gear manufacturers. In this case, the gear manufacturers can have a single batch processor (BP) for the operation: hardening and soaking. The other situation pertains to small and medium scale gear manufacturers, and in this case, there are more than one batch processors with possibly different capacities (multiple non-identical batch processors). For the Research Problem 2 with single BP, an ILP model is developed. A suitable numerical example is developed and the workability of the proposed ILP model is validated for a small sized problem. The computational intractability of the proposed ILP model is verified empirically. Due to the computational intractability it is proposed to develop simple heuristic algorithms. Based on the pilot experimental analysis and based on the fact that allowing unforced idleness gave superior results in case of Research Problem 1, it is decided to incorporate unforced idleness while developing heuristic algorithms for the Research Problem 2 with single BP. Accordingly, three groups of heuristic algorithms are proposed for Research Problem 2 with single BP by allowing unforced idleness – (i) Seven variants of the heuristic algorithms are based on the computation of the weighted tardiness, (ii) Three variants of the heuristic algorithms based on computation of the composite job scores and (iii) Three variants of the heuristic algorithms based on the computation of composite family scores followed by the composite job scores. For evaluating the performance of the thirteen proposed heuristic algorithms various factors that can affect the workability of the heuristic algorithms are identified based on the literature as well as based on the knowledge gained from the industry. An experimental design is developed based on these factors with levels. A series of computational experiments has been conducted for absolute evaluation of the heuristic algorithms: (a) in comparison with optimal solution for small size problem instances (192 problem instances) and (b) in comparison with the estimated optimal solution for large size problem instances (7680 problem instances). The evaluation is based on computational time and the quality of the solution. With respect to the computational time, it is observed that the time required for obtaining results from the heuristic algorithms is meager. For evaluating the quality of the solution, the two standard performance measures – ARPD and MRPD, used in Research Problem 1, could not be used here due to the nature of the scheduling objective: minimizing the TWT (as the TWT tends to zero). Therefore, a suitable performance measure was identified in the literature and suitably modified for the Research Problem 2 with single BP under study. This performance measure gives stable results even when the TWT value approaches zero. From the results of the experimental evaluation it is observed that variants of heuristic algorithms based on accommodation of non-consecutive jobs while batch construction, perform better than the other variants of the heuristic algorithms. Following the research study on single BP sitaution, the multiple non-identical BPs situation of Research Problem 2 is studied. The ILP model proposed for the Research Problem 2 with single BP problem is suitably extended to account for multiple non-identical BPs and the workability of the model is demonstrated. Additionally, the proposed heuristic algorithms for the Research Problem 2 with single BP problem have been suitably modified for the multiple non-identical BP situation. After developing a suitable experimental design for Research Problem 2 with multiple non-identical BPs, a series of computational experiments has been conducted for absolute evaluation of the heuristic algorithms in comparison with the estimated optimal solution for large size problem instances, based on the 7680 problem instances. Similar performance measure as that used in the Research Problem 2 with single BP problem is used. The observations made from the experimental evaluation for the Research Problem 2 with multiple non-identical BPs are similar to and therefore consistent with those made for the Research Problem 2 with single BP problem. Finally, a sensitivity analysis to determine the effect of capacity of batch processor sets (BP sets) in terms of: number of batch processors and capacities of each batch processor, for Research Problem 2, is carried out. That is, considering different combinations of the two factors: number of batch processors and capacities of each batch processor, seven different BP sets are considered for the proposed sensitivity analysis. The effect on the scheduling objective: Total Weighted Tardiness for different problem configurations is studied by conducting computational experiments. It is observed that higher net capacities of the BP sets give a proportionately better advantage as compared to lower net capacities of the BP sets. Proportionately better advantage means that the percentage of improvement observed in the scheduling objective is higher than the percentage increase in the net capacity of the BP set. Another observation made is that for a given net capacity, it is better to have multiple BPs with smaller capacities than a single BP with high capacity. Although the problems pertaining to the gear manufacturing process simultaneously considering many real life situations have been addressed in this study, there are some limitations to it such as addressing of identical parallel machines instead of a general case of unrelated parallel machines (for Research Problem 1) and consideration of only deterministic situations for both the research problems. There are many immediate future research directions for the problem studied in this thesis such as overcoming the limitations mentioned in this study, proposing good lower bounds and additional heuristic algorithms, and coming up with integrating both, Research Problem 1 and Research Problem 2 and proposing solution methodologies for the integrated problem.

Ce travail vise à prédire le comportement dynamique de transmissions par engrenages supportées par des paliers hydrodynamiques, semblables à celles utilisées dans le domaine de la propulsion navale. Un modèle couplé de transmission mécanique est présenté ; il traite la plupart des interactions possibles entre les engrenages, les arbres et les paliers. Un élément d’engrenages à dentures larges, avec raideur non linéaire et dépendante du temps, est combiné à des éléments finis de poutre alors que la contribution des paliers est introduite par la résolution directe de l’équation de REYNOLDS et d’un model thermique simplifié. A cause des jeux de fonctionnement des paliers, une attention particulière a été portée à la définition de l’état de référence et des degrés de liberté. La réponse du système est calculée par la combinaison d’un schéma d’intégration temporelle, d’une méthode de NEWTON-RAPHSON et d’un algorithme de contact normal unilatéral de manière à ce que les conditions de contact aux paliers et entre les dents soient simultanément traitées. Les résultats de simulation sont comparés à des mesures réalisées sur un banc d’essai de haute précision possédant un train simple étage en dentures droites et hélicoïdales, supporté par des paliers lisses de type hydrodynamique. Les comparaisons fournissent un bon accord et aboutissent à la validation du modèle de couplage tant sur les aspects globaux que locaux. Bon nombre de résultats sont également présentés, qui montrent que certains paramètres, bien souvent ignorés dans les modèles de la littérature, tels que la position de la zone d’alimentation des paliers, la température de lubrifiant dans les paliers, les accouplements avec l’environnement extérieur peuvent fortement modifier l’équilibre statique et le comportement dynamique du système, jusqu’aux contacts entre les dents. / The present work is aimed at predicting the dynamic behaviour of geared transmissions supported by hydrodynamic journal bearings, similar to those used in naval propulsion. A global model of mechanical transmissions is introduced which deals with most of the possible interactions between gears, shafts and hydrodynamic journal bearings. A specific element for wide-faced gears with non linear time-varying mesh stiffness and tooth shape deviations is combined with shaft finite elements whereas the bearing contributions are introduced based on the direct solution of REYNOLDS’ equation and a simple thermal model. Because of the large bearing clearances, particular attention has been paid to the definition of the degrees-of-freedom and their datum. Solutions are derived by combining a time-step integration scheme, a NEWTON-RAPHSON method and a normal contact algorithm in such a way that the contact conditions in the bearings and on the gear teeth are simultaneously dealt with. The simulation results are compared with the measurement obtained on a high-precision test rig with single stage spur and helical gears supported by hydrodynamic journal bearings. The experimental and simulation results compare well thus validating the simulation strategy both at the global and local scales. A number of results are presented which show that parameters often discarded in global models such as the location of the oil inlet area, the oil temperature in the bearings and external couplings with mechanical parts can be influential on the static and dynamic behaviour of the system.

This thesis examines the various types of transmissions which allow to seamlessly change gears without interrupting the transfer of a motor's power output. In particular, it elaborates on the advantages and disadvantages each design presents for a FormulaStudent/SAE vehicle. Furthermore, the thesis explores the selection of gear ratios and simulates acceleration parameters in order to achieve the best possible dynamic behavior. What is more, the thesis presents a concrete implementation of a transmission for the Husqvarna FE 501 motorcycle redesigned with the Zeroshift mechanism. It includes a fundamental change in the operation of the clutch as well as a gear stress analysis. Last but not least, the TU Brno Racing team incorporated the main conclusions of the thesis into the team's vehicle in order to improve the team's standings in international races.

This master’s thesis is focused on the compilation of a computational modelling of gear mesh engagement dynamics of a spur gear by MBS approach. The user input is the specific geometry of gears, the operating speed, and the load torque. The output are the forces in the gear engagement and the reaction of the forces in the wheel bearings depending on the change in the stiffness of the gear due to the changing number of teeth in the engagement and the change in the axial distance. This model is characterized by a fast and relatively accurate calculation in the time domain. This means that it can react to changes in parameters during simulation such as axial distance, speed, and torque.

In der vorliegenden Arbeit wird ein Simulationsmodell entwickelt und validiert, welches die Hartfeinbearbeitung von Zahnrädern durch kontinuierliches Wälzschleifen abbildet. Dabei liegt ein besonderer Schwerpunkt auf der in fehlerbehafteten Prozessen erzeugten Flankentopografie und deren Bewertung hinsichtlich periodischer Strukturierung und des daraus resultierenden Einflusses auf den Drehfehler. Bei der Betrachtung verschiedener Prozessabweichungen zeigt sich eine starke Abhängigkeit der erzeugten Flankentopografien von verschiedenen Prozessparametern. Die simulativ erzeugten Flanken werden bezüglich periodischer Anteile der Strukturierung mit neuen Methoden analysiert und unter Berücksichtigung aller Zähne in einer Drehfehlersimulation hinsichtlich des Einflusses auf den Drehfehler bewertet. Zur Validierung des Simulationsmodells wird die Fertigung mit gezielter Schwingungsüberlagerung genutzt und Vergleiche sowohl bezüglich der erzeugten Flankentopografie als auch des Drehfehlers gezogen.:1 Einleitung 2 Stand der Wissenschaft und Technik 3 Ziel und Struktur der Arbeit 4 Analyse von periodisch strukturierten Zahnflankentopografien 5 Simulationsmodell 6 Simulationsergebnisse 7 Validierung anhand von Versuchen 8 Zusammenfassung und Ausblick / In this thesis a simulation model representing the hard fine machining of gears by continuous gear grinding is developed and validated. Special emphasis is put on the flank topography generated in faulty processes and its evaluation with respect to periodic structuring and the resulting influence on the transmission error in gear mesh. When considering different process deviations, a strong dependence of the generated flank topographies on different process parameters becomes apparent. The simulated flanks are analysed with new methods regarding periodic parts of the structuring and are evaluated in a gear mesh simulation regarding the influence on the transmission error, taking all teeth into account. For the validation of the simulation model, the manufacturing with targeted vibration superposition is used and comparisons are made with regard to the generated flank topography as well as the transmission error.:1 Einleitung 2 Stand der Wissenschaft und Technik 3 Ziel und Struktur der Arbeit 4 Analyse von periodisch strukturierten Zahnflankentopografien 5 Simulationsmodell 6 Simulationsergebnisse 7 Validierung anhand von Versuchen 8 Zusammenfassung und Ausblick