Das Ziel dieses Projektes ist, die bestehende tägliche Produktionsablaufplanung in der Handgalvanik bei dem Lohngalvanikbetrieb C. Jentner GmbH mit Hilfe eines mathematischen Modells zu optimie-ren. Hierfür wurde das Flexible-Job-Shop-Modell von Ziaee ([1], S. 91-95) ausgewählt und auf die Gegebenheiten vor Ort angepasst. Es gehört zu den MILP-Problemen (mixed integer linear programming- gemischt ganzzahlige Programmierung). Bei der Verwendung des Modells für die Praxis stellt die Modellgröße, die benötigt wird, um die Vorgänge in der Produktion ausreichend abbilden zu können, ein Problem dar. Diese führt zu langen Lösungszeiten, die für den täglichen Einsatz in der Produktionsablaufplanung ungeeignet sind. Zur Lösung dieses Problems wurde ein problemspezifisches Verfahren basierend auf Aggregations- und Dekompositionstechniken entwickelt. Durch Anwendung dieses Verfahrens kann die Problemgröße für den Solver klein und so die Lösungszeit in einem für die tägliche Produktionsablaufplanung annehmbaren Rahmen gehalten werden.

With the increase in fuel prices, the efficient movement of aircraft around an airport can impact the profitability of a flight and an airline. The assignment of a flight to a specific gate not only impacts passenger satisfaction, but also impacts the efficient movement of aircraft from the departure gate to the runway. There have been bodies of research investigating aircraft taxi problems and gate assignment problems. However, each of these research bodies has not included the effects of the other research areas into their respective areas. This research presents a proposed framework that integrates the passenger or freight movement within a terminal with the taxiing of the aircraft to support an integrated approach to solving the gate assignment problem. A solution technique that incorporates a job shop scheduling solution method is presented and demonstrates that a large problem can be solved efficiently and in a short time using both deterministic and stochastic data.

No / The Job Shop Scheduling Problem (JSSP) is a hard combinatorial optimisation problem. This paper presents a heuristic-based Genetic Algorithm (GA) or Hybrid Genetic Algorithm (HGA) with the aim of overcoming the GA deficiency of fine tuning of solution around the optimum, and to achieve optimal or near optimal solutions for benchmark JSSP. The paper also presents a detail GA parameter analysis (also called sensitivity analysis) for a wide range of benchmark problems from JSSP. The findings from the sensitivity analysis or best possible parameter combination are then used in the proposed HGA for optimal or near optimal solutions. The experimental results of the HGA for several benchmark problems are encouraging and show that HGA has achieved optimal solutions for more than 90% of the benchmark problems considered in this paper. The presented results will provide a reference for selection of GA parameters for heuristic-based GAs for JSSP.

This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the past sixty years, an enormous amount of research has been carried out to solve these problems. The literature review showed the inherent shortcomings of solutions to scheduling problems. This has directed researchers to develop hybrid approaches, as no single technique for scheduling has yet been successful in providing optimal solutions to these difficult problems, with much potential for improvements in the existing techniques. The hybrid approach complements and compensates for the limitations of each individual solution technique for better performance and improves results in solving both static and dynamic production scheduling environments. Over the past years, hybrid approaches have generally outperformed simple Genetic Algorithms (GAs). Therefore, two novel priority heuristic rules are developed: Index Based Heuristic and Hybrid Heuristic. These rules are applied to benchmark JSSP and compared with popular traditional rules. The results show that these new heuristic rules have outperformed the traditional heuristic rules over a wide range of benchmark JSSPs. Furthermore, a hybrid GA is developed as an alternate scheduling approach. The hybrid GA uses the novel heuristic rules in its key steps. The hybrid GA is applied to benchmark JSSPs. The hybrid GA is also tested on benchmark flow shop scheduling problems and industrial case studies. The hybrid GA successfully found solutions to JSSPs and is not problem dependent. The hybrid GA performance across the case studies has proved that the developed scheduling model can be applied to any real-world scheduling problem for achieving optimal or near-optimal solutions. This shows the effectiveness of the hybrid GA in real-world scheduling problems. In conclusion, all the research objectives are achieved. Finaly, the future work for the developed heuristic rules and the hybrid GA are discussed and recommendations are made on the basis of the results. / Board of Trustees, Endowment Fund Project, KPK University of Engineering and Technology (UET), Peshawar and Higher Education Commission (HEC), Pakistan

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.