Archivio Istituzionale della RicercaThis paper deals with the total completion time 2-machines flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n 2) variables and O(n) constraints.
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem / DELLA CROCE DI DOJOLA, Federico; Grosso, A.; Salassa, FABIO GUIDO MARIO. - 6622:(2011), pp. 38-47. (Intervento presentato al convegno 11th European Conference, EvoCOP 2011 tenutosi a Torino (IT) nel April 27-29, 2011) [10.1007/978-3-642-20364-0_4].
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem
DELLA CROCE DI DOJOLA, Federico;SALASSA, FABIO GUIDO MARIO
2011
Abstract
This paper deals with the total completion time 2-machines flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n 2) variables and O(n) constraints.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2415137
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo