Minimization of total waiting time of jobs in n 2 specially structured Flow Shop Scheduling with set up time separated from processing time and each associated with probabilities

One of the most noteworthy issues in the setting up and function of programmed systems is scheduling but the creation of frequently admirable schedules has proven to be extremely complicated. In this paper an attempt is made to study specially structured n x2 flow shop scheduling in which set up time is detached from processing time both coupled by means of probabilities assuming that maximum of the equivalent processing time on first machine is less than or equal to the minimum of equivalent processing time on second machine. The problem conferred here is wider & basically more applicable and has noteworthy use when the goal is to minimize the total waiting time of jobs. The purpose of the study is to get most favorable progression of jobs in order to decrease the total waiting time of the jobs through iterative algorithm. The algorithm is made clear by numerical example.