Abstract
Basic Flow shop scheduling is converted to three stage flow shop scheduling, this paper describes waiting time of jobs on Specially Structured machines aimed at minimizing total waiting time of ‘n’ jobs when the number of machines (or processing stations) is ‘3’. The problem discussed has wider applicability and has better practical usage when it comes to reducing the overall waiting time of scheduled jobs. The objective of the observation is to bring forth the arrangement/sequence of jobs associated with the least amount of total waiting time using iterative algorithm. The application of the algorithm is universal under given constraints discussed here. Furthermore, a practical example is discussed step by step to clarify the application of the 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: Journal of Computational and Theoretical Nanoscience
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.
