A matheuristic approach for the two-machine total completion time flow shop problem |
| |
Authors: | Federico Della Croce Andrea Grosso Fabio Salassa |
| |
Institution: | 1. D.A.I., Politecnico di Torino, Turin, Italy 2. Dip. Informatica, Università di Torino, Turin, Italy
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|