Cart (Loading....) | Create Account
Close category search window
 

Solving the Single Processor Scheduling Problem by Using Ant Colony Optimization Technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thakur, R. ; Dept. of Inf. Technol., Anand Eng. Coll., Agra, India ; Yadav, A.

In this paper, we present an efficient programming approach for solving the proposed problem with an analogy, the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant colony optimization technique. The existing proposal is a single processor-scheduling problem in which the sum of values of all jobs is maximized and also presents a new pheromone updating strategy which is used to optimize ACO (Ant Colony Optimization) technique in solving the Traveling Salesman Problem. The value of a job is characterized by a stepwise no increasing function with one or more moments at which the changes of job value occur. We prove that the special case of our problem, with a single moment of change of job values, is equivalent to the well known, NP-hard in the ordinary sense, problem of minimizing weighted number of late jobs. The technique is realized under Java environment, and applied to solve the proposed problem. Finally, in order to solve the general version of the problem, we construct and experimentally test a number of heuristic algorithms.

Published in:

Communication Systems and Network Technologies (CSNT), 2012 International Conference on

Date of Conference:

11-13 May 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.