Abstract
The current paper investigates a two-stage flow shop scheduling model with no idle restriction, in which jobs are scheduled to run in a string of two job blocks that are disjoint in nature, and the jobs processing time is correlated with probabilities. Owing to inherent usefulness as well as relevance in real-world situations, jobs' weight has additionally included. In order to eliminate machine idle time and cutting machine cost of rental, the reason for the conduct of the study is to provide a heuristic algorithm which, once put into practice, processes jobs in optimal way, guarantees in smallest conceivable make span. Multiple computational examples generated in MATLAB 2019a serve as testament to efficacy of the proposed strategy operates. The outcomes are contrasted with the current methods that Johnson and Palmer have demonstrated.
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 on Recent and Innovation Trends in Computing and Communication
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.
