A better heuristic approach for n-job m-machine flow shop scheduling problem
- Heuristic, Flow Shop Scheduling, Makespan, Scheduling .
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.