Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2013 ◽  
pp. 1114-1131
Author(s):  
Nikolaos Preve
Keyword(s):  
Job Scheduling ◽  
Ant Algorithm ◽  
Grid Network

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
Grid Environment ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2012 ◽  
pp. 13-30
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
System Load ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2012 ◽  
pp. 1114-1131
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
System Load ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

An ant algorithm for balanced job scheduling in grids

2009 ◽  
Vol 25 (1) ◽  
pp. 20-27 ◽  
Author(s):  
Ruay-Shiung Chang ◽  
Jih-Sheng Chang ◽  
Po-Sheng Lin
Keyword(s):  
Job Scheduling ◽  
Ant Algorithm

Research and Application of Integrated Scheduling Management System of Steelmaking-Casting-Rolling Based on Heat Process Model

2013 ◽  
Vol 760-762 ◽  
pp. 1017-1022
Author(s):  
Li Jun Liu ◽  
Zhi Wen ◽  
Fu Yong Su ◽  
Rui Feng Dou ◽  
Xun Liang Liu ◽  
...  
Keyword(s):  
Mathematical Model ◽  
Process Model ◽  
Job Scheduling ◽  
Ant Algorithm ◽  
Heat Process ◽  
Integrated Scheduling ◽  
Rolling Production ◽  
The Mathematical Model ◽  
Scheduling Management ◽  
Batch Planning

by studying steelmaking-casting-rolling production process, a mathematical model of integrated batch planning is established innovatively to minimize processing costs of whole line and computed by an intelligent optimization ant algorithm. On the premise of utilizing and coordinating capacity of steelmaking and rolling, the mathematical model of integrated batch planning can create integrated batch planning to combine steelmaking-casting-rolling closely according to each process constraint conditions and optimization objective. Furthermore, another mathematical model of job scheduling based on heat process model is proposed to not only guarantee the logistics balance between continuous casting and hot rolling, but also acquire the highest ratio of DHCR and lowest energy consumption.

scholarly journals An Ant Colony Optimization For Job Scheduling To Minimize Makespan Time

2015 ◽  
pp. 13-15
Author(s):  
V. SELVI ◽  
R. UMARANI
Keyword(s):  
Ant Colony Optimization ◽  
Numerical Experiments ◽  
Job Scheduling ◽  
Optimal Path ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Ant Colony ◽  
Ant Algorithm ◽  
Makespan Minimization ◽  
Job Scheduling Problem

This paper deals with the makespan minimization for Job Scheduling . Research on optimization techniques of the Job Scheduling Problem (JSP) is one of the most significant and promising areas of an optimization. Instead of the traditional optimization method, this paper presents an investigation into the use of an Ant Colony optimization (ACO) to optimize the JSP. The numerical experiments of ACO were implemented in a small JSP. In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm stimulates the behavior of ants. The main objective of this paper is to minimize the makespan time of a given set of jobs and achieved optimal results are encroached.

Sign in / Sign up

Export Citation Format

Share Document