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

摘要

This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and Lomnicki (1966) to the recent approaches of Labidi et al. (2018) and Li et al. (2018). The first part of the article contains an overview of the Branch-and-Bound algorithm, how it is applied for scheduling problems and its different components. The literature review is focused on permutation flowshop problems, and shows the contribution of each article to the method itself and its application. The articles are divided according to the characteristics of the problem and summarized in tables for an easier viewing. The objectives of this review are to provide guidelines for future research in the application of the Branch-and-Bound algorithm for scheduling problems and also to be used as an index for authors to locate the articles for particular problems within the state-of-the-art literature. (C) 2020 Elsevier Ltd. All rights reserved.