A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

作者：

Highlights：

• Detailed review related to the application of branch-and-bound in flowshop problems.

• Branch-and-Bound is usually the exact method most used by authors to find optimal solutions.

• There is a shortage on research related to the use of branch-and-bound in problems with setup times.

摘要

•Detailed review related to the application of branch-and-bound in flowshop problems.•Branch-and-Bound is usually the exact method most used by authors to find optimal solutions.•There is a shortage on research related to the use of branch-and-bound in problems with setup times.

论文关键词：Scheduling,Flowshop,Branch-and-bound,Review

论文评审过程：Received 15 June 2019, Revised 15 January 2020, Accepted 9 May 2020, Available online 29 May 2020, Version of Record 10 June 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113556