![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Abstract
Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed during the last 40 years. Since the problem is known to be NP-hard for more than two machines, most of the research effort has been devoted to the development of heuristic procedures in order to provide good approximate solutions to the problem. However, little attention has been devoted to establish a common framework for these heuristics so that they can be effectively combined or extended. In this paper, we review and classify the main contributions regarding this topic and discuss future research issues.
Keywords:
The online version of the erratum article can be found at 10.1057/palgrave.jors.2601887
The online version of the erratum article can be found at 10.1057/palgrave.jors.2601887
Acknowledgements
The authors are grateful to the anonymous referees for a thorough and ameliorating review. The work of the first author has been supported by CICYT Project DPI-2001-3110.