Vol. 4 No. 1 (2020): Vol 4, Iss 1, Year 2020
Articles

A better heuristic approach for n-job m-machine flow shop scheduling problem

Vasudevan G
Research Scholar PD & Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar.
Jayakumar Dr
Assistant Professor & Head, PG & Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar
Sathiya shanthi R
Research Scholar PD & Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar
Published June 30, 2020
Keywords
  • Heuristic, Flow Shop Scheduling, Makespan, Scheduling .
How to Cite
G, V., Dr, J., & R, S. shanthi. (2020). A better heuristic approach for n-job m-machine flow shop scheduling problem. Journal of Computational Mathematica, 4(1), 118 - 124. https://doi.org/10.26524/cm71

Abstract

Scheduling problem has its origin in manufacturing industry.In this paper we describe a simple approach for solving the flow shop scheduling problem. The result we obtained has been compared with Palmers Heuristic and CDS algorithms along with NEH. It was found that our method will reach near optimum solution within few steps compared to CDS and NEH
algorithm and yield better result compared to Palmers Heuristic with objective of minimizing the Makespan for the horizontal rectangular matrix problems.

Downloads

Download data is not yet available.