Cloud computing is a distributed computing model which enables developers to automatically deploy their applications onto the cloud. There are many applications running on a cloud which requires parallel processing capabilities. Applications of such nature require an efficient scheduling algorithm to manage heavy traffic. The drawbacks of existing scheduling algorithms are low resource utilizat...

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...

This paper investigates the scheduling problem of dealing with disruption caused by machine breakdown under the environment of identical parallel machines. When a machine breakdown changes the scheduling environment, the original schedule cannot be executed according to the prescribed plan. The objective after disruption is to create a recovery schedule that minimizes the original objective fun...

.

we consider online scheduling of jobs with specic release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contr...

The parallel machine, distinct due date, early/tardy machine problem closely models the situation faced by ‘Just-In-Time’ (JIT) manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the neural network. A model for training neural network to sequencing the jobs has been developed based on the vector representation of the early/tardy...

This paper discusses a parallel machine scheduling problem in which the processing times of jobs and the release dates are independent uncertain variables with known uncertainty distributions. An uncertain programming model with multiple objectives is obtained, whose first objective is to minimize the maximum completion time or makespan, and second objective is to minimize the maximum tardiness...

The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the application characteristics. On the other hand, the task of limiting the parallelism in a chosen parallel algorithm is best handled b y the compiler or operating system for the target MPP machine. Toward this end, we have dev...

Many defects in manufacturing system are caused by human resources that show the significance of the human resources in manufacturing systems. Most manufacturers attempt to investigate the human resources in order to improve the work conditions and reduce the human error by providing a proper work-rest schedule. On the other hand, manufacturer deal with machine scheduling based on demand and wo...

The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the “efficiency” of the machinea for each job. It is shown that this method yields better solutions and shorter running times than the more general local search...