A Literature Survey: Accessing Solution Methodology and Improved Scheduling Algorithm

Pages:144-145
A. Srinivasa Swamy (Department of Mathematics, CMJ University, Shillong)

A new implementation of an existing algorithm (GAlg) was adopted for this scheduling problem. This is appropriately named NGAlg algorithm. The NGAlg algorithm was compared with the Best Beta (BESTB) algorithm selected from the literature. The two criteria were aggregated together into a linear composite objective function (LCOF). Five variants of the LCOF were utilized. Performance evaluations were based on both effectiveness and efficiency of the algorithms. Both NGAlg and BESTB algorithms were tested on a set of 900 randomly generated single machine scheduling problems. Experimental results show that the NGAlg algorithm outperformed the BESTB algorithm under all the five different LCOFs and the considered problem sizes.