Admissions Open
Admissions Open
The present paper is an attempt to obtain a sequence of jobs through heuristic method to optimize the utilization time of machines for specially structured n-job and 2-machine flow shop scheduling problem. Also, the jobs are to be processed in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including transportation time. In flow shop scheduling minimization of total elapsed time may not always result in minimization of utilization time of machines. To minimize the utilization time an algorithm is proposed and a numerical problem is solved to authenticate the algorithm.