Admissions Open
Admissions Open
In this paper an attempt is made to study n jobs over two machines where processing times are associated with respective probabilities and also Idle/Waiting Time Operator Oi,w is used for equivalent job block as well as transportation time in addition with arbitrary lags i.e. start lag or stop lag. The objective of the study is to propose an algorithm by which we can minimize the total elapsed time in two stage flow shop scheduling with considering various system parameters. A numerical illustration is also given to clarify the proposed concept.