TY - JOUR A1 - Herrmann, Frank T1 - Using Optimization Models for Scheduling in Enterprise Resource Planning Systems JF - Systems N2 - Companies often use specially-designed production systems and change them from time to time. They produce small batches in order to satisfy specific demands with the least tardiness. This imposes high demands on high-performance scheduling algorithms which can be rapidly adapted to changes in the production system. As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System (in the SAP system for example) or can be connected to it. In a real-world application of a flow shop with special restrictions this approach is successfully used on a standard personal computer. Thus, the main implication is that optimal scheduling with a commercially-available tool, incorporated in an Enterprise Resource Planning System, may be the best approach. KW - scheduling KW - optimization model KW - real world application KW - enterprise resource planning system KW - material requirements planning II KW - priority rules Y1 - 2016 U6 - https://doi.org/10.3390/systems4010015 VL - 4 IS - 1 SP - 1 EP - 15 PB - MDPI CY - Basel ER - TY - CHAP A1 - Herrmann, Frank T1 - Simulation based priority rules for scheduling of a flow shop with simultaneously loaded stations T2 - Proceedings of the 27th EUROPEAN Conference on Modeling and Simulation, May 27th - 30th, 2013, Ă…lesund, Norway 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. 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. KW - simulation of processing time KW - scheduling KW - flow-shop KW - no-buffer (blocking) KW - no-wait KW - priority rules KW - real world application KW - Hierarchische Produktionsplanung KW - Flow-shop-Problem KW - Reihenfolgeproblem Y1 - 2013 U6 - https://doi.org/10.7148/2013-0775 SP - 775 EP - 781 ER -