An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem.

•The group sequence sub-problem is approximated into an ATSP.•A novel branch-and-cut algorithm is designed for the ATSP.•The conflicting relationship between makespan and total flow time is implicitly exploited.•An effective MA is proposed, which is the integration of a branch-and-cut and an IG.