Two stage flow shop scheduling model including transportation time with equipotential machines at every stage

Abstract

This study presents a solution algorithm for the problem of minimizing the makespan on equipotential parallel machines at every stage in two stage flow shop scheduling model. The processing time of all the jobs on all the two machines is given and the time for which parallel equipotential machines are available is also given. Transportation time for moving the jobs from first machine to second machine is also taken into consideration. A mathematical illustration is also given in support of the algorithm proposed.