INFLUENCE OF THE STRUCTURE OF A STATIC PERMUTATION FLOWSHOP PROBLEM ON THE PERFORMANCE OF SINGLE-SHOT HEURISTICS

The work gives a classification of the various ''Single Shot heuristic s'' proposed in the literature for the solution of the Static Permutat ion Flowshop (SPF) problems. It then tries to compare their Performanc es and draw a ranking. Since the ranking cannot be univocal, the aim i s to show how it is affected by various elements that characterize a S PF problem (objective function, number of jobs, number of machines, pr ocessing time matrix). The final purpose is to give some guidelines fo r the choice of the proper algorithm on the basis of the specific ''en vironmental conditions'' in which the algorithm will operate.