The present paper is an attempt through heuristic method to obtain the optimal sequence for n jobs two stage open shop problem in which the processing times are associated with probabilities. The concepts of equivalent job for a job block and transportation time from one machine to another are also taken into consideration. The algorithm developed in this paper is very simple and easy to understand. A computer program followed by numerical illustration is given to clarify the algorithm.