Flow-shop systems with machine bypass represent production approaches currently widely adopted in several industrial fields (i.e. electronic and belt industries). As a consequence of differences in the manufacturing process, in those systems, jobs are not forced to stop by each machine. Moreover, if a job does not need processing on a machine, it can skip that machine and the very job eventually residing there. In this paper, a new heuristic for solving the flow-shop scheduling problem with machine bypass is presented. The algorithm is able to manage several scheduling performance measures, finding a set ofnon-dominated solutions representing the Pareto front. The heuristic integrates a priority rule and a local search procedure with a Multi Attribute Decision Making (MADM) technique in such a way as to drive the search direction towards good trade-off solutions. To show the effectiveness of the proposed approach some computational results are presented.
|Data di pubblicazione:||2005|
|Titolo:||A HEURISTIC FOR THE FLOW-SHOP SCHEDULING WITH MACHINE BYPASS|
|Autore/i:||GAMBERINI R.; GRASSI A.; MORA C.|
|Nome del convegno:||18th International Conference on Production Research|
|Luogo del convegno:||Fisciano (SA), Italy|
|Data del convegno:||31st July - 4th August|
|Tipologia||Relazione in Atti di Convegno|
File in questo prodotto:
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris