Heuristic And Metaheuristic Algorithm For Flow Shop Scheduling: A Survey
The flow shop scheduling problem (FSSP) is one of the widely researched scheduling problems. FSSP is defined
as set of njobs to be processed on set of n machines in the same order. The aim of FSSP is to find best sequence which
minimizes the different objectives like makespan, idle time, tardiness, flow time and work in process. To minimize these
objectives the different heuristic and metaheuristic algorithms have been used by different researchers. This paper presents
the overview of optimization algorithms for flow shop scheduling problem.
Keywords- Flow shop scheduling, makespan, tardiness, heuristic, metaheuristic.