@misc{Herrmann, author = {Herrmann, Frank}, title = {Simulation der Regelung von Unternehmensprozessen durch ein Enterprise Ressource Planning System am Beispiel von SAP R/3}, publisher = {Verlag der Hochschule Nordhausen}, language = {de} } @article{HerrmannTsakpinisWiedermann, author = {Herrmann, Frank and Tsakpinis, Athanassios and Wiedermann, Wolfgang}, title = {Praxisnahe Ausbildung an der FH-Regensburg mit dem Schwerpunkt SAP}, series = {Krcmar, Helmut; Rautenstrauch, Claus; Wittges, Holger und Schrader; Heino (Hrsg.): Wirtschaftsinformatik-Ausbildung mit SAP®-Software}, journal = {Krcmar, Helmut; Rautenstrauch, Claus; Wittges, Holger und Schrader; Heino (Hrsg.): Wirtschaftsinformatik-Ausbildung mit SAP®-Software}, publisher = {Josef Eul Verlag}, address = {Lohmar - K{\"o}ln}, subject = {Hochschulstudium}, language = {de} } @techreport{WohankaHelmstreitHerrmann, author = {Wohanka, Christian and Helmstreit, Herbert and Herrmann, Frank}, title = {Anbindung von Halbleiter Fertigungsautomaten an die SAP NetWeaver Plattform}, series = {Forschungsbericht der Hochschule Regensburg}, journal = {Forschungsbericht der Hochschule Regensburg}, publisher = {Weka Info Verlag}, address = {Regensburg}, pages = {51 -- 58}, subject = {Fertigung}, language = {de} } @inproceedings{Herrmann, author = {Herrmann, Frank}, title = {Simulated Determination and Usage of a Clearing Function for Leadtime Estimation}, series = {Proceedings of the 27th EURO Conference on Operations Research, July 13 - 18, 2014, Barcelona, Spain}, booktitle = {Proceedings of the 27th EURO Conference on Operations Research, July 13 - 18, 2014, Barcelona, Spain}, language = {en} } @techreport{HerrmannKreutz, author = {Herrmann, Frank and Kreutz, Michael}, title = {Simulations-System f{\"u}r das R/3-System (SIM-R/3) der SAP AG}, series = {Forschungsbericht der Hochschule Regensburg}, journal = {Forschungsbericht der Hochschule Regensburg}, publisher = {Weka Info Verlag}, address = {Regensburg}, pages = {46 -- 50}, subject = {SAP R/3}, language = {de} } @techreport{HeindlHerrmannJuraske, author = {Heindl, Martina and Herrmann, Frank and Juraske, Erich}, title = {Simulation von Einlagerstrategien}, series = {Forschungsbericht der Hochschule Regensburg}, journal = {Forschungsbericht der Hochschule Regensburg}, publisher = {Weka Info Verlag}, address = {Regensburg}, pages = {30 -- 39}, subject = {Lagerhaltung}, language = {de} } @article{Herrmann, author = {Herrmann, Frank}, title = {Scheduling a flow shop with simultaneously loaded stations: A real world application}, series = {Journal of Control Science and Engineering}, volume = {3}, journal = {Journal of Control Science and Engineering}, doi = {10.17265/2328-2231/2015.03.004}, pages = {147 -- 163}, abstract = {Companies use special designed flow shops, in order to satisfy specific demands. Products need to be transported (from one station to the next station) by a crane and the way of working of this crane excludes the intermediate storage (of a work piece). In addition, the way of working restricts the set of feasible schedules even more than the no-buffer restriction discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. A linear optimisation model is presented to provide a formal description of this NP-hard problem. It is also used to explain the performance of priority rule based heuristic solutions on small test problems. In detail, priority rules as well as a priority rule based branch and bound procedure are analysed; priority rules are regarded, because a priority rule is still the standard procedure for on-line scheduling in industrial practise. Out of successful priority rules in the literature the best one is identified by an extensive simulative investigation. An improved look-ahead is realised by a restricted search over all possible schedules.}, subject = {Fließfertigung}, language = {en} } @inproceedings{VitzthumHerrmann, author = {Vitzthum, Thorsten and Herrmann, Frank}, title = {Evidence of the Relevance of Master Production Scheduling for Hierarchical Production Planning.}, series = {Proceedings, 31st European Conference on Modelling and Simulation (ECMS) 2017, 23rd - May 26th, Budapest, Hungary}, booktitle = {Proceedings, 31st European Conference on Modelling and Simulation (ECMS) 2017, 23rd - May 26th, Budapest, Hungary}, isbn = {978-0-9932440-4-9}, doi = {10.7148/2017-0475}, abstract = {This paper deals with the significance of master production scheduling for hierarchical production planning. Production planning in a typical manufacturing organization is a sequence of complex decisions which depends on a number of factors, such as number of products, complexity of products, number of production sites, and number of work centres in each production site. The main idea in hierarchical production planning is to break down larger problems into smaller, more manageable sub problems. Starting with aggregate production planning, the benefits of using master production scheduling for material requirements planning will be conveyed. The main benefit of master production scheduling is more detailed planning. The production groups are thereby disaggregated into final products and the production site disaggregated into work centres. In order to plan capacities, resource profiles are used. By working with resource profiles production lead time data are taken into account to provide time-phased projections of the capacity requirements for each work centre (Vollmann et al. 2005). The case study will show that more accurate planning and consideration of production lead time through master production scheduling results in a demand program that can be realized without shortages or delays.}, subject = {Hierarchische Produktionsplanung}, language = {en} } @inproceedings{AmannHerrmannLutzetal., author = {Amann, Matthias and Herrmann, Frank and Lutz, Christian and Meier, Markus}, title = {Grad der Zerst{\"o}rung f{\"u}r eine lokale Suche bei einer taktgetriebenen Fließfertigung}, series = {Prozesse, Technologien, Anwendungen, Systeme und Management. Angewandte Forschung in der Wirtschaftsinformatik. Tagungsband zur 27. AKWI-Fachtagung vom 07. bis 10.09.2014 an der Oberbayerischen Technischen Hochschule Regensburg}, booktitle = {Prozesse, Technologien, Anwendungen, Systeme und Management. Angewandte Forschung in der Wirtschaftsinformatik. Tagungsband zur 27. AKWI-Fachtagung vom 07. bis 10.09.2014 an der Oberbayerischen Technischen Hochschule Regensburg}, editor = {Barton, Thomas and Erdlenbruch, Burkhard and Herrmann, Frank and M{\"u}ller, Christian}, publisher = {Verlag News \& Media}, address = {Berlin}, pages = {44 -- 54}, abstract = {Unternehmen produzieren oftmals viele Varianten f{\"u}r ein kleines Kundensegment und in kleinen St{\"u}ckzahlen auf sehr teuren Produktionsanlagen. Deren effiziente und effektive Nutzung erfordert eine m{\"o}glichst gute Planung der Belegung der Stationen mit Auftr{\"a}gen. Sehr wirkungsvoll bei Fertigungslinien sind lokale Suchverfahren. Sie erzielen ein lokales Optimum. Um ein globales Optimum zu erreichen, wird die Suche von einem anderen Punkt des Suchraums fortgesetzt. Dabei sollte kein willk{\"u}rlicher Punkt gew{\"a}hlt werden, sondern nur ein Teil des lokalen Optimums zerst{\"o}rt werden. Unterschiedlich starke Zerst{\"o}rungen werden f{\"u}r eine taktgetriebene Fließfertigung analysiert.}, subject = {Fließvertigung}, language = {de} } @inproceedings{LangeHerrmannClaus, author = {Lange, Frederick and Herrmann, Frank and Claus, Thorsten}, title = {Simulation based capacity estimation for a model of order release planning under the consideration of service levels}, series = {Proceedings of the 15th International Conference on Simulation in Production and Logistics, October 9 - 11, 2013, Paderborn, Germany}, booktitle = {Proceedings of the 15th International Conference on Simulation in Production and Logistics, October 9 - 11, 2013, Paderborn, Germany}, isbn = {978-0-9564944-6-7}, pages = {741 -- 747}, abstract = {Clearing Functions describe the nonlinear relationship between the orders which are in process and the output in capacitated productions systems under high utilization. These Clearing Function can be derived analytical by using steady-state queuing models or empirical by using simulation. We show how to estimate a Clearing Function for a single-level multi-product production system by using a simulation model. This non-linear Clearing Function is integrated into a model of order release planning. We extend this model to consider the uncertainty of the demand by using a Beta service level. We compare our model with an inventory management policy under different demand conditions.}, language = {en} } @inproceedings{Herrmann, author = {Herrmann, Frank}, title = {Simulation based priority rules for scheduling of a flow shop with simultaneously loaded stations}, series = {Proceedings of the 27th EUROPEAN Conference on Modeling and Simulation, May 27th - 30th, 2013, {\AA}lesund, Norway}, booktitle = {Proceedings of the 27th EUROPEAN Conference on Modeling and Simulation, May 27th - 30th, 2013, {\AA}lesund, Norway}, doi = {10.7148/2013-0775}, pages = {775 -- 781}, abstract = {In this study, a real world flow shop with a transportation restriction is regarded. This restriction reduces the set of feasible schedules even more than the no-buffer restrictions discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. This NP-hard problem is solved by priority rules, because of the addressed dynamic environment (and a high number of jobs) at the company site. Due to the technological restrictions the real duration of a job is significantly larger than its net processing time. By a simulation of the processing time many priority rules are improved and some even significantly. With extensive simulations successful priority rules in the literature are analysed.}, subject = {Hierarchische Produktionsplanung}, language = {en} } @inproceedings{MetlickaDavendraHerrmannetal., author = {Metlicka, Magdalena and Davendra, Donald and Herrmann, Frank and Meier, Markus and Amann, Matthias}, title = {GPU accelerated NEH algorithm}, series = {Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), Orlando, FL, 09.-12. Dec. 2014}, booktitle = {Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), Orlando, FL, 09.-12. Dec. 2014}, doi = {10.1109/CIPLS.2014.7007169}, pages = {114 -- 119}, abstract = {This research aims to develop a CUDA accelerated NEH algorithm for the permutative flowshop scheduling problem with makespan criterion. NEH has been shown in the literature as the best constructive heuristic for this particular problem. The CUDA based NEH aims to speed up the processing time by utilising the GPU cores for parallel evaluation. In order to show the versatility and scalability of the CUDA based NEH, four new higher dimensional Taillard sets are generated. The experiments are conducted on the CPU and GPU and pairwise compared. Percentage relative difference and paired t-test both confirm that the GPU based NEH significantly improves on the execution time compared to the sequential CPU version for all the high dimensional problem instances.}, subject = {Flow-shop-Problem}, language = {en} } @inproceedings{Herrmann, author = {Herrmann, Frank}, title = {Perturbation in Local Search for Scheduling}, series = {Proceedings of the 29th EUROPEAN Conference on Modeling and Simulation, May 26th - 29th, 2015, Albena, Bulgaria}, booktitle = {Proceedings of the 29th EUROPEAN Conference on Modeling and Simulation, May 26th - 29th, 2015, Albena, Bulgaria}, doi = {10.7148/2015-0446}, pages = {7}, abstract = {Local search is an established meta heuristic for scheduling problems. To avoid of getting stucked in a local optimum, the achieved solution is destroyed. Usually, this is done randomly. Here, two problem specific procedures are suggested. One focuses on jobs with the highest difference between the actual processing time and the net processing time of the job and the other one tries to remove jobs which causes the highest idle time for themselves or other jobs. Comprehensive simulations of test scheduling problems as well as a real world application show that both problem specific procedures outperform a random procedure.}, subject = {Ablaufplanung}, language = {en} } @inproceedings{Herrmann, author = {Herrmann, Frank}, title = {Simulation of a stochastic model for master production scheduling in a hierarchical production planning system used in industrial practise to cope with demand uncertainty}, series = {Proceedings of the 26th EURO Conference on Operations Research, July 1 - 4, 2013, Rome, Italy}, booktitle = {Proceedings of the 26th EURO Conference on Operations Research, July 1 - 4, 2013, Rome, Italy}, abstract = {Demand uncertainty for master production scheduling is addressed over the last years by approaches of stochastic or robust optimisation. In this contribution a more detailed model is regarded. Instead of analysing the planning results by a cost function, and so implicitly assume that the plans are realizable, here the effects of robust master production scheduling are evaluated using a planning hierarchy that is common in industrial applications. The primary objective is to minimise tardiness of customer order deliveries, and the secondary objective is to minimise inventory of end products.}, language = {en} } @inproceedings{EnglbergerHerrmann, author = {Englberger, Julian and Herrmann, Frank}, title = {Estimating Capacity Load Factors in Master Production Scheduling by the use of Stochastic Optimization}, series = {Tagungsband zu der Tagung Logistikmanagement 2013, 10. - 13. Oktober 2013, Bremen, Deutschland}, booktitle = {Tagungsband zu der Tagung Logistikmanagement 2013, 10. - 13. Oktober 2013, Bremen, Deutschland}, subject = {Produktionsplanung}, language = {en} } @inproceedings{DavendraHerrmannBialicDavendra, author = {Davendra, Donald and Herrmann, Frank and Bialic-Davendra, Magdalena}, title = {Scheduling tardiness constrained flow shop with simultaneously loaded stations using Genetic Algorithm}, series = {Proceedings of the 4th International Conference on Intelligent Systems, Metaheuristics \& Swarm Intelligence (ISMSI 2020): Thimphu, Kingdom of Bhutan during March 21-22, 2020}, booktitle = {Proceedings of the 4th International Conference on Intelligent Systems, Metaheuristics \& Swarm Intelligence (ISMSI 2020): Thimphu, Kingdom of Bhutan during March 21-22, 2020}, publisher = {ACM}, doi = {10.1145/3396474.3396475}, abstract = {In this study, a real world flow shop with a transportation restriction is regarded. This restriction reduces the set of feasible schedules even more than the no-buffer restrictions discussed in the literature in the case of limited storage. Still this problem is NP-hard. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. Compared to even specific priority rule for this class of problems the suggested genetic algorithm delivers significant better results. The specific structure of this class of problems complicates the calculation of the performance criteria. This is solved by a simulation algorithm.}, subject = {Ablaufplanung}, language = {en} } @inproceedings{TrostClausTeichetal., author = {Trost, Marco and Claus, Thorsten and Teich, Enrico and Herrmann, Frank}, title = {Die soziale Dimension in der nachhaltigen hierarchischen Produktionsplanung - Stand der Forschung und Ans{\"a}tze zur Weiterentwicklung bestehender Planungsmodelle}, series = {Proceedings zur NAMA 2016 (NAMA 2016), October 5th - 7th, 2016, Dresden, Germany}, booktitle = {Proceedings zur NAMA 2016 (NAMA 2016), October 5th - 7th, 2016, Dresden, Germany}, pages = {4 S.}, abstract = {Bei der Produktionsplanung steht die Optimierung des Produktionssystems eines Unternehmens im Vordergrund. In diesem Beitrag wird auf Basis der hierarchischen Produktionsplanung aufgezeigt, dass neben {\"o}konomischen und {\"o}kologischen Aspekten insbesondere auch soziale Effekte bei der Entscheidungsfindung zu ber{\"u}cksichtigen sind. Dazu werden f{\"u}r die Hauptproduktionsprogrammplanung, die Losgr{\"o}ßenplanung und die Ressourcenbelegungsplanung dargelegt, welche sozialen Gr{\"o}ßen ber{\"u}cksichtigt werden k{\"o}nnen beziehungsweise bereits ber{\"u}cksichtigt sind. {\"U}berdies wird ein Modellansatz zur Hauptproduktionsprogrammplanung vorgestellt, der auf die Beseitigung identifizierter Forschungsl{\"u}cken abzielt.}, subject = {Hierarchische Produktionsplanung}, language = {de} } @inproceedings{FuchsHerrmannManitz, author = {Fuchs, Michael and Herrmann, Frank and Manitz, Michael}, title = {A Lagrangian relaxation based approach for the capacitated multi-level lot sizing problem with stochastic demands}, series = {SMMSO 2019 - 12th Conference on Stochastic Models of Manufacturing and Service Operations, June 9th - 14th, 2019, Goslar, Germany}, booktitle = {SMMSO 2019 - 12th Conference on Stochastic Models of Manufacturing and Service Operations, June 9th - 14th, 2019, Goslar, Germany}, subject = {Kapazit{\"a}tsbelegungsplanung}, language = {en} } @inproceedings{ManitzHerrmannMunninger, author = {Manitz, Michael and Herrmann, Frank and Munninger, Maximilian}, title = {Considering sequence-dependent stochasticity in production schedules}, series = {Proceedings of the International Annual Conference of the German Operations Research Society 2017 (OR 2017), Berlin, September 6 - 8, 2017}, booktitle = {Proceedings of the International Annual Conference of the German Operations Research Society 2017 (OR 2017), Berlin, September 6 - 8, 2017}, subject = {Produktionsplanung}, language = {en} } @inproceedings{TerbrackHerrmannClaus, author = {Terbrack, Hajo and Herrmann, Frank and Claus, Thorsten}, title = {Determining an optimal energy demand range within master production scheduling}, series = {Proceedings of the International Annual Conference of the German Operations Research Society 2019 (OR 2019) Dresden, September 3 - 6, 2019}, booktitle = {Proceedings of the International Annual Conference of the German Operations Research Society 2019 (OR 2019) Dresden, September 3 - 6, 2019}, subject = {Produktionsplanung}, language = {en} }