Abstract
In manufacturing industries, scheduling problems are the origin. Particularly flowshop scheduling problem occurs in time table algorithm, operatory theory and combinatorial optimization problem with the total completion time (TCT) minimizing is a herculean task to obtain near optimal solution. Researchers are interested in solving these types of problems with the objective being that TCT is quite fashionable. Comparing the solution with existing one is quite logical to arrive the conclusion which algorithm performance better than the other. The heuristic approach developed by us, Jayakumar and Vasudevan performs better compare with other algorithms found in the literature.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
