An efficient algorithm based on differential evolution for optimum process scheduling

Pooja and Praveena Chaturvedi

International Journal of Data Science, 2017, vol. 2, issue 3, 260-272

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.

Keywords: differential evolution; mutation; process scheduling algorithms; AWT; average waiting time. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=86256 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdsci:v:2:y:2017:i:3:p:260-272

Access Statistics for this article

More articles in International Journal of Data Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().