MULTIPROCESSOR SCHEDULING USING ANT COLONY OPTIMIZATION WHERE JOB VALUES ARE THE POWER FUNCTION OF COMPLETION TIME

This paper deals with an anology of scheduling jobs on prarallel processors using Ant Colony Optimization where job values are given as a power function of the job execution times. We consider a scheduling problem in a machine of parallel processors with the objective of minimization of the total loss of job values is considered as criterion which reflects the minimization of waiting time of the jobs. This paper establishes the computationl complexity of the problem by the application of Ant Colony Optimization on the problem. An augmented experimentation is conducted to evaluate the performance of the parallel processor scheduling using ACO which is strong NP hardness of its general versions and NP hardness of its single machine case. Moreover, some special cases of the problem in the polynomial time.