Preetam Kumar Sahu
Research Interests
Preetam Kumar Sahu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
A. Shanthi Swaroopini
Department of ME, Vignan’s Institute of Information Technology, Duvvada, Andhra Pradesh, India
1 shared publicationA. V. R. Surya Prasad
Department of ME, Koneru Lakshamaih Education Foundation, Vaddeswaram Andhra Pradesh, India
1 shared publication- M. Bala Satya Sreekara Reddy
Department of ME, Lakkireddy Bali Reddy College of Engineering, Mylavaram, Andhra Pradesh, India
1 shared publication - Nageswara Rao Medikondu
Koneru Lakshmaiah Education Foundation
1 shared publication - Rakesh Koppunur
Department of ME, Koneru Lakshamaih Education Foundation, Vaddeswaram Andhra Pradesh, India
1 shared publication
Latest Publications
- 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.