This review paper provides a comprehensive assessment of scheduling methods for cloud computing, with an emphasis on optimizing resource allocation in computing systems. The PRISMA methodology was utilized to identify 2,487 articles this Following rigorous screening process, 30 papers published between 2018 and 2023 were selected inclusion the review. These analyzed in-depth provide extensive o...

Abstract We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constraint, and where the power objective is to minimize the total energy used. Four online algorithms for this problem have been proposed in the algorithmic literature. Based on the best upper bound that can be pro...

We consider online preemptive scheduling of jobs arriving one by one, to be assigned two identical machines, with the goal makespan minimization. study effect selecting best solution out independent solutions constructed in parallel an fashion. Two cases are analyzed, where case is purely online, and other presented sorted non-increasing sizes. show that using rather than improves performance s...

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

In this paper, we propose a general framework for online scheduling problems in which each machine has multiple states that lead to different processing times. For these problems, in addition to deciding how to assign jobs to machines, we also need to set the states of the machines each time they are assigned jobs. For a wide range of machine environments, job processing characteristics and con...