Paralleland distributed computing technique is the solution of many high performance computing requirementsin business purpose and research operations. Since parallel computing became useable numbers scheduling algorithms proposed for performance improvement and resource utilization. In this paper we consider scheduling problem for resource allocation to tasks in cluster computing. In addition ...

The Job shop scheduling problem (JSSP) is one of the NP-Hard combinatorial optimization problems. During the last four decades, many researches were devoted on this problem. The goal in the problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolve Cellular Learning Automata (CLA) to make it able to solve the JSSP by minimizing the make...

This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...

We are given a set of identical machines and a sequence of jobs from which we know the sum of the job weights in advance. The jobs have to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. This improves recent results by Azar and Regev who published an algorithm with performanc...

Cloud Computing is computing over the internet offer huge power of computation to the user by paying for the services on demand. The load balancing is important factor in cloud computing environment. The paper compares Min-Min, Max-Min and RASA load balancing algorithm and present a algorithm for load balancing with Minimum Makespan. The algorithm with Minimum Makespan produces higher throughpu...

This paper addresses the analysis of any nondelay, nonpreemptive online schedule for independent jobs on m identical machines. The release dates and the processing times of the jobs are unknown and all jobs have the same priority. For this scenario, it is well known that a tight competitive factor of 2− 1 m can be achieved for the makespan. However in this online scenario, the makespan criterio...

In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minim...

The problem of scheduling in a Flow Shop with Multiple Processors (FSMP) is considered with the objective of minimizing the makespan for static problems. Herein, the usefulness of simulated annealing (SA) is investigated. Two stages are used in generating the makespans. A good initial-heuristic-seed sequence, obtained in the first stage, is improved-upon in the second stage by the SA technique....

This paper focuses on a Flexible Flow Shop (FFS) problem in a paint company in an attempt to minimize production makespan. The FFS problem is characterized by multiple products being produced in machines in stages with sequence dependent set up times and infinite intermediate storages. As the FFS problem is computationally complex, two heuristic methods are employed to solve the Mixed Integer L...

We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with perform...