In previous work number of user type and type of task are very large which need to be reduced as this increase the complexity of the work. One more problem in task scheduling is that if urgent or high priority task are regularly available than other task will go in infinite waiting state which makes a long latency time for those tasks. This can be reduced by increasing the priority if the task after some time. Here Min-Min algorithm can be replace by some other fast algorithm as Min-Min reduces the resource utilization and overall latency of the work get increases.
Here whole work is divide into four phase pre-process, generate initial population, teacher, student phase. In each phase working is same for any number of jobs or machine. It means that if the number of jobs is change or number of machine requirement for job is differ then step remain same.
As the dataset available for processing is present in different file format so, some pre-processing steps are required for the conversion of data into experimental environment. In this work data is inform of vectors of the job timing for different machine. So reading of vectors in string form and conversion of those string in proper numeric value is done in pre-processing. Collection of all vector is done in a single matrix is also done here
|IEEE Base paper|
|Doc||Complete Project word file document|
|Read me||Complete read me text file|
|Source Code||Complete Code files|