TY - CHAP A1 - Davendra, Donald A1 - Herrmann, Frank A1 - Bialic-Davendra, Magdalena T1 - Scheduling tardiness constrained flow shop with simultaneously loaded stations using Genetic Algorithm T2 - Proceedings of the 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI 2020): Thimphu, Kingdom of Bhutan during March 21-22, 2020 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. KW - simulation of restrictions KW - scheduling, KW - flow-shop KW - no-buffer (blocking) KW - no-wait KW - genetic algorithm KW - real world application KW - Ablaufplanung KW - Hierarchische Produktionsplanung KW - Flow-shop-Problem KW - Reihenfolgeproblem KW - Genetischer Algorithmus Y1 - 2020 U6 - https://doi.org/10.1145/3396474.3396475 PB - ACM 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 - TY - CHAP A1 - Selmair, Maximilian A1 - Herrmann, Frank A1 - Claus, Thorsten A1 - Teich, Enrico T1 - Potential of Reducing the Total Energy Consumption by Scheduling a Jobshop Production System T2 - Proceedings of the 16th International Conference on Simulation in Production and Logistics, September 23 - 25, 2015, Dortmund, Germany N2 - This research paper has evaluated the potential of reducing energy consumption by scheduling jobshop production systems with machines using standby modes in free times. The initial introduction of the planning issue is followed by a description of the approach to assess the available potential. Subsequently, the research procedure by means of simulation, a detailed discussion of the results and a perspective on future research is given. Moreover, the notion that scheduling influences the energy consumption in jobshop production systems is supported. The presented simulation research also documents that there is no direct correlation between energy consumption and total lead time, although this was presumed usually. Finally, this paper provides a forecast for a possible optimisation model as well as an exemplary model with an energy-optimised schedule plan. KW - Produktionsplanung KW - Reihenfolgeproblem KW - Energieverbrauch Y1 - 2015 SP - 375 EP - 384 ER - TY - CHAP A1 - Manitz, Michael A1 - Herrmann, Frank A1 - Munninger, Maximilian T1 - Considering sequence-dependent stochasticity in production schedules T2 - Proceedings of the International Annual Conference of the German Operations Research Society 2017 (OR 2017), Berlin, September 6 - 8, 2017 KW - Produktionsplanung KW - Ablaufplanung KW - Reihenfolgeproblem KW - Stochastischer Prozess Y1 - 2017 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 - CHAP A1 - Herrmann, Frank T1 - Scheduling a flow-shop with simultaneously loaded stations T2 - Proceedings of the International Annual Conference of the German Operations Research Society 2012,(OR 2012), September 4 - 7, Hannover KW - Fließfertigung KW - Flow-shop-Problem KW - Reihenfolgeproblem Y1 - 2012 ER -