TY - CHAP A1 - Herrmann, Frank T1 - Schrittweise Verbesserung des Realbetriebs einer Produktionslinie mit simultanem Produktionsfortschritt T2 - Tagungsband zu "Wissenstransfer in der Wirtschaftsinformatik" im Rahmen der MKWI 2016; vom 09. bis 11. März 2016 an der Technischen Universität Ilmenau in Thüringen KW - Produktionslinie KW - Produktionsfortschritt Y1 - 2016 SP - 19 EP - 26 ER - TY - CHAP A1 - Herrmann, Frank A1 - Manitz, Michael T1 - Some remarks to the shape of Clearing Functions T2 - Proceedings of the International Annual Conference of the German Operations Research Society 2015 (OR 2015) Wien, September 1 - 4 KW - clearing functions KW - production planning Y1 - 2015 ER - TY - CHAP A1 - Herrmann, Frank T1 - Observations to Clearing Functions T2 - Proceedings of the 28th EURO Conference on Operations Research, July 12 - 15, 2015, Glasgow, Scotland KW - clearing functions Y1 - 2015 ER - TY - BOOK A1 - Herrmann, Frank T1 - Übungsbuch - Losbildung und Fertigungssteuerung BT - Aufgaben zur operativen Produktionsplanung und -steuerung N2 - Das Aufgabenbuch ergänzt die in Lehrbüchern erläuterten Verfahren der Losbildung und Fertigungssteuerung durch sehr detaillierte und präzise Lösungen. Losbildung und Fertigungssteuerung sind zentrale Kernelemente der operativen Produktionsplanung und -steuerung, insbesondere in kommerziell verfügbaren IT-Systemen. Daher sind diese Verfahren integrale Bestandteile von Veranstaltungen zur Produktion und Logistik, Produktionsplanung und -steuerungsysteme, Supply Chain Management usw. in Bachelor- und Masterstudiengängen an Hochschulen und Universitäten. Zu Beginn einer Lösung wird die verwendete Methodik soweit dargestellt, dass diese mit den in entsprechenden Vorlesungen gelehrten Inhalten ohne weitere Literatur verständlich ist. Einige Themen, wie die Betrachtung von knappen Kapazitäten und von schwankenden Durchlaufzeiten, gehen über den Inhalt von Standardlehrbüchern hinaus und dürften auch für Doktoranden interessant sein. KW - Produktionsplanung KW - Produktionssteuerung KW - PPS KW - Losgröße KW - Operative Planung KW - Aufgabensammlung Y1 - 2018 SN - 978-3-658-21567-5 U6 - https://doi.org/10.1007/978-3-658-21567-5 PB - Springer Fachmedien CY - Wiesbaden ER - TY - BOOK A1 - Herrmann, Frank A1 - Manitz, Michael T1 - Materialbedarfsplanung und Ressourcenbelegungsplanung BT - Durchführung in Produktionsplanungs- und -steuerungssystemen und ihre Analyse KW - Materialbedarf KW - Produktionsplanung KW - Produktionssteuerung KW - PPS Y1 - 2017 SN - 978-3-658-12543-1 U6 - https://doi.org/10.1007/978-3-658-12543-1 PB - Springer Gabler CY - Wiesbaden ER - TY - JOUR A1 - Herrmann, Frank T1 - SIM-R/3: Softwaresystem zur Simulation der Regelung produktionslogistischer Prozesse durch das R/3-System der SAP AG JF - Wirtschaftsinformatik N2 - State of the art in enterprises is the control of business processes by enterprise resource planning systems (ERP systems) such as the R/3 system of SAP AG. A typical task in the implementation phase of ERP systems consists in the choice of an appropriate lot sizing procedure and the setup of its parameters. The existing procedures do not deliver the best results for each business process. So, a business specific setup is required. Unfortunately, there is no knowledge of good parameter settings for typical business processes. Therefore, different parameter settings have to be tested out on real business processes over long periods (e. g. over several years). Of course, such an approach fails due to time restrictions. In addition, the literature argues that an automated software process — contrary to a physical process — is often never called in question or further optimized. An alternative offers a simulation of business processes which is controlled by an ERP system. In the laboratory of information science and production logistics (LIP) at the University of Applied Sciences, Regensburg, a pilot implementation of a system for simulating the control of production processes by the SAP R/3-System (SIM-R/3) was developed. SIM-R/3 allows such a simulation over long periods. KW - Fertigungslogistik KW - Enterprise-Resource-Planning KW - Simulation KW - SAP R/3 KW - eM-Plant KW - Regelung produktionslogistischer Prozesse KW - Planungsverfahren und-parameter in ERP-Systemen Y1 - 2007 U6 - https://doi.org/10.1007/s11576-007-0034-5 VL - 49 IS - 2 SP - 127 EP - 133 ER - TY - CHAP A1 - Herrmann, Frank A1 - Lange, Frederick A1 - Almeder, Christian T1 - Capacity estimation based on clearing functions for the capacitated lot-sizing problem T2 - Proceedings of the 5th International Workshop on Lot-Sizing, August 26th - 29th, 2014, Porto, Portugal N2 - Single-stage capacitated lot-sizing problems (CLSP) are essential for manyplanning tasks in production systems. Due to the hierarchical planning approach, which is widely used in industrial practice and implemented in commercial enterprise resource planning as well as production planning and controlsystems, a subsequent scheduling is necessary to gain executable productionplans. Capacity consumption depends on many factors as, for example, systems workload, machine availability, or yield. Thus, a feasible and optimalsolution of the CLSP may lead to unplanned delays after sequencing and processing the orders on the shop floor. Using a so called clearing function (CF),which represents the relationship between the workload and the output of a production system, this capacity consumption in a CLSP is improved in various ways and tested on a real-world application. KW - Hierarchische Produktionsplanung KW - Kapazitätsplanung KW - Losgröße KW - clearing functions Y1 - 2014 UR - https://www.emse.fr/~absi/IWLS2014/proceedings_IWLS_2014.pdf ER - TY - CHAP A1 - Herrmann, Frank T1 - Genetic algorithm with simulation for scheduling of a flow shop with simultaneously loaded stations T2 - Proceedings of the 28th EUROPEAN Conference on Modeling and Simulation, May 27th - 30th, 2014, Brescia, Italy N2 - 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. Proceedings 28th European Conference on Modelling and Simulation. KW - Ablaufplanung KW - Hierarchische Produktionsplanung KW - Flow-shop-Problem KW - Reihenfolgeproblem KW - Genetischer Algorithmus KW - simulation of restrictions KW - scheduling KW - flow-shop KW - no-buffer (blocking) KW - no-wait KW - genetic algorithm KW - real world application Y1 - 2014 UR - http://www.scs-europe.net/dlib/2014/ecms14papers/simo_ECMS2014_0076.pdf ER - TY - JOUR A1 - Herrmann, Frank T1 - Simulation der Regelung von Unternehmensprozessen durch ein Enterprise Ressource Planning System am Beispiel von SAP R/3 Y1 - 2007 UR - https://www.hs-nordhausen.de/fileadmin/_migrated/content_uploads/FHN_Schriftenreihe_Heft_3_Herrmann_08_06_2007_01.pdf PB - Verlag der Hochschule Nordhausen ER - TY - JOUR A1 - Herrmann, Frank A1 - Tsakpinis, Athanassios A1 - Wiedermann, Wolfgang T1 - Praxisnahe Ausbildung an der FH-Regensburg mit dem Schwerpunkt SAP JF - Krcmar, Helmut; Rautenstrauch, Claus; Wittges, Holger und Schrader; Heino (Hrsg.): Wirtschaftsinformatik-Ausbildung mit SAP®-Software KW - Hochschulstudium KW - Wirtschaftsinformatik KW - Praxisbezug Y1 - 2006 PB - Josef Eul Verlag CY - Lohmar – Köln ER - TY - RPRT A1 - Wohanka, Christian A1 - Helmstreit, Herbert A1 - Herrmann, Frank T1 - Anbindung von Halbleiter Fertigungsautomaten an die SAP NetWeaver Plattform T2 - Forschungsbericht der Hochschule Regensburg KW - Fertigung KW - Automation KW - Halbleiterbauelement KW - SAP NetWeaver Y1 - 2006 SP - 51 EP - 58 PB - Weka Info Verlag CY - Regensburg ER - TY - CHAP A1 - Herrmann, Frank T1 - Simulated Determination and Usage of a Clearing Function for Leadtime Estimation T2 - Proceedings of the 27th EURO Conference on Operations Research, July 13 - 18, 2014, Barcelona, Spain KW - clearing functions KW - lead time estimation Y1 - 2014 ER - TY - RPRT A1 - Herrmann, Frank A1 - Kreutz, Michael T1 - Simulations-System für das R/3-System (SIM-R/3) der SAP AG T2 - Forschungsbericht der Hochschule Regensburg KW - SAP R/3 KW - Simulation Y1 - 2006 SP - 46 EP - 50 PB - Weka Info Verlag CY - Regensburg ER - TY - RPRT A1 - Heindl, Martina A1 - Herrmann, Frank A1 - Juraske, Erich T1 - Simulation von Einlagerstrategien T2 - Forschungsbericht der Hochschule Regensburg KW - Lagerhaltung KW - Raumbedarf KW - Simulation Y1 - 2007 SP - 30 EP - 39 PB - Weka Info Verlag CY - Regensburg ER - TY - JOUR A1 - Herrmann, Frank T1 - Scheduling a flow shop with simultaneously loaded stations: A real world application JF - Journal of Control Science and Engineering N2 - 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. KW - Fließfertigung KW - Flow-shop-Problem KW - Scheduling KW - Real world flow shop with restrictions KW - No buffer and no wait KW - Minimising tardiness KW - Optimisation model KW - Priority rules KW - Priority rule based branch and bound procedure Y1 - 2015 U6 - https://doi.org/10.17265/2328-2231/2015.03.004 VL - 3 SP - 147 EP - 163 ER -