A matheuristic approach for the two-machine total completion time flow shop problem
Annals of Operations Research(2011)
摘要
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.
更多查看译文
关键词
Completion Time,Variable Neighborhood Search,Total Completion Time,Mixed Integer Linear Programming Model,Matheuristic Approach
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络