Scheduling Model for Special Class of Flow Shop Problem

The present paper is explored to deal with multi-criteria in scheduling for a special class of job shop problem. We have considered a (n, k) job shop problem in which we have m-parallel service platforms to serve same type of job with different potential and rest others are available to provide particular job services. Our objective is to find out the optimum processing cost, completion time & schedule.