Abstract
Flowshop scheduling is a fundamental task in any industry related to production. An optimized schedule ensures efficient generation of products and minimization of waiting time. In this paper, we present a review of the different variants of the flowshop problem and also discuss some of the interesting heuristic algorithms employed to solve the practical problems.