An Approach to Solve Single Machine Job Scheduling Problem using

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.

[1]  Wieslaw Kubiak,et al.  Algorithms for Minclique Scheduling Problems , 1997, Discret. Appl. Math..

[2]  Wieslaw Kubiak,et al.  New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..

[3]  M. Raghavachari,et al.  Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[4]  Xiaoqiang Cai,et al.  V-shape property for job sequences that minimize the expected completion time variance , 1996 .

[5]  Wieslaw Kubiak,et al.  Proof of a conjecture of Schrage about the completion time variance problem , 1991, Oper. Res. Lett..

[6]  Nong Ye,et al.  Job Scheduling Methods for Reducing Waiting Time Variance , 2022 .

[7]  G. Srinivasan,et al.  A branch and bound algorithm to minimize completion time variance on a single processor , 2003, Comput. Oper. Res..

[8]  V. Rajendra Prasad,et al.  Pseudopolynomial algorithms for CTV minimization in single machine scheduling , 1997, Comput. Oper. Res..

[9]  Nong Ye,et al.  Batch scheduled admission control for service dependability of computer and network resources , 2006 .

[10]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[11]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[12]  Jon Postel,et al.  The TCP Maximum Segment Size and Related Topics , 1983, RFC.

[13]  Gur Mosheiov,et al.  Minimizing mean absolute deviation of job completion times from the mean completion time , 2000 .

[14]  M. Raghavachari,et al.  V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functions , 1995 .

[15]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[16]  Nong Ye,et al.  QoS-Centric Stateful Resource Management in Information Systems , 2002, Inf. Syst. Frontiers.

[17]  Prabuddha De,et al.  Scheduling to minimize the coefficient of variation , 1996 .

[18]  Umar Al-Turki,et al.  Tabu search for a class of single-machine scheduling problems , 2001, Comput. Oper. Res..

[19]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[20]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[21]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .