Task scheduling problem is one of the most important steps in using cloud computing environment capabilities. Different experiments show that although having an optimum solution is almost impossible but having a sub-optimal solution using heuristic algorithms seems possible. In this paper three heuristic approaches for task scheduling on cloud environment have been compared with each other. The...

The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we sh...

Scheduling is a critical problem in Cloud computing, because a cloud provider has to serve many users in Cloud computing system. So scheduling is the major issue in establishing Cloud computing systems. A good scheduling technique also helps in proper and efficient utilization of the resources. Many scheduling techniques have been developed by the researchers like GA (Genetic Algorithm), PSO (P...

Scheduling is one of important methods in maximizing data rate and fairness among multiple users. It is very evident that communication system has less number of radio resources in comparison to high number of users. Scheduling method provides best way to allocate minimum resources to maximum users with satisfying all possible communication requirements. The paper discusses a bell curve based r...

The scheduling based routing scheme is presented in this paper to avoid link failure. The main objective of this system is to introduce a cross-layer protocol framework that integrates routing with priority-based traffic management and distributed transmission scheduling. The reservation scheme is based on ID. The presented scheme guarantees that bandwidth reserved time slot is used by another ...

In this paper, we focus on scheduling the 2-steps graph with UET tasks, i.e. tasks with the same length, in a heterogeneous environment where processors are uniform and have different speeds. Given a 2-steps graph of size n and p processors, we determine the lower bound of the execution time of any scheduling by maximizing the activity of each processor. Then, we present an efficiency schedule ...

Authors are requested to select key words from the following list. You may use plurals and adjectives for combinations like absolute pupillary response, centrifugal optic nerve, inter blobs, etc. If key words are needed which do not appear in this list, please underline them. For animal classification the Latin nomenclature should be used. p-mechanism A-scan a-wave aberration absolute absorptio...

This paper evaluates the accrual based scheduling for cloud in single and multi-resource system. Numerous organizations benefit from Cloud computing by hosting their applications. The cloud model provides needed access to computing with potentially unlimited resources. Scheduling is tasks and resources mapping to a certain optimal goal principle. Scheduling, schedules tasks to virtual machines ...

Scheduling tasks on different resources spread over a grid computing system is an NP complete problem. Assorted researchers are developing adaptation scheduling algorithms for getting optimality. Hence they have proved a good result for tasks scheduling about resources selection. In this review, we study the Group-based Parallel Multi-scheduler (GPMS). It is focused on effectively utilizing the...

Inherent nonlinearities like, deadband, stiction and hysteresis in control valves degenerate plant performance. Valve stiction standouts as a more widely recognized reason for poor execution in control loops. Measurement of valve stiction is essential to maintain scheduling. For industrial scenarios, loss of execution due to nonlinearity in control valves is an imperative issue that should be t...