2010
DOI: 10.1016/j.is.2010.04.002
|View full text |Cite
|
Sign up to set email alerts
|

A genetic based disk scheduling method to decrease makespan and missed tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 43 publications
(38 reference statements)
0
1
0
Order By: Relevance
“…Another disk scheduling method proposed by Bonyadi [27] was based on a genetic algorithm that considers making a span and the number of missed tasks simultaneously. In his method, a new coding scheme is presented that employs crossover, mutation, and a penalty function for fitness.…”
Section: Disk Scheduling Algorithmsmentioning
confidence: 99%
“…Another disk scheduling method proposed by Bonyadi [27] was based on a genetic algorithm that considers making a span and the number of missed tasks simultaneously. In his method, a new coding scheme is presented that employs crossover, mutation, and a penalty function for fitness.…”
Section: Disk Scheduling Algorithmsmentioning
confidence: 99%
“…Bonyadi [20] proposed a new disk scheduling method based on genetic algorithm that considers make span and number of missed tasks simultaneously. In the proposed method, a new coding scheme is presented that employs crossover, mutation and a penalty function in fitness.…”
Section: Related Workmentioning
confidence: 99%