Paper Title :Heuristic And Metaheuristic Algorithm For Flow Shop Scheduling: A Survey

Author :Shikha Agrawal, Jitendra Agrawal, Dolly Gohiya, Sanjeev Sharma

Article Citation :Shikha Agrawal ,Jitendra Agrawal ,Dolly Gohiya ,Sanjeev Sharma , (2015 ) " Heuristic And Metaheuristic Algorithm For Flow Shop Scheduling: A Survey " , International Journal of Soft Computing And Artificial Intelligence (IJSCAI) , pp. 10-14, Volume-3,Issue-2

Abstract : 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.

Type : Research paper

Published : Volume-3,Issue-2

	|		PDF	|	Viewed - 117	|	Published on 2015-12-02