ecms_neu_mini.png

Digital Library

of the European Council for Modelling and Simulation

 

Title:

Genetic Algorithm With Simulation For Scheduling Of A Flow Shop With Simultaneously Loaded Stations

Authors:

Frank Herrmann

Published in:

 

(2014).ECMS 2014 Proceedings edited by: Flaminio Squazzoni, Fabio Baronio, Claudia Archetti, Marco Castellani  European Council for Modeling and Simulation. doi:10.7148/2014

 

ISBN: 978-0-9564944-8-1

 

28th European Conference on Modelling and Simulation,

Brescia, Italy, May 27th – 30th, 2014

Citation format:

Frank Herrmann (2014). Genetic Algorithm With Simulation For Scheduling Of A Flow Shop With Simultaneously Loaded Stations, ECMS 2014 Proceedings edited by: Flaminio Squazzoni, Fabio Baronio, Claudia Archetti, Marco Castellani  European Council for Modeling and Simulation. doi:10.7148/2014-0657

DOI:

http://dx.doi.org/10.7148/2014-0657

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.

Full text: