Title :
A New Method for Job Scheduling According to Minimize Variance and Mean Time
Author :
Zad, Solmaz Abdollahi ; Dashti, Fatemeh
Author_Institution :
Islamic Azad Univ. - Tabriz Branch, Tabriz, Iran
Abstract :
In this paper, we presented a new method for job scheduling and modeled the access requests to web pages in computer network or internet with job scheduling in single machine. We simulated this model in two kinds of problems: 1. Small scaled problems (10 users). 2. Large scaled problems (100 users). The purpose of all problems is to find the minimum amount of mean and variance time. Since these problems are NP-hard, we proposed one type of innovative V shaped arrangement for job scheduling. It´s possible to find the optimal response for small scaled problems with little spent time, so by examining all possible states the optimal responses (minimum mean and variance) were found and evaluated.
Keywords :
Internet; Web sites; minimisation; processor scheduling; Internet; NP-hard problems; Web pages; computer networks; job scheduling method; mean time minimization; single machine scheduling; variance minimization; Dynamic scheduling; Heuristic algorithms; Job shop scheduling; Processor scheduling; Schedules; Single machine scheduling; Time factors; component; mean; single machine schedulig; static and dynamic scheduling; variance;
Conference_Titel :
Communication Systems and Network Technologies (CSNT), 2012 International Conference on
Conference_Location :
Rajkot
Print_ISBN :
978-1-4673-1538-8
DOI :
10.1109/CSNT.2012.107
