Archivio Istituzionale della RicercaThis paper deals with the two-machine total completion time 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 Two-Machine Total Completion Time Flow Shop Problem / DELLA CROCE DI DOJOLA, Federico; Grosso, A.; Salassa, FABIO GUIDO MARIO. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - 213:(2014), pp. 67-78. [10.1007/s10479-011-0928-x]
A Matheuristic Approach For The Two-Machine Total Completion Time Flow Shop Problem
DELLA CROCE DI DOJOLA, Federico;SALASSA, FABIO GUIDO MARIO
2014
Abstract
This paper deals with the two-machine total completion time 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/2427386
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo