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.

A matheuristic approach for the two-machine total completion time flow shop problem

GROSSO, Andrea Cesare;
2014-01-01

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.
2014
213
67
78
Federico Della Croce; Andrea Grosso; Fabio Salassa
File in questo prodotto:
File Dimensione Formato  
f2sumcAOR23_4aperto.pdf

Accesso aperto

Tipo di file: PREPRINT (PRIMA BOZZA)
Dimensione 241.4 kB
Formato Adobe PDF
241.4 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/143643
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 21
social impact