A new heuristic algorithm for three machines stochstic flow shop scheduling model

In this paper, a new heuristic algorithm is constructed for three machines stochastic flow shop scheduling problem to utilized four parameters simultaneously. The parameters which we have used are probabilistic processing time, transportation times, Job block, and weight of the job. The main objective to construct this algorithm is to obtain the optimal sequence to minimize the makespan, Total utilization times and Total rental cost of the hired machines. A numerical example and Gantt chart is also provided to verify the effectiveness of the developed heuristic algorithm.