Learning of Scheduling Algorithm with Maximum Compatible Activity or Minimum Makespan
- Vaishali Kalidas Patel
- Mitual H. Pandya
Activity selection problem, Job shop scheduling problem, Round robin scheduling, Compatible activity, Makespan
For managing process of cpu there are many types of scheduling algorithm. Each scheduling algorithm has its own merits and demerits. A resource is allocated to client depends on mechanism of scheduling algorithms. Scheduling decisions try to minimize average response time,turn around time and waiting time for process. This paper proposes various scheduling algorithm.
Vaishali Kalidas Patel, Mitual H. Pandya. "Learning of Scheduling Algorithm with Maximum Compatible Activity or Minimum Makespan".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.1, Issue 2, pp.121 - 124, URL :https://rjwave.org/ijedr/papers/IJEDR1302024.pdf
Volume 1 Issue 2
Pages. 121 - 124
