Admissions Open
Admissions Open
ABSTRACT. Scheduling models concern with the determination to find most favourable succession of jobs so as to reduce whole elapsed time or some other appropriate measure of performance. In this study we find out the solution procedure for the problem of reducing the cost of production and makespan in Nx2 flow shop scheduling dilemma with equipotential parallel machines at every phase in which processing time are related with their individual probabilities. Scheduling jobs on equipotential machines is an important activity for Industrial scheduling. The algorithm is evaluated by solving a mathematical illustration.