Admissions Open
Admissions Open
ABSTRACT. Adding transportation time to n×3 flow shop scheduling, this paper describes total waiting time of jobs on Specially Structured machines focused at optimizing overall waiting time of ’n’ jobs when the number of machines(or processing stations) is ’3’. The problem discussed is an extension to an earlier solution. Further addition of transportation time has made this research paper much closer to its real life applicability. Here, the total waiting time is the sum of machine waiting time and the transfer time taken by a job before its processing starts on the successive machine. The solution is discussed using an iterative algorithm. Furthermore, a practical example is discussed step by step to clarify the application of the algorithm.