A matheuristic approach for the two-machine total completion time flow shop problem
F Della Croce, A Grosso, F Salassa - Annals of Operations Research, 2014 - Springer
F Della Croce, A Grosso, F Salassa
Annals of Operations Research, 2014•SpringerThis 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 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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果