Admissions Open

Toll Free : 1800 2740 240

logo white (1)

Abstract— This paper is an attempt to study n*3flow shop scheduling problem, where processing time are associated with their respective probabilities including the job block criteria, break down interval and transportation time. The objective of the study is to get an algorithm to minimize the total elapsed time. The method is clarified with the help of numerical illustration.

Admission Enquiry 2025-26

Skip to content