A new Method for Job Scheduling According to Minimize Variance and Mean Time

摘要：

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. Its 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.

关键词： component single machine schedulig static and dynamic scheduling mean variance

作者: Solmaz Abdollahi Zad Fatemeh Dashti

作者单位: Islamic Azad University – Tabriz BranchTabriz, Iran Young Researchers Club Islamic Azad University - Tabriz Branch Tabriz, Iran

会议类型: 国际会议

会议名称: 2011 International Conference on Information System and Computational Intelligence(2011 IEEE信息系统与计算智能国际会议 ICISCI 2011)

会议地点: 哈尔滨

会议语种:英文

页码: 430-434

在线出版日期: 2011-01-18（万方平台首次上网日期，不代表论文的发表时间）