An Approach to Solve Single Machine Job Scheduling Problem using Heuristic Algorithm
چکیده
1 Department of Computer Science, IISIT, Bhubaneswar, INDIA 2 Department of Mechanical Engineering, CET, Bhubaneswar, INDIA 3 Department of Computer Science, Utkal University, Bhubaneswar, INDIA __________________________________________________________________________________________ Abstract: Single Machine Job Scheduling (SMJS) problem is a scheduling problem where a batch of n jobs scheduled to be processed through a single machine. The significant of these types of problems are their own inherent value, as well as their role as building schedules by the scheduler for more generalized and complex problems. To enhance the scheduler efficiency of a router in computer networks an efficient and optimized scheduling algorithm is required. This seems to have improved the Quality of Service (QoS) of routers in computer networks. Minimizing the Waiting Time Variance (WTV) is one of the vital criteria for developing a heuristic algorithm. As minimizing the WTV is a NP-Hard problem, a heuristic based novel solution approach is intended in this paper. This approach illustrated with small size problems along with randomly new generated problems. The experimental results are compared with existing approaches. The experimental result shows the proposed approach gives best performance for the compared approaches and problems tested. The findings of intended algorithm are shown in the form of table for consonant problems.