M. Bala Satya Sreekara Reddy
M. Bala Satya Sreekara Reddy has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Nageswara Rao Medikondu
Koneru Lakshmaiah Education Foundation
3 shared publications A. V. R. Surya Prasad
Department of ME, Koneru Lakshamaih Education Foundation, Vaddeswaram Andhra Pradesh, India
2 shared publications- G. Deepika Reddy
Department of ME, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Andhra Pradesh, India
2 shared publications - Rakesh Koppunur
Department of ME, Koneru Lakshamaih Education Foundation, Vaddeswaram Andhra Pradesh, India
2 shared publications T. Vijaya Kumar
Department of ME, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Andhra Pradesh, India
2 shared publicationsA. Shanthi Swaroopini
Department of ME, Vignan’s Institute of Information Technology, Duvvada, Andhra Pradesh, India
1 shared publication
Latest Publications
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Task scheduling in cloud computing environment
Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Open AccessTask scheduling in cloud computing environment
Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Mathematical model for vehicle scheduling
In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move. Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Open AccessMathematical model for vehicle scheduling
In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move. Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2714 (1) , 020030
Soft computing technique for jobs scheduling
In the MUA the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of mean flow time with process time
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2714 (1) , 020030
Open AccessSoft computing technique for jobs scheduling
In the MUA the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of mean flow time with process time
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2714 (1) , 020029
Machine utilization algorithm through numerical model
The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of Machine Utilization Algorithm (MUA) compared with oth
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2714 (1) , 020029
Open AccessMachine utilization algorithm through numerical model
The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of Machine Utilization Algorithm (MUA) compared with oth