Admissions Open
Admissions Open
This paper deals with scheduling of n-jobs on three machines with m-parallel machines for the first machine. The operating cost of all jobs on all parallel machines is given. The processing time of all the jobs on all the machines is given along with their respective probabilities. Our aim is to find an optimal schedule of jobs in order to minimize the total elapsed time of the jobs.
OTHER INSTITUTIONS UNDER MMT