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 NEHalgorithm and yield better result compared to Palmers Heuristic with objective of minimizing the Makespan for the horizontal rectangular matrix problems.
Highlights
Sequencing is nothing but the selection of an appropriate order for a series of jobs to be done on a finite number of machines or service facilities in some pre assigned order
It has been found that our algorithm performs better than palmers Heuristic and our algorithm solves the problem at quicker possible time when compared to CDS and NEH algorithm
In the year 1970 Herbert G Campbell, Richard A Dudek and Milton L Smith (CDS) find an algorithm to solve the flow shop scheduling using an Heuristic approach even though the result obtained are near optimum its a lengthy process to find near optimum
Summary
Vasudevan G1, Dr Jayakumar S2 and Sathiya shanthi R3 1,3Research Scholar PD & Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar. 2Assistant Professor & Head, PG & Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
