Flexible Job Shop Optimization with Simulated Annealing
M.C. Bak (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Mathijs de Weerdt – Mentor (TU Delft - Algorithmics)
Kim van den Houten – Mentor (TU Delft - Algorithmics)
Burcu Ozkan – Graduation committee member (TU Delft - Software Engineering)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In this paper, a Simulated Annealing (SA) implementation for a Flexible Job Shop Problem (FJSP), with change-over time, is presented.
This implementation is compared to a Mixed Integer Linear Programming (MILP) optimization, to compare performances.
The SA algorithm starts with creating the first schedule with Global Selection.
The neighbourhood is created with an application of k-insertion.
Annealing is implemented with exponential cooling.
The SA implementation does not consistently outperform the provided MILP implementation. However, the run-time of the simulated annealing is shorter than the MILP.
The algorithm is then also used to discover bottlenecks in the production line presented with the FJSP instances.