1Professor and Head,
2Post M. Sc. Scholar,
*Email: vandanarana452@gmail.com
The present paper is aimed to provide algorithm for minimizing the total waiting time of jobs for specially structured two stage flow-shop scheduling. The model includes the processing times associated with probabilities and transportation time with disjoint job block criteria. The algorithm is made clear by numerical illustration. The lemma has been provided on which study is based.
Waiting time of jobs, Transportation time, Flow shop scheduling, Processing time, string of disjoint Job block etc