Open AccessA better heuristic approach for n-job m-machine flow shop scheduling problem
Author(s) -
G. Vasudevan,
Jayakumar Dr,
Sathiya shanthi R
Publication year - 2020
Publication title -
journal of computational mathematics
Language(s) - English
Resource type - Journals
ISSN - 2456-8686
DOI - 10.26524/cm71
Subject(s) - job shop scheduling , flow shop scheduling , mathematical optimization , heuristic , scheduling (production processes) , computer science , mathematics , schedule , operating system
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.