Abstract
Challenging combinatorial optimization problems are encountered even in the job shop scheduling problems. This paper works reveals with minimizing the total holding cost of completed and in-process products subject to no tardy jobs with Sheep Flocks Heredity Model Algorithm (SFHM) and Shuffled Frog Leaping Algorithm (SFLA) for job shop scheduling problem (JSP). Heuristics algorithms are developed in scholastic search way in which natural big buoyancy is maintained with respect to optimum schedule. Results are produced and compared with literature results in terms of total holding cost, stipulated time and computational time. SFL algorithm performs result oriented than other Heuristics Algorithm.
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 callMore From: International Journal of Computer and Communication Engineering
Disclaimer: 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.
