Scheduling in Hybrid flowshops with sequence dependent Setup times. A MILP model and a simulated annealing based approach

摘要

In this paper, a scheduling problem is presented based in the tile industries productive system. The problem is explained and formulated as a Hybrid Flowshop problem. Hybrid flow shops are productive systems with several stages where every stage is composed of a pool of machines. A Mixed Integer Programming Model (MILP) is formulated and a heuristic approach is formulated using the Simulated annealing (SA) metaheursitlc. Different aspects of the algorithm are defined and an experimental study is developed to fix the algorithm's parameters. When parameters are fixed, several experiments performed with real case data confirm that the algorithm outperform the results obtained for the shop managers.