An efficient algorithm based on differential evolution for optimum process scheduling
by Pooja; Praveena Chaturvedi
International Journal of Data Science (IJDS), Vol. 2, No. 3, 2017

Abstract: In the contemporary study, a modified variant of first-come, first-serve based on differential evolution (DE) algorithm is proposed for process scheduling. As optimised scheduling of processes in an operating system is the key to the overall system performance and throughput, the proposed algorithm, named optimal process sequence using differential evolution (OPS-DE), utilises the advantages of random solutions for initialisation of population with potential candidate solutions. Finally a new mutation strategy is introduced for generating the mutated solution. The performance of the proposed algorithm is evaluated against three classical process scheduling algorithms in terms of average waiting time (AWT) and standard deviation. The efficiency of the proposed algorithm is shown by the empirical analysis of the numerical results.

Online publication date: Mon, 04-Sep-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Science (IJDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com