S. Jayakumar, G. Vasudevan
email@example.com , firstname.lastname@example.org
S. Jayakumar1 G. Vasudevan2
1Head of the department, Department of mathematics, Arignar anna government arts college, Cheyyar, Tamilnadu, India, 604407.
2Research scholar, Aarignar anna government arts college, Cheyyar, Tamilnadu, India, 604407.
Volume - 9,
Issue - 1,
Year - 2019
Scheduling has it origin in manufacturing industries particularly flow shop scheduling has its origin in the 1950’s minimizing the makespan is the criteria for the single machine, two machine scheduling. For more than two complexities arises. Therefore Johnson’s algorithms have into existence. Here in this paper we have developed one algorithm namely JV’s algorithms for solving general problem and an example also given. This paper proposes the permutation flow shop scheduling problem with the objective of minimizing the makespan using the new modified proposed method. The algorithm gives feasible solution and we believe our algorithm is the best in solving permutation flow shop scheduling problem.
Cite this article:
S. Jayakumar, G. Vasudevan. Heuristic Algorithm for Permutation flow shop Scheduling.Int. J. Tech. 2018; 9(1):05-07. doi: 10.5958/2231-3915.2019.00002.6
S. Jayakumar, G. Vasudevan. Heuristic Algorithm for Permutation flow shop Scheduling.Int. J. Tech. 2018; 9(1):05-07. doi: 10.5958/2231-3915.2019.00002.6 Available on: https://www.ijtonline.com/AbstractView.aspx?PID=2019-9-1-2