• Bharat Goyal
• Dr. Deepak Gupta

In this paper, we study specially structured nx2 Flow Shop Scheduling model where the probabilities are considered with processing times of the machines. The time consumed in transportation of a job from machine-1 to machine-2 is also taken into account. The intention of the findings is to get optimal sequence of jobs in order to optimize the total waiting time of the jobs through iterative algorithm. The algorithm is also applied to a numerical example.

Waiting time of jobs, Transportation time, Flow Shop Scheduling, Processing time.

"Two Stage Specially Structured Flow Shop Scheduling Including Transportation Time Of Jobs And Probabilities Associated With Processing Times To Minimize Total Waiting Time Of Jobs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 6, page no.431-439, June-2018, Available :http://www.jetir.org/papers/JETIR1806662.pdf

"Two Stage Specially Structured Flow Shop Scheduling Including Transportation Time Of Jobs And Probabilities Associated With Processing Times To Minimize Total Waiting Time Of Jobs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 6, page no. pp431-439, June-2018, Available at : http://www.jetir.org/papers/JETIR1806662.pdf